# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1035165 | 2024-07-26T05:27:02 Z | vjudge1 | Political Development (BOI17_politicaldevelopment) | C++17 | 70 ms | 3844 KB |
#include <bits/stdc++.h> using namespace std; string abc = "abcdefghijklmnopqrstuvwxyz"; // #define int long long void solve(){ int n, k; cin >> n >> k; vector<vector<bool>> b(n+3, vector<bool> (n+3, 0)); vector<int> v; for(int i = 0; i < n; i++){ int r; cin >> r; for(int j = 0; j < r; j++){ int a; cin >> a; b[i][a]=1; } if(r < k) v.push_back(i); } for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ // cout << i << " " << j << " " <<b[i][j] << endl; } // cout << endl; } int sz = 0; for(int i = 0; i < v.size(); i++){ int a = v[i]; set<int> s; s.insert(a); for(int j = 0; j < n; j++){ if(b[a][j] == 1) s.insert(j); else continue; // cout << "in " << a << " " << j << endl; } bool im = 0; for(auto x : s){ cout << x << endl; int sz = 0; for(int j = 0; j < n; j++){ if(j == x) continue; if(s.count(j) == 1){ if(b[x][j]) sz++; else{ // cout << x << " " << j << endl; im = 1; break; } } } if(im) break; } // cout << i << " " << a << " " << im << " " << sz << endl; if(!im) sz = max(sz, (int) s.size()); } cout << sz << endl; } int main(){ solve(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 70 ms | 3844 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |