oj.uz

Submission #439542

# Submission time Handle Problem Language Result Execution time Memory
439542 2021-06-30T08:06:49 Z K4YAN Political Development (BOI17_politicaldevelopment) C++17
16 / 100
 3000 ms 103508 KB 
//Be Name Khoda
// 10:55 -> 10:50 shoroo
// 12:25 | 12:25

#include<bits/stdc++.h>
#pragma GCC optimize ("unroll-loops")

using namespace std;

typedef long long ll;
typedef long double ld;
#define all(x) x.begin(), x.end()
#define pll pair<ll, ll>
#define pii pair<int, int>
#define plll pair<pll, ll>
#define piii pair<pii, int>
#define piiii pair<pii, pii>

const short int mxn = 5e3 + 1;
int n, k, q, w;
short int v, deg[mxn];
vector<int> dp[mxn][11];
vector<short int> kmk, g2[11];
vector<vector<short int>> g[11];
bool edge[mxn][mxn];

void input() {

    int tmp = 0;
    cin >> n >> k;
    for(short int i = 0; i < n; i++) {
        cin >> q;
        deg[i] = q;
        for(short int j = 0; j < q; j++) {
            cin >> v;
            edge[v][i] = 1;
            if(i < v) {
                dp[i][2].push_back(tmp);
                dp[v][2].push_back(tmp++);
                g[2].push_back({i, v});
                if(deg[i] < deg[v]) {
                    g2[2].push_back(i);
                }
                else {
                    g2[2].push_back(v);
                }
            }
        }
    }

}

void solve() {

    bool b;
    int tmp;
    vector<short int> u;
    for(int i = 3; i <= k; i++) {
        tmp = 0;

        for(int j = 0; j < n; j++) {

            for(w = 0; w < (int)(g[i - 1].size()); w++) {
                
                if(edge[j][g2[i - 1][w]] == false) {
                    continue;
                }
                b = true;
                for(auto e : g[i - 1][w]) {

                    if(edge[j][e] == false) {
                        b = false;
                        break;
                    }

                }

                if(b == false) {
                    continue;
                }
                for(auto e : u) {
                    kmk.push_back(e);
                    dp[e][i].push_back(tmp);
                }
                dp[j][i].push_back(tmp++);
                kmk.push_back(j);
                g[i].push_back(kmk);
                if(deg[g2[i - 1][w]] > deg[j]) {
                    g2[i].push_back(j);
                }
                else {
                    g2[i].push_back(g2[i - 1][w]);
                }
                kmk.clear();
            }
        }
        if(int(g[i].size()) == 0) {
            break;
        }
    }

    for(short int i = 2; i <= k; i++) {
        if(int(g[i].size()) == 0) {
            cout << i - 1 << endl;
            return;
        }
    }
    cout << k << endl;
    return;

}

