# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
244615 | 2020-07-04T12:29:13 Z | kimbj0709 | Political Development (BOI17_politicaldevelopment) | C++14 | 7 ms | 3072 KB |
#include<bits/stdc++.h> using namespace std; #define int long long #define maxn 50050 int32_t main(){ ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); int no_of_people,k; int no_of_input1; int input; cin >> no_of_people >> k; vector<unordered_set<int> > adj(maxn); bool can2 = 0; for(int i=0;i<no_of_people;i++){ cin >> no_of_input1; for(int j=0;j<no_of_input1;j++){ cin >> input; adj[i].insert(input); } } int ans = 1; for(int i=0;i<no_of_people;i++){ for(int j=0;j<pow(2,adj[i].size());j++){ vector<int> temp; if(__builtin_popcount(j)>=k){ continue; } int cnt = 0; for(auto kk:adj[i]){ if(j&(1<<cnt)){ temp.push_back(kk); } cnt++; } temp.push_back(i); for(int a=0;a<temp.size();a++){ for(int b=0;b<temp.size();b++){ if(a==b){ continue; } if(adj[a].count(b)==0){ goto cont; } } } ans = max(ans,(int)temp.size()); cont : ; } } cout << min(k,ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 3072 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 3072 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 3072 KB | Output is correct |
2 | Incorrect | 6 ms | 3048 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 3072 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 3072 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |