Submission #7863945


Source Code Expand

Copy
#include <bits/stdc++.h>

#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif

using namespace std;

vector<string> F;
vector<int> adj[200], tree[200];
int dist[200], depth[200];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	TEST(freopen("input.txt","r",stdin));
	TEST(freopen("output.txt","w",stdout));
	TEST(freopen("debug.txt","w",stderr));
	int N, ans=0, c;
	queue<int> Q;
	cin>>N; F.resize(N);
	for(int i=0;i<N;i++) {
		cin>>F[i];
		for(int j=0;j<N;j++) if(F[i][j]=='1') adj[i].push_back(j);
	}
	memset(dist,0x7f,sizeof(dist));
	for(int i=0;i<N && ans>=0;i++) if(dist[i]==0x7f7f7f7f) {
		dist[i]=ans+1;
		Q.push(i);
		while(!Q.empty()) {
			c=Q.front();
			Q.pop();
			for(auto n: adj[c]) {
				if(dist[n]>dist[c]+1) {
					dist[n]=dist[c]+1;
					tree[c].push_back(n);
					tree[n].push_back(c);
					Q.push(n);
				}
				else if(abs(dist[n]-dist[c])!=1) {
					ans=-1;
					while(!Q.empty()) Q.pop();
					break;
				}
			}
		}
		memset(depth,-1,sizeof(depth)); depth[c]=1;
		Q.push(c);
		while(!Q.empty()) {
			c=Q.front();
			Q.pop();
			for(auto n: tree[c]) if(depth[n]==-1) {
				depth[n]=depth[c]+1;
				Q.push(n);
			}
		}
		ans+=depth[c];
	}
	cout<<ans<<'\n';
	return 0;
}

Submission Info

Submission Time
Task B - Graph Partition
User Lawali
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1342 Byte
Status WA
Exec Time 2 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
WA × 1
AC × 22
WA × 33
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt WA 1 ms 384 KB
02.txt WA 1 ms 384 KB
03.txt WA 1 ms 384 KB
04.txt AC 1 ms 384 KB
05.txt AC 1 ms 384 KB
06.txt WA 1 ms 384 KB
07.txt WA 1 ms 384 KB
08.txt WA 1 ms 384 KB
09.txt WA 1 ms 384 KB
10.txt WA 2 ms 384 KB
11.txt WA 2 ms 384 KB
12.txt WA 1 ms 384 KB
13.txt AC 1 ms 384 KB
14.txt WA 1 ms 384 KB
15.txt AC 1 ms 384 KB
16.txt WA 1 ms 384 KB
17.txt WA 1 ms 384 KB
18.txt WA 1 ms 384 KB
19.txt WA 1 ms 384 KB
20.txt AC 1 ms 384 KB
21.txt WA 1 ms 384 KB
22.txt AC 1 ms 384 KB
23.txt AC 1 ms 384 KB
24.txt WA 1 ms 384 KB
25.txt WA 1 ms 384 KB
26.txt WA 1 ms 384 KB
27.txt WA 1 ms 384 KB
28.txt AC 1 ms 384 KB
29.txt AC 1 ms 384 KB
30.txt AC 1 ms 384 KB
31.txt AC 1 ms 384 KB
32.txt WA 1 ms 384 KB
33.txt AC 1 ms 384 KB
34.txt AC 1 ms 384 KB
35.txt WA 2 ms 512 KB
36.txt WA 2 ms 512 KB
37.txt WA 2 ms 384 KB
38.txt WA 2 ms 384 KB
39.txt AC 1 ms 384 KB
40.txt AC 1 ms 384 KB
41.txt WA 1 ms 384 KB
42.txt WA 1 ms 384 KB
43.txt WA 1 ms 384 KB
44.txt AC 1 ms 384 KB
45.txt WA 1 ms 384 KB
46.txt AC 1 ms 384 KB
47.txt AC 1 ms 384 KB
48.txt WA 1 ms 384 KB
49.txt WA 1 ms 256 KB
50.txt AC 1 ms 256 KB
51.txt AC 1 ms 256 KB
52.txt WA 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt WA 1 ms 256 KB
s3.txt AC 1 ms 256 KB