int main() {

    ios_base::sync_with_stdio(false);

    input(), solve();

    return 0;

}
/*
5 3
2 1 2
3 0 2 3
3 0 1 4
2 1 4
2 2 3
*/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1612 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 13 ms 23092 KB Output is correct
4 Correct 12 ms 22136 KB Output is correct
5 Correct 12 ms 22092 KB Output is correct
6 Correct 14 ms 19876 KB Output is correct
7 Correct 11 ms 20044 KB Output is correct
8 Correct 2 ms 1612 KB Output is correct
9 Correct 1 ms 1612 KB Output is correct
10 Correct 2 ms 1612 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1612 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 13 ms 23092 KB Output is correct
4 Correct 12 ms 22136 KB Output is correct
5 Correct 12 ms 22092 KB Output is correct
6 Correct 14 ms 19876 KB Output is correct
7 Correct 11 ms 20044 KB Output is correct
8 Correct 2 ms 1612 KB Output is correct
9 Correct 1 ms 1612 KB Output is correct
10 Correct 2 ms 1612 KB Output is correct
11 Correct 12 ms 22092 KB Output is correct
12 Correct 115 ms 22180 KB Output is correct
13 Correct 2 ms 1612 KB Output is correct
14 Correct 129 ms 22092 KB Output is correct
15 Correct 1 ms 1612 KB Output is correct
16 Correct 103 ms 20020 KB Output is correct
17 Correct 1 ms 1612 KB Output is correct
18 Correct 106 ms 19908 KB Output is correct
19 Correct 2 ms 1612 KB Output is correct
20 Correct 59 ms 19660 KB Output is correct
21 Correct 55 ms 19580 KB Output is correct
22 Correct 5 ms 1612 KB Output is correct
23 Correct 129 ms 24652 KB Output is correct
24 Correct 5 ms 1676 KB Output is correct
25 Correct 132 ms 24652 KB Output is correct
26 Correct 114 ms 23756 KB Output is correct
27 Correct 99 ms 24644 KB Output is correct
28 Correct 118 ms 23696 KB Output is correct
29 Correct 113 ms 24652 KB Output is correct
30 Correct 142 ms 24160 KB Output is correct
31 Correct 129 ms 25528 KB Output is correct
32 Correct 144 ms 24488 KB Output is correct
33 Correct 136 ms 25444 KB Output is correct
34 Correct 127 ms 25480 KB Output is correct
35 Correct 37 ms 13388 KB Output is correct
36 Correct 36 ms 13476 KB Output is correct
37 Correct 36 ms 13500 KB Output is correct
38 Correct 16 ms 7328 KB Output is correct
39 Correct 19 ms 7304 KB Output is correct
40 Correct 200 ms 26360 KB Output is correct
41 Correct 17 ms 7316 KB Output is correct
42 Correct 189 ms 26172 KB Output is correct
43 Correct 208 ms 26248 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1612 KB Output is correct
2 Incorrect 1 ms 1612 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1612 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 13 ms 23092 KB Output is correct
4 Correct 12 ms 22136 KB Output is correct
5 Correct 12 ms 22092 KB Output is correct
6 Correct 14 ms 19876 KB Output is correct
7 Correct 11 ms 20044 KB Output is correct
8 Correct 2 ms 1612 KB Output is correct
9 Correct 1 ms 1612 KB Output is correct
10 Correct 2 ms 1612 KB Output is correct
11 Correct 12 ms 22092 KB Output is correct
12 Correct 115 ms 22180 KB Output is correct
13 Correct 2 ms 1612 KB Output is correct
14 Correct 129 ms 22092 KB Output is correct
15 Correct 1 ms 1612 KB Output is correct
16 Correct 103 ms 20020 KB Output is correct
17 Correct 1 ms 1612 KB Output is correct
18 Correct 106 ms 19908 KB Output is correct
19 Correct 2 ms 1612 KB Output is correct
20 Correct 59 ms 19660 KB Output is correct
21 Correct 55 ms 19580 KB Output is correct
22 Correct 5 ms 1612 KB Output is correct
23 Correct 129 ms 24652 KB Output is correct
24 Correct 5 ms 1676 KB Output is correct
25 Correct 132 ms 24652 KB Output is correct
26 Correct 114 ms 23756 KB Output is correct
27 Correct 99 ms 24644 KB Output is correct
28 Correct 118 ms 23696 KB Output is correct
29 Correct 113 ms 24652 KB Output is correct
30 Correct 142 ms 24160 KB Output is correct
31 Correct 129 ms 25528 KB Output is correct
32 Correct 144 ms 24488 KB Output is correct
33 Correct 136 ms 25444 KB Output is correct
34 Correct 127 ms 25480 KB Output is correct
35 Correct 37 ms 13388 KB Output is correct
36 Correct 36 ms 13476 KB Output is correct
37 Correct 36 ms 13500 KB Output is correct
38 Correct 16 ms 7328 KB Output is correct
39 Correct 19 ms 7304 KB Output is correct
40 Correct 200 ms 26360 KB Output is correct
41 Correct 17 ms 7316 KB Output is correct
42 Correct 189 ms 26172 KB Output is correct
43 Correct 208 ms 26248 KB Output is correct
44 Execution timed out 3051 ms 103508 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1612 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 13 ms 23092 KB Output is correct
4 Correct 12 ms 22136 KB Output is correct
5 Correct 12 ms 22092 KB Output is correct
6 Correct 14 ms 19876 KB Output is correct
7 Correct 11 ms 20044 KB Output is correct
8 Correct 2 ms 1612 KB Output is correct
9 Correct 1 ms 1612 KB Output is correct
10 Correct 2 ms 1612 KB Output is correct
11 Correct 12 ms 22092 KB Output is correct
12 Correct 115 ms 22180 KB Output is correct
13 Correct 2 ms 1612 KB Output is correct
14 Correct 129 ms 22092 KB Output is correct
15 Correct 1 ms 1612 KB Output is correct
16 Correct 103 ms 20020 KB Output is correct
17 Correct 1 ms 1612 KB Output is correct
18 Correct 106 ms 19908 KB Output is correct
19 Correct 2 ms 1612 KB Output is correct
20 Correct 59 ms 19660 KB Output is correct
21 Correct 55 ms 19580 KB Output is correct
22 Correct 5 ms 1612 KB Output is correct
23 Correct 129 ms 24652 KB Output is correct
24 Correct 5 ms 1676 KB Output is correct
25 Correct 132 ms 24652 KB Output is correct
26 Correct 114 ms 23756 KB Output is correct
27 Correct 99 ms 24644 KB Output is correct
28 Correct 118 ms 23696 KB Output is correct
29 Correct 113 ms 24652 KB Output is correct
30 Correct 142 ms 24160 KB Output is correct
31 Correct 129 ms 25528 KB Output is correct
32 Correct 144 ms 24488 KB Output is correct
33 Correct 136 ms 25444 KB Output is correct
34 Correct 127 ms 25480 KB Output is correct
35 Correct 37 ms 13388 KB Output is correct
36 Correct 36 ms 13476 KB Output is correct
37 Correct 36 ms 13500 KB Output is correct
38 Correct 16 ms 7328 KB Output is correct
39 Correct 19 ms 7304 KB Output is correct
40 Correct 200 ms 26360 KB Output is correct
41 Correct 17 ms 7316 KB Output is correct
42 Correct 189 ms 26172 KB Output is correct
43 Correct 208 ms 26248 KB Output is correct
44 Incorrect 1 ms 1612 KB Output isn't correct
45 Halted 0 ms 0 KB -