Contest Duration: - (local time) (150 minutes) Back to Home

Submission #7865823

Source Code Expand

Copy
```#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int n;
int c[210]={-1};
string s[210];
vector<int> G[210];

void solve(){
cin >> n;
rep(i,n){
cin >> s[i];
c[i]=-1;
}
rep(i,n){
rep(j,n){
if (s[i][j]=='1') G[i].push_back(j);
}
}
queue<P> que;
que.push(P(0,1));
c[0]=1;
int ans=0;
rep(i,n){
rep(j,n){
c[j]=-1;
}
queue<P> que;
que.push(P(i,1));
c[i]=1;
while(!que.empty()){
int s=que.front().first,k=que.front().second;que.pop();
//cout << s << " " << k << endl;
for(int t:G[s]){
//cout << t << endl;
if (c[t]!=-1){
if (abs(c[t]-c[s])!=1) {
cout << -1 << endl;
return;
}
else continue;
}
c[t]=k+1;
que.push(P(t,k+1));
}
}

rep(i,n){
//cout << i << endl;
ans=max(ans,c[i]);
}
}
cout << ans << endl;
}

int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(50);
solve();
}```

#### Submission Info

Submission Time 2019-10-05 21:48:05+0900 B - Graph Partition Chanyuh C++14 (GCC 5.4.1) 500 2180 Byte AC 7 ms 512 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
 AC × 3
 AC × 55
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 AC 3 ms 384 KB
02.txt AC 1 ms 384 KB
03.txt AC 1 ms 384 KB
04.txt AC 2 ms 384 KB
05.txt AC 2 ms 384 KB
06.txt AC 1 ms 384 KB
07.txt AC 2 ms 384 KB
08.txt AC 3 ms 384 KB
09.txt AC 1 ms 384 KB
10.txt AC 1 ms 384 KB
11.txt AC 1 ms 384 KB
12.txt AC 1 ms 384 KB
13.txt AC 2 ms 384 KB
14.txt AC 1 ms 384 KB
15.txt AC 3 ms 384 KB
16.txt AC 1 ms 384 KB
17.txt AC 3 ms 384 KB
18.txt AC 3 ms 384 KB
19.txt AC 2 ms 384 KB
20.txt AC 2 ms 384 KB
21.txt AC 2 ms 384 KB
22.txt AC 2 ms 384 KB
23.txt AC 2 ms 384 KB
24.txt AC 3 ms 384 KB
25.txt AC 3 ms 384 KB
26.txt AC 3 ms 384 KB
27.txt AC 3 ms 384 KB
28.txt AC 2 ms 384 KB
29.txt AC 2 ms 384 KB
30.txt AC 2 ms 384 KB
31.txt AC 2 ms 384 KB
32.txt AC 3 ms 384 KB
33.txt AC 2 ms 384 KB
34.txt AC 2 ms 384 KB
35.txt AC 2 ms 512 KB
36.txt AC 2 ms 512 KB
37.txt AC 7 ms 384 KB
38.txt AC 7 ms 384 KB
39.txt AC 2 ms 384 KB
40.txt AC 2 ms 384 KB
41.txt AC 1 ms 384 KB
42.txt AC 2 ms 384 KB
43.txt AC 1 ms 384 KB
44.txt AC 2 ms 384 KB
45.txt AC 1 ms 384 KB
46.txt AC 2 ms 384 KB
47.txt AC 2 ms 384 KB
48.txt AC 2 ms 384 KB
49.txt AC 1 ms 256 KB
50.txt AC 1 ms 256 KB
51.txt AC 1 ms 256 KB
52.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB