Submission #1365578


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define File(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)
#define maxn 100010

using namespace std;
typedef long long llg;

int hd[maxn],nt[maxn<<1],to[maxn<<1],c[maxn<<1],tt;
int n,m,co[maxn],SIZ,cm,du[maxn];
bool vis[maxn],su;
llg ans,ci[3];

void dfs(int u){
	vis[u]=1; SIZ++; ci[co[u]]++; cm+=du[u];
	for(int i=hd[u],v;v=to[i],i;i=nt[i])
		if(!vis[v]) co[v]=(co[u]+c[i])%3,dfs(v);
		else if(co[v]!=(co[u]+c[i])%3) su=1;
}

int main(){
	scanf("%d %d",&n,&m);
	for(int i=1,x,y;i<=m;i++){
		scanf("%d %d",&x,&y);
		to[++tt]=y;nt[tt]=hd[x];hd[x]=tt;
		to[++tt]=x;nt[tt]=hd[y];hd[y]=tt;
		c[tt-1]=1; c[tt]=2; du[x]++,du[y]++;
	}
	for(int i=1,now;i<=n;i++)
		if(!vis[i]){
			dfs(i);
			if(su) ans+=1ll*SIZ*SIZ;
			else{
				now=(!ci[0])+(!ci[1])+(!ci[2]);
				if(!now) ans+=ci[0]*ci[1]+ci[1]*ci[2]+ci[2]*ci[0];
				else ans+=cm>>1;
			}
			ci[0]=ci[1]=ci[2]=0; SIZ=cm=0; su=0;
		}
	printf("%lld",ans);
	return 0;
}

Submission Info

Submission Time
Task F - Blackout
User LCF
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 1058 Byte
Status AC
Exec Time 29 ms
Memory 7040 KB

Compile Error

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

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 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 2 ms 384 KB
1_02.txt AC 20 ms 3456 KB
1_03.txt AC 21 ms 7040 KB
1_04.txt AC 21 ms 7040 KB
1_05.txt AC 21 ms 7040 KB
1_06.txt AC 21 ms 7040 KB
1_07.txt AC 21 ms 7040 KB
1_08.txt AC 21 ms 6912 KB
1_09.txt AC 21 ms 7040 KB
1_10.txt AC 21 ms 7040 KB
1_11.txt AC 21 ms 6912 KB
1_12.txt AC 21 ms 6912 KB
1_13.txt AC 21 ms 6912 KB
1_14.txt AC 18 ms 3840 KB
1_15.txt AC 18 ms 3840 KB
1_16.txt AC 18 ms 3840 KB
1_17.txt AC 17 ms 2560 KB
1_18.txt AC 28 ms 4736 KB
1_19.txt AC 28 ms 4736 KB
1_20.txt AC 28 ms 4608 KB
1_21.txt AC 28 ms 4608 KB
1_22.txt AC 28 ms 4608 KB
1_23.txt AC 28 ms 4608 KB
1_24.txt AC 28 ms 4608 KB
1_25.txt AC 28 ms 4608 KB
1_26.txt AC 28 ms 4608 KB
1_27.txt AC 27 ms 4608 KB
1_28.txt AC 28 ms 4608 KB
1_29.txt AC 28 ms 4608 KB
1_30.txt AC 27 ms 4608 KB
1_31.txt AC 28 ms 4608 KB
1_32.txt AC 28 ms 4608 KB
1_33.txt AC 28 ms 4736 KB
1_34.txt AC 27 ms 4480 KB
1_35.txt AC 26 ms 3968 KB
1_36.txt AC 27 ms 4352 KB
1_37.txt AC 28 ms 4608 KB
1_38.txt AC 25 ms 3712 KB
1_39.txt AC 25 ms 3584 KB
1_40.txt AC 28 ms 4608 KB
1_41.txt AC 29 ms 4608 KB
1_42.txt AC 26 ms 4096 KB
1_43.txt AC 27 ms 3968 KB
1_44.txt AC 28 ms 4480 KB
1_45.txt AC 25 ms 3456 KB
1_46.txt AC 28 ms 4608 KB
1_47.txt AC 28 ms 4608 KB
1_48.txt AC 26 ms 3840 KB
1_49.txt AC 28 ms 4224 KB