Submission #954747


Source Code Expand

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <cassert>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
// head

const int N=101000;
int n,m,u,v,lab[N],vis[N],val,eg;
ll c[N],ret;
vector<PII> e[N];
void dfs(int u,int d) {
	vis[u]=1; lab[u]=d; c[d]++;
	for (auto p:e[u]) {
		int v=p.fi; eg++;
		if (vis[v]) {
			val&=(lab[v]==(d+p.se)%3);
		} else {
			dfs(v,(d+p.se)%3);
		}
	}
}
int g[110][110];
int main() {
	scanf("%d%d",&n,&m);
//	while (1) {
//	n=5,m=5;
//	rep(i,1,n+1) e[i].clear(),vis[i]=0;
//	rep(i,1,n+1) rep(j,1,n+1) g[i][j]=0;
	rep(i,0,m) {
		scanf("%d%d",&u,&v);
//		u=rand()%n+1,v=rand()%n+1;
//		if (g[u][v]==1) continue;
		e[u].pb(mp(v,1)); e[v].pb(mp(u,2));
//		g[u][v]=1;
//		printf("%d %d\n",u,v);
	}
/*	while (1) {
		bool val=0;
		rep(p,1,n+1) rep(q,1,n+1) rep(r,1,n+1) if (g[p][q]&&g[q][r]&&!g[r][p]) {
			g[r][p]=1; val=1;
		}
		if (!val) break;
	}
	int cnt=0;
	rep(p,1,n+1) rep(q,1,n+1) cnt+=g[p][q];
	printf("%d\n",cnt);*/
	ret=0;
	rep(i,1,n+1) if (!vis[i]) {
		c[0]=c[1]=c[2]=0;
		val=1; eg=0;
		dfs(i,0);
		if (val) {
			if (c[2]&&c[1]) ret+=c[0]*c[1]+c[1]*c[2]+c[2]*c[0];
			else ret+=eg/2;
		} else ret+=(c[0]+c[1]+c[2])*(c[0]+c[1]+c[2]);
	}
	printf("%lld\n",ret);
	//assert(ret==cnt);
//}
}

Submission Info

Submission Time
Task F - Blackout
User apiad
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 1816 Byte
Status AC
Exec Time 47 ms
Memory 11264 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:43: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:49: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 5 ms 2560 KB
0_01.txt AC 5 ms 2560 KB
0_02.txt AC 5 ms 2560 KB
1_00.txt AC 5 ms 2560 KB
1_01.txt AC 6 ms 3456 KB
1_02.txt AC 35 ms 6528 KB
1_03.txt AC 40 ms 11264 KB
1_04.txt AC 44 ms 11264 KB
1_05.txt AC 40 ms 11264 KB
1_06.txt AC 41 ms 11264 KB
1_07.txt AC 40 ms 11264 KB
1_08.txt AC 40 ms 11264 KB
1_09.txt AC 40 ms 11264 KB
1_10.txt AC 40 ms 11264 KB
1_11.txt AC 40 ms 11264 KB
1_12.txt AC 41 ms 11264 KB
1_13.txt AC 41 ms 11264 KB
1_14.txt AC 31 ms 7284 KB
1_15.txt AC 31 ms 7284 KB
1_16.txt AC 31 ms 7284 KB
1_17.txt AC 25 ms 5248 KB
1_18.txt AC 46 ms 8064 KB
1_19.txt AC 46 ms 8064 KB
1_20.txt AC 46 ms 8064 KB
1_21.txt AC 46 ms 8064 KB
1_22.txt AC 46 ms 8064 KB
1_23.txt AC 46 ms 8064 KB
1_24.txt AC 46 ms 8064 KB
1_25.txt AC 46 ms 8064 KB
1_26.txt AC 46 ms 8064 KB
1_27.txt AC 45 ms 7936 KB
1_28.txt AC 46 ms 8064 KB
1_29.txt AC 46 ms 8064 KB
1_30.txt AC 46 ms 7936 KB
1_31.txt AC 46 ms 8064 KB
1_32.txt AC 46 ms 8064 KB
1_33.txt AC 47 ms 8192 KB
1_34.txt AC 45 ms 7936 KB
1_35.txt AC 42 ms 7296 KB
1_36.txt AC 44 ms 7680 KB
1_37.txt AC 46 ms 8064 KB
1_38.txt AC 43 ms 6912 KB
1_39.txt AC 40 ms 6656 KB
1_40.txt AC 47 ms 8064 KB
1_41.txt AC 46 ms 8064 KB
1_42.txt AC 41 ms 7424 KB
1_43.txt AC 44 ms 7296 KB
1_44.txt AC 46 ms 8064 KB
1_45.txt AC 38 ms 6400 KB
1_46.txt AC 46 ms 8064 KB
1_47.txt AC 46 ms 8064 KB
1_48.txt AC 41 ms 7168 KB
1_49.txt AC 44 ms 7680 KB