oj.uz

Submission #311273

# Submission time Handle Problem Language Result Execution time Memory
311273 2020-10-09T19:53:43 Z Vladth11 Political Development (BOI17_politicaldevelopment) C++14
62 / 100
 3000 ms 32120 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debug_with_space(x) cerr << #x << " " << x << " "

using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <ll, pii> muchie;

const ll NMAX = 100005;
const ll INF = (1LL << 60);
const ll MOD = 1000000007;
const ll BLOCK = 101;

set <int> v[NMAX],st;
int maxim = 1,k;
int deg[NMAX];
set <pii> pq;
void afiseaza(int x){
    for(auto i : v[x])
        debug_with_space(i);
    cerr << "\n";
}

void clique(int i) {
    int nrbits = v[i].size();
    // debug(i);
    for(int mask = 1; mask < (1 << nrbits); mask++) {
        int cnt = 1;int bb = __builtin_popcount(mask);
        if(bb + 1 > k || bb + 1 < maxim)
            continue;
        int j = 0,cc = 0;
        st.clear();
        for(auto y : v[i]){
            if(mask & (1 << j))
                st.insert(y);
            j++;
        }
        j = 0;
        for(auto y : st){
            for(auto x : st){
                if(x != y && v[x].find(y) == v[x].end() && v[y].find(x) == v[y].end())
                    cnt = 0;
            }
        }

         //  debug_with_space(mask);
         //debug(cnt);
        if(cnt == 1)
            maxim = max(maxim, bb + 1);
    }
    //debug(maxim);
    for(auto x : v[i]){
        //if(pq.size())
        pq.erase({v[x].size(),x});
        v[x].erase(i);
        pq.insert({v[x].size(),x});
    }
    //debug(maxim);
}

struct cmp{
    bool operator()(int x, int y){
        return v[x].size() < v[y].size();
    }
};
int main() {
    // ifstream cin("catsfood.in");
    // ofstream cout("catsfood.out");
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, i, d;
    cin >> n >> k;
    for(i = 1; i <= n; i++) {
        int d;
        cin >> d;
        while(d--) {
            int x;
            cin >> x;
            v[i].insert(x + 1);
        }
    }

    for(i = 1; i <= n; i++) {
        pq.insert({v[i].size(),i});
    }
    while(!pq.empty()){
        int top = (*pq.begin()).second;
        pq.erase(pq.begin());
        clique(top);
    }
    cout << maxim;
    return 0;
}

Compilation message

politicaldevelopment.cpp: In function 'void clique(int)':
politicaldevelopment.cpp:32:19: warning: unused variable 'cc' [-Wunused-variable]
   32 |         int j = 0,cc = 0;
      |                   ^~
politicaldevelopment.cpp: In function 'int main()':
politicaldevelopment.cpp:73:15: warning: unused variable 'd' [-Wunused-variable]
   73 |     int n, i, d;
      |               ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 9 ms 5760 KB Output is correct
