Submission #7865725

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <deque>
#include <set>
#include <iomanip>
#include <utility>
#define ll long long
#define ld long double
using namespace std;

int N;

int solve(vector<int> &v, vector<string> &g, vector<bool> &c){
    vector<int> net;
    for(int p=0; p<v.size(); ++p){
        for(int i=0; i<N; ++i){
            if(g[v[p]][i]=='1' && !c[i]){
                net.push_back(i);
                c[i]=1;
            }
        }
    }
    if(net.size()==0) return 1;
    for(int i=0; i<net.size(); ++i){
        for(int j=i+1; j<net.size(); ++j){
            if(g[net[i]][net[j]]=='1') return -1;
        }
    }
    int desc=solve(net, g, c);
    if(desc<0) return -1;
    return 1+desc;
}


int main() {
	cin >> N;
	vector<string> s(N);
	for(int i=0; i<N; ++i) cin >> s[i];
	int ans=-1;
	for(int i=0; i<N; ++i){
	    vector<bool> ch(N, 0);
	    ch[i]=1;
	    vector<int> t{i};
	    ans=max(ans, solve(t, s, ch));
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result