Submission #13495111


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;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};

int n,c[210];
int G[210][210];
int d[210][210];
bool bi=true;

void dfs(int s){
    //cout << s << endl;
    rep(i,n){
        if(i==s) continue;
        if(G[s][i]==0) continue;
        if(c[i]==c[s]){
            bi=false;
            return;
        }
        if(c[i]==-1){
            c[i]=1-c[s];
            dfs(i);
        }
    }
}

void solve(){
    cin >> n;
    rep(i,n){
        string s;
        c[i]=-1;
        cin >> s;
        rep(j,n){
            d[i][j]=mod;
            if(s[j]=='1') {
                G[i][j]=1;
                d[i][j]=1;
            }
        }
    }
    c[0]=1;
    rep(i,n){
        d[i][i]=0;
    }
    rep(k,n){
        rep(i,n){
            rep(j,n){
                d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
            }
        }
    }
    dfs(0);
    if(!bi){
        cout << -1 << endl;
        return;
    }
    int ans=0;
    rep(i,n){
        rep(j,n){
            ans=max(ans,d[i][j]);
        }
    }
    cout << ans+1 << endl;
}

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

Submission Info

Submission Time
Task B - Graph Partition
User Chanyuh
Language C++14 (GCC 5.4.1)
Score 500
Code Size 2170 Byte
Status AC
Exec Time 11 ms
Memory 640 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 10 ms 640 KB
02.txt AC 10 ms 640 KB
03.txt AC 10 ms 640 KB
04.txt AC 11 ms 640 KB
05.txt AC 10 ms 640 KB
06.txt AC 10 ms 640 KB
07.txt AC 10 ms 640 KB
08.txt AC 11 ms 640 KB
09.txt AC 10 ms 640 KB
10.txt AC 10 ms 640 KB
11.txt AC 10 ms 640 KB
12.txt AC 11 ms 640 KB
13.txt AC 10 ms 640 KB
14.txt AC 10 ms 640 KB
15.txt AC 10 ms 640 KB
16.txt AC 10 ms 640 KB
17.txt AC 10 ms 640 KB
18.txt AC 10 ms 640 KB
19.txt AC 10 ms 640 KB
20.txt AC 11 ms 640 KB
21.txt AC 10 ms 640 KB
22.txt AC 10 ms 640 KB
23.txt AC 10 ms 640 KB
24.txt AC 11 ms 640 KB
25.txt AC 10 ms 640 KB
26.txt AC 10 ms 640 KB
27.txt AC 10 ms 640 KB
28.txt AC 11 ms 640 KB
29.txt AC 11 ms 640 KB
30.txt AC 10 ms 640 KB
31.txt AC 10 ms 640 KB
32.txt AC 10 ms 640 KB
33.txt AC 10 ms 640 KB
34.txt AC 10 ms 640 KB
35.txt AC 10 ms 640 KB
36.txt AC 10 ms 640 KB
37.txt AC 10 ms 640 KB
38.txt AC 10 ms 640 KB
39.txt AC 10 ms 640 KB
40.txt AC 11 ms 640 KB
41.txt AC 10 ms 640 KB
42.txt AC 10 ms 640 KB
43.txt AC 10 ms 640 KB
44.txt AC 11 ms 640 KB
45.txt AC 10 ms 640 KB
46.txt AC 10 ms 640 KB
47.txt AC 10 ms 640 KB
48.txt AC 11 ms 640 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