4 Correct 9 ms 5760 KB Output is correct
5 Correct 9 ms 5760 KB Output is correct
6 Correct 9 ms 5760 KB Output is correct
7 Correct 9 ms 5760 KB Output is correct
8 Correct 5 ms 5376 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 5 ms 5376 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 9 ms 5760 KB Output is correct
4 Correct 9 ms 5760 KB Output is correct
5 Correct 9 ms 5760 KB Output is correct
6 Correct 9 ms 5760 KB Output is correct
7 Correct 9 ms 5760 KB Output is correct
8 Correct 5 ms 5376 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 5 ms 5376 KB Output is correct
11 Correct 10 ms 5760 KB Output is correct
12 Correct 10 ms 5792 KB Output is correct
13 Correct 3 ms 4992 KB Output is correct
14 Correct 11 ms 5760 KB Output is correct
15 Correct 3 ms 4992 KB Output is correct
16 Correct 9 ms 5760 KB Output is correct
17 Correct 4 ms 4992 KB Output is correct
18 Correct 9 ms 5760 KB Output is correct
19 Correct 5 ms 5376 KB Output is correct
20 Correct 7 ms 5632 KB Output is correct
21 Correct 7 ms 5632 KB Output is correct
22 Correct 5 ms 5376 KB Output is correct
23 Correct 10 ms 5888 KB Output is correct
24 Correct 5 ms 5376 KB Output is correct
25 Correct 11 ms 5888 KB Output is correct
26 Correct 10 ms 5888 KB Output is correct
27 Correct 8 ms 5760 KB Output is correct
28 Correct 10 ms 5888 KB Output is correct
29 Correct 10 ms 5760 KB Output is correct
30 Correct 11 ms 6016 KB Output is correct
31 Correct 11 ms 6016 KB Output is correct
32 Correct 12 ms 6016 KB Output is correct
33 Correct 12 ms 6016 KB Output is correct
34 Correct 11 ms 6016 KB Output is correct
35 Correct 7 ms 5504 KB Output is correct
36 Correct 7 ms 5504 KB Output is correct
37 Correct 7 ms 5504 KB Output is correct
38 Correct 6 ms 5376 KB Output is correct
39 Correct 6 ms 5376 KB Output is correct
40 Correct 14 ms 6272 KB Output is correct
41 Correct 6 ms 5376 KB Output is correct
42 Correct 15 ms 6272 KB Output is correct
43 Correct 15 ms 6272 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5376 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 3 ms 4992 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 4 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 1567 ms 29432 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 1563 ms 31988 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 1588 ms 32120 KB Output is correct
16 Correct 1572 ms 31996 KB Output is correct
17 Correct 1555 ms 31992 KB Output is correct
18 Correct 1562 ms 31992 KB Output is correct

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 9 ms 5760 KB Output is correct
4 Correct 9 ms 5760 KB Output is correct
5 Correct 9 ms 5760 KB Output is correct
6 Correct 9 ms 5760 KB Output is correct
7 Correct 9 ms 5760 KB Output is correct
8 Correct 5 ms 5376 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 5 ms 5376 KB Output is correct
11 Correct 10 ms 5760 KB Output is correct
12 Correct 10 ms 5792 KB Output is correct
13 Correct 3 ms 4992 KB Output is correct
14 Correct 11 ms 5760 KB Output is correct
15 Correct 3 ms 4992 KB Output is correct
16 Correct 9 ms 5760 KB Output is correct
17 Correct 4 ms 4992 KB Output is correct
18 Correct 9 ms 5760 KB Output is correct
19 Correct 5 ms 5376 KB Output is correct
20 Correct 7 ms 5632 KB Output is correct
21 Correct 7 ms 5632 KB Output is correct
22 Correct 5 ms 5376 KB Output is correct
23 Correct 10 ms 5888 KB Output is correct
24 Correct 5 ms 5376 KB Output is correct
25 Correct 11 ms 5888 KB Output is correct
26 Correct 10 ms 5888 KB Output is correct
27 Correct 8 ms 5760 KB Output is correct
28 Correct 10 ms 5888 KB Output is correct
29 Correct 10 ms 5760 KB Output is correct
30 Correct 11 ms 6016 KB Output is correct
31 Correct 11 ms 6016 KB Output is correct
32 Correct 12 ms 6016 KB Output is correct
33 Correct 12 ms 6016 KB Output is correct
34 Correct 11 ms 6016 KB Output is correct
35 Correct 7 ms 5504 KB Output is correct
36 Correct 7 ms 5504 KB Output is correct
37 Correct 7 ms 5504 KB Output is correct
38 Correct 6 ms 5376 KB Output is correct
39 Correct 6 ms 5376 KB Output is correct
40 Correct 14 ms 6272 KB Output is correct
41 Correct 6 ms 5376 KB Output is correct
42 Correct 15 ms 6272 KB Output is correct
43 Correct 15 ms 6272 KB Output is correct
44 Correct 21 ms 7168 KB Output is correct
45 Correct 3 ms 4992 KB Output is correct
46 Correct 16 ms 6272 KB Output is correct
47 Correct 53 ms 7168 KB Output is correct
48 Correct 15 ms 6272 KB Output is correct
49 Correct 53 ms 7168 KB Output is correct
50 Correct 60 ms 7288 KB Output is correct
51 Correct 1337 ms 9208 KB Output is correct
52 Correct 10 ms 5888 KB Output is correct
53 Execution timed out 3073 ms 9976 KB Time limit exceeded
54 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 9 ms 5760 KB Output is correct
4 Correct 9 ms 5760 KB Output is correct
5 Correct 9 ms 5760 KB Output is correct
6 Correct 9 ms 5760 KB Output is correct
7 Correct 9 ms 5760 KB Output is correct
8 Correct 5 ms 5376 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 5 ms 5376 KB Output is correct
11 Correct 10 ms 5760 KB Output is correct
12 Correct 10 ms 5792 KB Output is correct
13 Correct 3 ms 4992 KB Output is correct
14 Correct 11 ms 5760 KB Output is correct
15 Correct 3 ms 4992 KB Output is correct
16 Correct 9 ms 5760 KB Output is correct
17 Correct 4 ms 4992 KB Output is correct
18 Correct 9 ms 5760 KB Output is correct
19 Correct 5 ms 5376 KB Output is correct
20 Correct 7 ms 5632 KB Output is correct
21 Correct 7 ms 5632 KB Output is correct
22 Correct 5 ms 5376 KB Output is correct
23 Correct 10 ms 5888 KB Output is correct
24 Correct 5 ms 5376 KB Output is correct
25 Correct 11 ms 5888 KB Output is correct
26 Correct 10 ms 5888 KB Output is correct
27 Correct 8 ms 5760 KB Output is correct
28 Correct 10 ms 5888 KB Output is correct
29 Correct 10 ms 5760 KB Output is correct
30 Correct 11 ms 6016 KB Output is correct
31 Correct 11 ms 6016 KB Output is correct
32 Correct 12 ms 6016 KB Output is correct
33 Correct 12 ms 6016 KB Output is correct
34 Correct 11 ms 6016 KB Output is correct
35 Correct 7 ms 5504 KB Output is correct
36 Correct 7 ms 5504 KB Output is correct
37 Correct 7 ms 5504 KB Output is correct
38 Correct 6 ms 5376 KB Output is correct
39 Correct 6 ms 5376 KB Output is correct
40 Correct 14 ms 6272 KB Output is correct
41 Correct 6 ms 5376 KB Output is correct
42 Correct 15 ms 6272 KB Output is correct
43 Correct 15 ms 6272 KB Output is correct
44 Correct 4 ms 4992 KB Output is correct
45 Correct 303 ms 22264 KB Output is correct
46 Correct 109 ms 15224 KB Output is correct
47 Correct 335 ms 24184 KB Output is correct
48 Correct 294 ms 24056 KB Output is correct
49 Correct 76 ms 13560 KB Output is correct
50 Correct 516 ms 29424 KB Output is correct
51 Correct 317 ms 24056 KB Output is correct
52 Correct 70 ms 13560 KB Output is correct
53 Correct 79 ms 13560 KB Output is correct
54 Correct 20 ms 8320 KB Output is correct
55 Correct 542 ms 29304 KB Output is correct
56 Correct 45 ms 10880 KB Output is correct
57 Correct 72 ms 13688 KB Output is correct
58 Correct 88 ms 16120 KB Output is correct
59 Correct 44 ms 10872 KB Output is correct
60 Correct 44 ms 10872 KB Output is correct
61 Correct 88 ms 16204 KB Output is correct
62 Correct 67 ms 13560 KB Output is correct
63 Correct 143 ms 17556 KB Output is correct
64 Correct 45 ms 10872 KB Output is correct
65 Correct 177 ms 20088 KB Output is correct
66 Correct 67 ms 13560 KB Output is correct
67 Correct 138 ms 17400 KB Output is correct
68 Correct 185 ms 19448 KB Output is correct
69 Correct 181 ms 20088 KB Output is correct
70 Correct 75 ms 13560 KB Output is correct
71 Correct 181 ms 19448 KB Output is correct
72 Correct 139 ms 17092 KB Output is correct
73 Correct 245 ms 21752 KB Output is correct
74 Correct 73 ms 13560 KB Output is correct
75 Correct 72 ms 11796 KB Output is correct
76 Correct 146 ms 17144 KB Output is correct
77 Correct 248 ms 21880 KB Output is correct
78 Correct 112 ms 13436 KB Output is correct
79 Correct 73 ms 11768 KB Output is correct
80 Correct 36 ms 8440 KB Output is correct
81 Correct 113 ms 13560 KB Output is correct
82 Correct 159 ms 18840 KB Output is correct
83 Correct 35 ms 8448 KB Output is correct
84 Correct 157 ms 18936 KB Output is correct