Submission #957921


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
#define dame { puts("0"); return 0;}
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,vector<T>,greater<T> >
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}
template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(vector<T>&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
const int MX = 100005, INF = 1001001001;
const ll LINF = 1e18;
const double eps = 1e-10;

vvi to, co;
vi used;
vi s;
bool ok;
int ms;

int dfs(int v, int c=0) {
  if (used[v] != -1) {
    ok &= used[v]==c;
    return 0;
  }
  used[v] = c;
  s[c]++;
  int res = 1;
  rep(i,sz(to[v])) {
    ms++;
    res += dfs(to[v][i], (c+co[v][i])%3);
  }
  return res;
}

int main() {
  int n, m;
  scanf("%d%d",&n,&m);
  to = co = vvi(n);
  rep(i,m) {
    df(a); df(b);
    --a; --b;
    to[a].pb(b); co[a].pb(1);
    to[b].pb(a); co[b].pb(2);
  }
  used = vi(n,-1);
  ll ans = 0;
  rep(i,n) if (used[i] == -1) {
    s = vi(3); ok = true; ms = 0;
    int x = dfs(i);
    if (ok) {
      rep(j,3) ok &= !!s[j];
      if (ok) {
        rep(j,3) ans += (ll)s[j]*s[(j+1)%3];
      } else {
        ans += ms/2;
      }
    } else {
      ans += (ll)x*x;
    }
  }
  cout << ans << endl;
  return 0;
}





Submission Info

Submission Time
Task F - Blackout
User snuke
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 2929 Byte
Status AC
Exec Time 88 ms
Memory 16256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:85:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&n,&m);
                      ^
./Main.cpp: In function ‘int in()’:
./Main.cpp:46:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 inline int in() { int x; scanf("%d",&x); return x;}
                                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1700 / 1700
Status
AC × 3
AC × 53
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt
Case Name Status Exec Time Memory
0_00.txt AC 3 ms 256 KB
0_01.txt AC 3 ms 256 KB
0_02.txt AC 3 ms 256 KB
1_00.txt AC 3 ms 256 KB
1_01.txt AC 12 ms 5376 KB
1_02.txt AC 56 ms 11520 KB
1_03.txt AC 58 ms 16256 KB
1_04.txt AC 61 ms 16256 KB
1_05.txt AC 58 ms 16256 KB
1_06.txt AC 58 ms 16256 KB
1_07.txt AC 58 ms 16256 KB
1_08.txt AC 58 ms 16256 KB
1_09.txt AC 58 ms 16256 KB
1_10.txt AC 59 ms 16256 KB
1_11.txt AC 58 ms 16256 KB
1_12.txt AC 59 ms 16256 KB
1_13.txt AC 59 ms 16256 KB
1_14.txt AC 44 ms 12400 KB
1_15.txt AC 45 ms 12400 KB
1_16.txt AC 44 ms 12400 KB
1_17.txt AC 24 ms 2816 KB
1_18.txt AC 68 ms 12032 KB
1_19.txt AC 68 ms 12032 KB
1_20.txt AC 67 ms 11904 KB
1_21.txt AC 68 ms 12032 KB
1_22.txt AC 68 ms 12032 KB
1_23.txt AC 68 ms 12032 KB
1_24.txt AC 67 ms 11904 KB
1_25.txt AC 68 ms 12032 KB
1_26.txt AC 68 ms 11904 KB
1_27.txt AC 67 ms 11904 KB
1_28.txt AC 67 ms 12032 KB
1_29.txt AC 70 ms 12032 KB
1_30.txt AC 88 ms 11904 KB
1_31.txt AC 70 ms 11904 KB
1_32.txt AC 71 ms 12032 KB
1_33.txt AC 69 ms 12160 KB
1_34.txt AC 63 ms 10112 KB
1_35.txt AC 57 ms 7552 KB
1_36.txt AC 61 ms 9088 KB
1_37.txt AC 66 ms 11264 KB
1_38.txt AC 53 ms 6528 KB
1_39.txt AC 50 ms 6016 KB
1_40.txt AC 67 ms 11648 KB
1_41.txt AC 67 ms 11520 KB
1_42.txt AC 57 ms 8320 KB
1_43.txt AC 58 ms 7808 KB
1_44.txt AC 64 ms 10368 KB
1_45.txt AC 48 ms 5248 KB
1_46.txt AC 69 ms 10752 KB
1_47.txt AC 67 ms 11392 KB
1_48.txt AC 56 ms 7168 KB
1_49.txt AC 61 ms 8960 KB