Submission #1004307


Source Code Expand

#include <algorithm>  
#include <iostream>  
#include <sstream>  
#include <string>  
#include <cstring>
#include <vector>  
#include <queue>  
#include <set>  
#include <map>  
#include <cstdio>  
#include <cstdlib>  
#include <cctype>  
#include <cmath>  
#include <list>  
#include <cassert>
#include <ctime>
#include <climits>
using namespace std;  

#define PB push_back  
#define MP make_pair  
#define SZ(v) ((int)(v).size())  
#define FOR(i,a,b) for(int i=(a);i<(b);++i)  
#define REP(i,n) FOR(i,0,n)  
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)  
#define REPE(i,n) FORE(i,0,n)  
#define FORSZ(i,a,v) FOR(i,a,SZ(v))  
#define REPSZ(i,v) REP(i,SZ(v))  
typedef long long ll;
typedef unsigned long long ull;
ll gcd(ll a,ll b) { return b==0?a:gcd(b,a%b); }

const int MAXN=100000;
const int MAXM=100000;

int n,m;
int ghead[MAXN],gnxt[2*MAXM],gto[2*MAXM];

bool done[MAXN];
int col[MAXN];
int q[MAXN],qhead,qtail;
int cnt[3],haven,havem;
ll process(int s) {
	qhead=qtail=0; cnt[0]=cnt[1]=cnt[2]=haven=havem=0; done[s]=true,col[s]=0,q[qhead++]=s,++cnt[0];
	bool ok=true;
	while(qtail<qhead) {
		int at=q[qtail++]; ++haven;
		for(int x=ghead[at];x!=-1;x=gnxt[x]) {
			++havem;
			int to=gto[x];
			if(ok) {
				int want=(col[at]+1+x%2)%3;
				if(col[to]==-1) col[to]=want,++cnt[want]; else if(col[to]!=want) ok=false;
			}
			if(!done[to]) done[to]=true,q[qhead++]=to;
		}
	}
	//printf("%d ok=%d haven=%d havem=%d cnt=%d %d %d\n",s,ok?1:0,haven,havem,cnt[0],cnt[1],cnt[2]);
	if(!ok) return (ll)haven*haven;
	if(cnt[0]==0||cnt[1]==0||cnt[2]==0) return havem/2;
	return (ll)cnt[0]*cnt[1]+(ll)cnt[1]*cnt[2]+(ll)cnt[2]*cnt[0];
}

void run() {
	scanf("%d%d",&n,&m); REP(i,n) ghead[i]=-1,done[i]=false,col[i]=-1;
	REP(i,m) {
		int a,b; scanf("%d%d",&a,&b); --a,--b;
		gnxt[2*i+0]=ghead[a],ghead[a]=2*i+0,gto[2*i+0]=b;
		gnxt[2*i+1]=ghead[b],ghead[b]=2*i+1,gto[2*i+1]=a;
	}
	ll ret=0;
	REP(i,n) if(!done[i]) ret+=process(i);
	printf("%lld\n",ret);
}

int main() {
	run();
	return 0;
}

Submission Info

Submission Time
Task F - Blackout
User krijgertje
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 2063 Byte
Status AC
Exec Time 27 ms
Memory 3072 KB

Compile Error

./Main.cpp: In function ‘void run()’:
./Main.cpp:65:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m); REP(i,n) ghead[i]=-1,done[i]=false,col[i]=-1;
                     ^
./Main.cpp:67:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int a,b; scanf("%d%d",&a,&b); --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 3 ms 256 KB
0_01.txt AC 3 ms 256 KB
0_02.txt AC 3 ms 256 KB
1_00.txt AC 3 ms 256 KB
1_01.txt AC 4 ms 1152 KB
1_02.txt AC 23 ms 2688 KB
1_03.txt AC 23 ms 3072 KB
1_04.txt AC 22 ms 3072 KB
1_05.txt AC 22 ms 3072 KB
1_06.txt AC 23 ms 3072 KB
1_07.txt AC 23 ms 3072 KB
1_08.txt AC 23 ms 3072 KB
1_09.txt AC 23 ms 3072 KB
1_10.txt AC 23 ms 3072 KB
1_11.txt AC 23 ms 3072 KB
1_12.txt AC 23 ms 3072 KB
1_13.txt AC 23 ms 3072 KB
1_14.txt AC 21 ms 3072 KB
1_15.txt AC 20 ms 3072 KB
1_16.txt AC 20 ms 3072 KB
1_17.txt AC 19 ms 1792 KB
1_18.txt AC 26 ms 2944 KB
1_19.txt AC 26 ms 2944 KB
1_20.txt AC 26 ms 2944 KB
1_21.txt AC 26 ms 2944 KB
1_22.txt AC 26 ms 2944 KB
1_23.txt AC 27 ms 2944 KB
1_24.txt AC 26 ms 2944 KB
1_25.txt AC 26 ms 2944 KB
1_26.txt AC 26 ms 2944 KB
1_27.txt AC 26 ms 2944 KB
1_28.txt AC 26 ms 2944 KB
1_29.txt AC 26 ms 2944 KB
1_30.txt AC 26 ms 2944 KB
1_31.txt AC 26 ms 2944 KB
1_32.txt AC 26 ms 2944 KB
1_33.txt AC 26 ms 2944 KB
1_34.txt AC 25 ms 2688 KB
1_35.txt AC 24 ms 2304 KB
1_36.txt AC 25 ms 2560 KB
1_37.txt AC 26 ms 2816 KB
1_38.txt AC 24 ms 2176 KB
1_39.txt AC 24 ms 2176 KB
1_40.txt AC 26 ms 2944 KB
1_41.txt AC 26 ms 2944 KB
1_42.txt AC 24 ms 2432 KB
1_43.txt AC 24 ms 2432 KB
1_44.txt AC 26 ms 2688 KB
1_45.txt AC 24 ms 2048 KB
1_46.txt AC 26 ms 2816 KB
1_47.txt AC 26 ms 2944 KB
1_48.txt AC 24 ms 2304 KB
1_49.txt AC 25 ms 2560 KB