Submission #7869001


Source Code Expand

Copy
#pragma GCC optimize(2,3,"Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define re register int
#define db double
#define in inline
namespace fast_io
{
	char buf[1<<12],*p1=buf,*p2=buf,sr[1<<23],z[23],nc;int C=-1,Z=0,Bi=0;
	in char gc() {return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<12,stdin),p1==p2)?EOF:*p1++;}
	in int read()
	{
		re x=0,y=1;while(nc=gc(),(nc<48||nc>57)&&nc!=-1)if(nc==45)y=-1;Bi=1;
		x=nc-48;while(nc=gc(),47<nc&&nc<58)x=(x<<3)+(x<<1)+(nc^48),Bi++;return x*y;
	}
	in db gf() {re a=read(),b=(nc!='.')?0:read();return (b?a+(db)b/pow(10,Bi):a);}
	in int gs(char *s) {char c,*t=s;while(c=gc(),c<32);*s++=c;while(c=gc(),c>32)*s++=c;return s-t;}
	in void ot() {fwrite(sr,1,C+1,stdout);C=-1;}
	in void flush() {if(C>1<<22) ot();}
	template <typename T>
	in void write(T x,char t)
	{
		re y=0;if(x<0)y=1,x=-x;while(z[++Z]=x%10+48,x/=10);
		if(y)z[++Z]='-';while(sr[++C]=z[Z],--Z);sr[++C]=t;flush();
	}
	in void write(char *s) {re l=strlen(s);for(re i=0;i<l;i++)sr[++C]=*s++;sr[++C]='\n';flush();}
};
using namespace fast_io;
const int N=2e2+5;
int n,g[N][N],du[N],vis[N],dfn[N],tim;
char sh[N];
stack<int>s;
int main()
{
	n=read();
	for(re i=1;i<=n;i++) 
	{
		gs(sh+1);
		for(re j=1;j<=n;j++) 
		{
			g[i][j]=sh[j]-'0';
			if(g[i][j]&&i<j) du[i]++,du[j]++;	
		}
	}
	sort(du+1,du+n+1);
	if(du[1]==du[n]) write("-1");
	else write(du[n]+1,'\n');
	return ot(),0;
}
//Author: disangan233
//In my dream's scene,I can see the everything that in Cyaegha.

Submission Info

Submission Time
Task B - Graph Partition
User disangan233
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1535 Byte
Status WA
Exec Time 1 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:47:29: warning: ISO C++ forbids converting a string constant to ‘char*’ [-Wwrite-strings]
  if(du[1]==du[n]) write("-1");
                             ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
WA × 1
AC × 6
WA × 49
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 WA 1 ms 384 KB
05.txt WA 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 1 ms 384 KB
11.txt WA 1 ms 384 KB
12.txt WA 1 ms 384 KB
13.txt WA 1 ms 384 KB
14.txt WA 1 ms 384 KB
15.txt WA 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 WA 1 ms 384 KB
21.txt WA 1 ms 384 KB
22.txt WA 1 ms 384 KB
23.txt WA 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 WA 1 ms 384 KB
29.txt WA 1 ms 384 KB
30.txt WA 1 ms 384 KB
31.txt WA 1 ms 384 KB
32.txt WA 1 ms 384 KB
33.txt WA 1 ms 384 KB
34.txt WA 1 ms 384 KB
35.txt AC 1 ms 384 KB
36.txt AC 1 ms 384 KB
37.txt WA 1 ms 384 KB
38.txt WA 1 ms 384 KB
39.txt WA 1 ms 384 KB
40.txt WA 1 ms 384 KB
41.txt AC 1 ms 384 KB
42.txt WA 1 ms 384 KB
43.txt WA 1 ms 384 KB
44.txt WA 1 ms 384 KB
45.txt WA 1 ms 384 KB
46.txt WA 1 ms 384 KB
47.txt WA 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 WA 1 ms 256 KB
52.txt WA 1 ms 256 KB
s1.txt WA 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB