oj.uz

Submission #785528

# Submission time Handle Problem Language Result Execution time Memory
785528 2023-07-17T10:01:01 Z SlavicG Political Development (BOI17_politicaldevelopment) C++17
4 / 100
 3000 ms 26260 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()
 
void solve() {
    int n, k; cin >> n >> k;
    unordered_set<int> st[n + 1];
    vector<vector<int>> adj(n);
    for(int i = 0; i < n; ++i) {
        int x; cin >> x; adj[i].resize(x);
        for(int j = 0; j < x; ++j) {
            cin >> adj[i][j];
            st[i].insert(adj[i][j]);
        }
    }
    int ans = 1;
    for(int i = 0; i < n; ++i) {
        if(sz(adj[i]) >= k) continue;
        vector<int> dp(1 << (sz(adj[i])), 0);
        dp[0] = 1;
        for(int mask = 0; mask < (1 << sz(adj[i])); ++mask) {
            if(dp[mask]) {
                ans = max(ans, __builtin_popcount(mask) + 1);
            }
            for(int j = 0; j < sz(adj[i]); ++j) {
                if(mask >> j & 1) continue;
                bool check = true;
                for(int k = 0; k < sz(adj[i]); ++k) {
                    if(mask >> k & 1) {
                        if(st[adj[i][j]].find(adj[i][k]) == st[adj[i][j]].end() && st[adj[i][k]].find(adj[i][j]) == st[adj[i][k]].end()) check = false;
                    }
                }
                if(check) dp[mask | (1 << j)] |= dp[mask];
            }
        }
    }
    cout << ans << "\n";
}   
 
int32_t main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 3 ms 1744 KB Output is correct
4 Correct 3 ms 1748 KB Output is correct
5 Correct 3 ms 1736 KB Output is correct
6 Correct 3 ms 1748 KB Output is correct
7 Correct 3 ms 1748 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 704 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 3 ms 1744 KB Output is correct
4 Correct 3 ms 1748 KB Output is correct
5 Correct 3 ms 1736 KB Output is correct
6 Correct 3 ms 1748 KB Output is correct
7 Correct 3 ms 1748 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 704 KB Output is correct
11 Correct 3 ms 1748 KB Output is correct
12 Correct 3 ms 1748 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 3 ms 1748 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 1868 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 4 ms 1740 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 2 ms 1492 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Incorrect 3 ms 1748 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 712 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Execution timed out 3075 ms 26260 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 3 ms 1744 KB Output is correct
4 Correct 3 ms 1748 KB Output is correct
5 Correct 3 ms 1736 KB Output is correct
6 Correct 3 ms 1748 KB Output is correct
7 Correct 3 ms 1748 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 704 KB Output is correct
11 Correct 3 ms 1748 KB Output is correct
12 Correct 3 ms 1748 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 3 ms 1748 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 1868 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 4 ms 1740 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 2 ms 1492 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Incorrect 3 ms 1748 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 3 ms 1744 KB Output is correct
4 Correct 3 ms 1748 KB Output is correct
5 Correct 3 ms 1736 KB Output is correct
6 Correct 3 ms 1748 KB Output is correct
7 Correct 3 ms 1748 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 704 KB Output is correct
11 Correct 3 ms 1748 KB Output is correct
12 Correct 3 ms 1748 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 3 ms 1748 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 1868 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 4 ms 1740 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 2 ms 1492 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Incorrect 3 ms 1748 KB Output isn't correct
24 Halted 0 ms 0 KB -