Submission #957154


Source Code Expand

#include<bits/stdc++.h>
#define N 100100
using namespace std;
int f[N];
int in[N],out[N];
int a[N],b[N];
bool vis[N];
int c[N];
vector<int> g[N],r[N];
void DFS(int u, bool &sl, int sz[], int col){
	vis[u]=true;
	sz[col]++;
	c[u]=col;
	for(int i=0;i<g[u].size();i++){
		int v=g[u][i];
		if(!vis[v]) DFS(v,sl,sz,(col+1)%3);
		else if((col+1)%3!=c[v]) sl=true;
	}
	for(int i=0;i<r[u].size();i++){
		int v=r[u][i];
		if(!vis[v]) DFS(v,sl,sz,(col+2)%3);
		else if((col+2)%3!=c[v]) sl=true;
	}
}
int main(){
	int n,m;
	long long ans=0;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) f[i]=i;
	for(int i=0;i<m;i++){
		scanf("%d%d",&a[i],&b[i]);
		out[a[i]]++;
		in[b[i]]++;
		g[a[i]].push_back(b[i]);
		r[b[i]].push_back(a[i]);
	}
	for(int i=1;i<=n;i++){
		if(in[i]&&out[i]&&!vis[i]){
			bool sl=false;
			int sz[3]={};
			DFS(i,sl,sz,0);
			if(sl){
				int tsz=sz[0]+sz[1]+sz[2];
				ans+=1LL*tsz*tsz;
			}
			else{
				ans+=1LL*sz[0]*sz[1]+1LL*sz[1]*sz[2]+1LL*sz[2]*sz[0];
			}
		}
	}
	for(int i=0;i<m;i++){
		if(!vis[a[i]]) ans++;
	}
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Submission Time
Task F - Blackout
User aaaaajack
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 1117 Byte
Status AC
Exec Time 55 ms
Memory 21376 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
./Main.cpp:31:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&a[i],&b[i]);
                            ^

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 7 ms 4992 KB
0_01.txt AC 7 ms 4992 KB
0_02.txt AC 7 ms 4992 KB
1_00.txt AC 7 ms 4992 KB
1_01.txt AC 8 ms 5376 KB
1_02.txt AC 43 ms 13568 KB
1_03.txt AC 51 ms 21376 KB
1_04.txt AC 51 ms 21376 KB
1_05.txt AC 51 ms 21376 KB
1_06.txt AC 51 ms 21376 KB
1_07.txt AC 51 ms 21376 KB
1_08.txt AC 51 ms 21376 KB
1_09.txt AC 51 ms 21376 KB
1_10.txt AC 51 ms 21376 KB
1_11.txt AC 51 ms 21376 KB
1_12.txt AC 51 ms 21376 KB
1_13.txt AC 38 ms 9984 KB
1_14.txt AC 42 ms 9976 KB
1_15.txt AC 32 ms 9976 KB
1_16.txt AC 34 ms 10872 KB
1_17.txt AC 25 ms 7040 KB
1_18.txt AC 55 ms 13312 KB
1_19.txt AC 54 ms 13312 KB
1_20.txt AC 54 ms 13312 KB
1_21.txt AC 55 ms 13312 KB
1_22.txt AC 55 ms 13312 KB
1_23.txt AC 55 ms 13312 KB
1_24.txt AC 54 ms 13184 KB
1_25.txt AC 55 ms 13312 KB
1_26.txt AC 55 ms 13312 KB
1_27.txt AC 55 ms 13184 KB
1_28.txt AC 55 ms 13312 KB
1_29.txt AC 55 ms 13312 KB
1_30.txt AC 54 ms 13184 KB
1_31.txt AC 54 ms 13312 KB
1_32.txt AC 55 ms 13312 KB
1_33.txt AC 55 ms 13440 KB
1_34.txt AC 53 ms 12800 KB
1_35.txt AC 49 ms 11008 KB
1_36.txt AC 53 ms 12288 KB
1_37.txt AC 54 ms 13184 KB
1_38.txt AC 47 ms 10368 KB
1_39.txt AC 45 ms 9984 KB
1_40.txt AC 55 ms 13312 KB
1_41.txt AC 55 ms 13312 KB
1_42.txt AC 49 ms 11648 KB
1_43.txt AC 49 ms 11264 KB
1_44.txt AC 54 ms 12928 KB
1_45.txt AC 44 ms 9344 KB
1_46.txt AC 54 ms 13056 KB
1_47.txt AC 55 ms 13184 KB
1_48.txt AC 49 ms 10752 KB
1_49.txt AC 52 ms 12160 KB