Submission #956953


Source Code Expand

#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

int main()
{
  int n,m;
  scanf("%d%d",&n,&m);
  vector<vector<int> > e(n),r(n);
  for(int i=0;i<m;i++){
    int a,b;
    scanf("%d%d",&a,&b);
    a--;
    b--;
    e[a].push_back(b);
    r[b].push_back(a);
  }
  long long ans=0;
  static int V[100000];
  for(int i=0;i<n;i++){
    V[i]=-1;
  }
  for(int i=0;i<n;i++){
    if(V[i]!=-1){
      continue;
    }
    queue<int> Q;
    Q.push(i);
    bool F=0;
    int c=0,C[3]={0};
    V[i]=0;
    C[0]++;
    while(!Q.empty()){
      int j=Q.front();
      Q.pop();
      int v=V[j];
      for(int x=0;x<e[j].size();x++){
	int k=e[j][x];
	c++;
	if(V[k]==-1){
	  V[k]=(v+1)%3;
	  C[V[k]]++;
	  Q.push(k);
	}
	else if(V[k]!=(v+1)%3){
	  F=1;
	}
      }
      for(int x=0;x<r[j].size();x++){
	int k=r[j][x];
	if(V[k]==-1){
	  V[k]=(v+2)%3;
	  C[V[k]]++;
	  Q.push(k);
	}
	else if(V[k]!=(v+2)%3){
	  F=1;
	}
      }
    }
    if(F){
      int A=C[0]+C[1]+C[2];
      ans+=(long long)A*A;
    }
    else if(C[1]==0||C[2]==0){
      ans+=c;
    }
    else{
      ans+=(long long)C[0]*C[1]+(long long)C[1]*C[2]+(long long)C[2]*C[0];
    }
  }
  printf("%lld\n",ans);
  return 0;
}

Submission Info

Submission Time
Task F - Blackout
User Huziwara
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 1271 Byte
Status AC
Exec Time 63 ms
Memory 11648 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:9: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:13:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&a,&b);
                        ^

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 2 ms 256 KB
0_01.txt AC 2 ms 256 KB
0_02.txt AC 2 ms 256 KB
1_00.txt AC 2 ms 256 KB
1_01.txt AC 35 ms 5248 KB
1_02.txt AC 63 ms 11520 KB
1_03.txt AC 41 ms 11520 KB
1_04.txt AC 42 ms 11648 KB
1_05.txt AC 41 ms 11520 KB
1_06.txt AC 41 ms 11520 KB
1_07.txt AC 41 ms 11520 KB
1_08.txt AC 42 ms 11520 KB
1_09.txt AC 42 ms 11520 KB
1_10.txt AC 42 ms 11520 KB
1_11.txt AC 41 ms 11520 KB
1_12.txt AC 42 ms 11520 KB
1_13.txt AC 39 ms 8448 KB
1_14.txt AC 33 ms 9208 KB
1_15.txt AC 33 ms 9208 KB
1_16.txt AC 34 ms 9208 KB
1_17.txt AC 19 ms 1536 KB
1_18.txt AC 55 ms 9216 KB
1_19.txt AC 55 ms 9216 KB
1_20.txt AC 53 ms 9216 KB
1_21.txt AC 56 ms 9344 KB
1_22.txt AC 54 ms 9344 KB
1_23.txt AC 54 ms 9216 KB
1_24.txt AC 53 ms 9216 KB
1_25.txt AC 54 ms 9344 KB
1_26.txt AC 53 ms 9088 KB
1_27.txt AC 54 ms 9216 KB
1_28.txt AC 54 ms 9216 KB
1_29.txt AC 54 ms 9344 KB
1_30.txt AC 52 ms 9216 KB
1_31.txt AC 53 ms 9088 KB
1_32.txt AC 54 ms 9216 KB
1_33.txt AC 56 ms 9344 KB
1_34.txt AC 48 ms 7424 KB
1_35.txt AC 41 ms 4864 KB
1_36.txt AC 45 ms 6528 KB
1_37.txt AC 51 ms 8576 KB
1_38.txt AC 39 ms 4224 KB
1_39.txt AC 38 ms 3840 KB
1_40.txt AC 54 ms 8960 KB
1_41.txt AC 53 ms 8704 KB
1_42.txt AC 42 ms 5888 KB
1_43.txt AC 42 ms 5120 KB
1_44.txt AC 49 ms 7680 KB
1_45.txt AC 37 ms 3328 KB
1_46.txt AC 51 ms 8192 KB
1_47.txt AC 53 ms 8704 KB
1_48.txt AC 40 ms 4608 KB
1_49.txt AC 44 ms 6144 KB