# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
169357 | gabrielpessoa | Political Development (BOI17_politicaldevelopment) | C++14 | 125 ms | 13412 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
const int ms = 4e5+5;
vector<int> g[ms];
main() {
cin.tie(0); ios::sync_with_stdio(0);
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int d;
cin >> d;
g[i].resize(d);
for(int j = 0; j < d; j++) {
cin >> g[i][j];
}
}
int ans = 1;
for(int i = 0; i < n; i++) {
if(g[i].size() > 0) ans = max(ans, 2);
set<int> s;
for(int j : g[i]) {
for(int k : g[j]) {
if(s.count(k)) ans = max(ans, 3);
}
s.insert(j);
}
}
cout << ans << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |