oj.uz

답안 #785539

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
785539 2023-07-17T10:06:12 Z SlavicG Political Development (BOI17_politicaldevelopment) C++17
0 / 100
 3 ms 1748 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]) continue;
            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()) check = false;
                    }
                }
                if(check) dp[mask | (1 << j)] |= 1;
            }
        }
    }
    if(ans == 1) cout << "0\n";
    else 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
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 1620 KB Output is correct
4 Correct 3 ms 1748 KB Output is correct
5 Correct 3 ms 1748 KB Output is correct
6 Correct 3 ms 1748 KB Output is correct
7 Correct 3 ms 1748 KB Output is correct
8 Incorrect 1 ms 596 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 1620 KB Output is correct
4 Correct 3 ms 1748 KB Output is correct
5 Correct 3 ms 1748 KB Output is correct
6 Correct 3 ms 1748 KB Output is correct
7 Correct 3 ms 1748 KB Output is correct
8 Incorrect 1 ms 596 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 1620 KB Output is correct
4 Correct 3 ms 1748 KB Output is correct
5 Correct 3 ms 1748 KB Output is correct
6 Correct 3 ms 1748 KB Output is correct
7 Correct 3 ms 1748 KB Output is correct
8 Incorrect 1 ms 596 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 1620 KB Output is correct
4 Correct 3 ms 1748 KB Output is correct
5 Correct 3 ms 1748 KB Output is correct
6 Correct 3 ms 1748 KB Output is correct
7 Correct 3 ms 1748 KB Output is correct
8 Incorrect 1 ms 596 KB Output isn't correct
9 Halted 0 ms 0 KB -