# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
933734 | LucaIlie | Political Development (BOI17_politicaldevelopment) | C++17 | 3071 ms | 8020 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;
const int MAX_N = 5e4;
vector<int> adj[MAX_N];
int main() {
int n, k, minn = n;
cin >> n >> k;
for ( int u = 0; u < n; u++ ) {
int d;
cin >> d;
for ( int j = 0; j < d; j++ ) {
int v;
cin >> v;
adj[u].push_back( v );
}
minn = min( minn, d );
}
int ans = 0;
for ( int mask = 0; mask < (1 << n); mask++ ) {
int sz = __builtin_popcount( mask );
bool ok = true;
for ( int u = 0; u < n; u++ ) {
if ( ((mask >> u) & 1) == 0 )
continue;
int vec = 0;
for ( int v: adj[u] ) {
if ( (mask >> v) & 1 )
vec++;
}
if ( vec != sz - 1 )
ok = false;
}
if ( ok )
ans = max( ans, sz );
}
cout << ans;
if ( minn > k )
return 1;
return 0;
}
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... |