Submission #3435768


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 100005;
struct Edge{
	int to,next,w;
}e[MAXN<<1];
int head[MAXN],n,m,cnt;
inline void insert(int u,int v)
{
	e[++cnt].to=v,e[cnt].next=head[u],head[u]=cnt,e[cnt].w=1;
	e[++cnt].to=u,e[cnt].next=head[v],head[v]=cnt,e[cnt].w=2;
}
int mark[MAXN],sz,ecnt;
bool succ;
int t[5];
void dfs(int x)
{
	++t[mark[x]];
	++sz;
	for(int i=head[x];i;i=e[i].next){
		int v=e[i].to;
		++ecnt;
		if(mark[v]==-1)mark[v]=(mark[x]+e[i].w)%3,dfs(v);
		else if(mark[v]!=(mark[x]+e[i].w)%3)succ=false;
	}
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;++i){
		int u,v;
		scanf("%d%d",&u,&v);
		insert(u,v);
	}
	memset(mark,-1,sizeof(mark));
	long long ans=0;
	for(int i=1;i<=n;++i)
		if(mark[i]==-1){
			sz=0;
			succ=true;
			memset(t,0,sizeof(t));
			mark[i]=0;
			ecnt=0;
			dfs(i);
			if(!succ)ans+=(long long)sz*sz;
			else{
				int flag=1;
				for(int i=0;i<3;++i)flag&=bool(t[i]);
				if(flag){
					ans+=(long long)t[0]*t[2]+(long long)t[1]*t[0]+(long long)t[2]*t[1];
				}else ans+=ecnt/2;
			}
		}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task F - Blackout
User DFPMTS
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 1175 Byte
Status AC
Exec Time 26 ms
Memory 6528 KB

Compile Error

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

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 640 KB
0_01.txt AC 1 ms 640 KB
0_02.txt AC 1 ms 640 KB
1_00.txt AC 1 ms 640 KB
1_01.txt AC 2 ms 640 KB
1_02.txt AC 19 ms 3328 KB
1_03.txt AC 21 ms 6528 KB
1_04.txt AC 21 ms 6528 KB
1_05.txt AC 21 ms 6528 KB
1_06.txt AC 21 ms 6528 KB
1_07.txt AC 21 ms 6528 KB
1_08.txt AC 20 ms 6528 KB
1_09.txt AC 20 ms 6528 KB
1_10.txt AC 20 ms 6528 KB
1_11.txt AC 21 ms 6528 KB
1_12.txt AC 21 ms 6528 KB
1_13.txt AC 20 ms 6528 KB
1_14.txt AC 17 ms 3328 KB
1_15.txt AC 17 ms 3328 KB
1_16.txt AC 17 ms 3328 KB
1_17.txt AC 17 ms 2944 KB
1_18.txt AC 25 ms 4224 KB
1_19.txt AC 25 ms 4224 KB
1_20.txt AC 25 ms 4096 KB
1_21.txt AC 25 ms 4224 KB
1_22.txt AC 25 ms 4224 KB
1_23.txt AC 25 ms 4224 KB
1_24.txt AC 25 ms 4096 KB
1_25.txt AC 25 ms 4096 KB
1_26.txt AC 25 ms 4224 KB
1_27.txt AC 25 ms 4096 KB
1_28.txt AC 25 ms 4096 KB
1_29.txt AC 25 ms 4224 KB
1_30.txt AC 24 ms 4096 KB
1_31.txt AC 25 ms 4096 KB
1_32.txt AC 25 ms 4096 KB
1_33.txt AC 26 ms 4224 KB
1_34.txt AC 25 ms 4224 KB
1_35.txt AC 24 ms 3968 KB
1_36.txt AC 25 ms 4096 KB
1_37.txt AC 25 ms 4224 KB
1_38.txt AC 24 ms 3840 KB
1_39.txt AC 23 ms 3712 KB
1_40.txt AC 25 ms 4224 KB
1_41.txt AC 25 ms 4224 KB
1_42.txt AC 23 ms 3968 KB
1_43.txt AC 24 ms 3968 KB
1_44.txt AC 25 ms 4224 KB
1_45.txt AC 23 ms 3584 KB
1_46.txt AC 25 ms 4224 KB
1_47.txt AC 25 ms 4224 KB
1_48.txt AC 24 ms 3968 KB
1_49.txt AC 25 ms 4224 KB