Submission #682692

#TimeUsernameProblemLanguageResultExecution timeMemory
682692LoboPolitical Development (BOI17_politicaldevelopment)C++17
16 / 100
35 ms7532 KiB
#include<bits/stdc++.h> using namespace std; const long long inf = (long long) 1e18 + 10; const int inf1 = (int) 1e9 + 10; #define int long long #define dbl long double #define endl '\n' #define sc second #define fr first #define mp make_pair #define pb push_back #define all(x) x.begin(), x.end() const int maxn = 5e4+10; int n, k, fq[maxn]; vector<int> g[maxn]; void solve() { cin >> n >> k; for(int i = 0; i < n; i++) { int d; cin >> d; while(d--) { int x; cin >> x; g[i].pb(x); } } for(int i = 0; i < n; i++) { for(auto j : g[i]) { fq[j] = 1; } for(auto j : g[i]) { for(auto l : g[j]) { if(fq[l]) { cout << 3 << endl; return; } } } for(auto j : g[i]) { fq[j] = 0; } } for(int i = 0; i < n; i++) { if(g[i].size()) { cout << 2 << endl; return; } } cout << 1 << endl; } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); // freopen("in.in", "r", stdin); // freopen("out.out", "w", stdout); int tt = 1; // cin >> tt; while(tt--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...