oj.uz

Submission #129111

# Submission time Handle Problem Language Result Execution time Memory
129111 2019-07-11T17:00:50 Z SamAnd Political Development (BOI17_politicaldevelopment) C++17
100 / 100
 161 ms 9336 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 50004, K = 12;

int n, k;
vector<int> a[N];
bool c[N];
int q[N];

int f[1 << K];
int qq[1 << K];
void pre()
{
    for (int x = 1; x < (1 << k); ++x)
    {
        int yq = 0;
        for (int i = 0; i < k; ++i)
        {
            if ((x & (1 << i)))
            {
                f[x] = i;
                ++yq;
            }
        }
        qq[x] = yq;
    }
}

vector<int> v;
int xx[K];
bool dp[1 << K];
int stg()
{
    memset(xx, 0, sizeof xx);
    for (int i = 0; i < v.size(); ++i)
    {
        for (int j = 0; j < v.size(); ++j)
        {
            if (binary_search(a[v[i]].begin(), a[v[i]].end(), v[j]))
                xx[i] |= (1 << j);
        }
    }
    memset(dp, false, sizeof dp);
    dp[0] = true;
    int ans = 0;
    for (int x = 1; x < (1 << v.size()); ++x)
    {
        int i = f[x];
        int y = (x ^ (1 << i));
        if (dp[y] && (xx[i] & y) == y)
        {
            dp[x] = true;
            ans = max(ans, qq[x]);
        }
    }
    return ans;
}

int main()
{
    scanf("%d%d", &n, &k);
    for (int i = 0; i < n; ++i)
    {
        int s;
        scanf("%d", &s);
        while (s--)
        {
            int x;
            scanf("%d", &x);
            a[i].push_back(x);
        }
    }
    queue<int> s;
    for (int i = 0; i < n; ++i)
    {
        sort(a[i].begin(), a[i].end());
        q[i] = a[i].size();
        if (q[i] <= k)
            s.push(i);
    }
    pre();
    int ans = 1;
    while (1)
    {
        v.clear();
        int x;
        do
        {
            x = s.front();
            s.pop();
            if (s.empty())
            {
                cout << ans << endl;
                return 0;
            }
        } while (c[x]);
        for (int i = 0; i < a[x].size(); ++i)
        {
            int h = a[x][i];
            if (c[h])
                continue;
            v.push_back(h);
            --q[h];
            if (q[h] <= k)
                s.push(h);
        }
        ans = max(ans, stg() + 1);
        c[x] = true;
    }
    return 0;
}

Compilation message

politicaldevelopment.cpp: In function 'int stg()':
politicaldevelopment.cpp:35:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v.size(); ++i)
                     ~~^~~~~~~~~~
politicaldevelopment.cpp:37:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < v.size(); ++j)
                         ~~^~~~~~~~~~
politicaldevelopment.cpp: In function 'int main()':
politicaldevelopment.cpp:97:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < a[x].size(); ++i)
                         ~~^~~~~~~~~~~~~
politicaldevelopment.cpp:61:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~
politicaldevelopment.cpp:65:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &s);
         ~~~~~^~~~~~~~~~
politicaldevelopment.cpp:69:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &x);
             ~~~~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 8 ms 1784 KB Output is correct
4 Correct 6 ms 1788 KB Output is correct
5 Correct 6 ms 1784 KB Output is correct
6 Correct 6 ms 1784 KB Output is correct
7 Correct 6 ms 1784 KB Output is correct
8 Correct 4 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 4 ms 1528 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 8 ms 1784 KB Output is correct
4 Correct 6 ms 1788 KB Output is correct
5 Correct 6 ms 1784 KB Output is correct
6 Correct 6 ms 1784 KB Output is correct
7 Correct 6 ms 1784 KB Output is correct
8 Correct 4 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 4 ms 1528 KB Output is correct
11 Correct 7 ms 1784 KB Output is correct
12 Correct 6 ms 1784 KB Output is correct
13 Correct 3 ms 1528 KB Output is correct
14 Correct 6 ms 1784 KB Output is correct
15 Correct 3 ms 1528 KB Output is correct
16 Correct 6 ms 1788 KB Output is correct
17 Correct 3 ms 1528 KB Output is correct
18 Correct 6 ms 1784 KB Output is correct
19 Correct 4 ms 1528 KB Output is correct
20 Correct 5 ms 1784 KB Output is correct
21 Correct 5 ms 1784 KB Output is correct
22 Correct 4 ms 1528 KB Output is correct
23 Correct 7 ms 1784 KB Output is correct
24 Correct 4 ms 1528 KB Output is correct
25 Correct 7 ms 1784 KB Output is correct
26 Correct 7 ms 1784 KB Output is correct
27 Correct 6 ms 1912 KB Output is correct
28 Correct 7 ms 1784 KB Output is correct
29 Correct 6 ms 1784 KB Output is correct
30 Correct 7 ms 1784 KB Output is correct
31 Correct 7 ms 1784 KB Output is correct
32 Correct 7 ms 1784 KB Output is correct
33 Correct 7 ms 1784 KB Output is correct
34 Correct 7 ms 1784 KB Output is correct
35 Correct 5 ms 1660 KB Output is correct
36 Correct 5 ms 1656 KB Output is correct
37 Correct 5 ms 1656 KB Output is correct
38 Correct 4 ms 1528 KB Output is correct
39 Correct 4 ms 1528 KB Output is correct
40 Correct 9 ms 1788 KB Output is correct
41 Correct 4 ms 1656 KB Output is correct
42 Correct 9 ms 1912 KB Output is correct
43 Correct 9 ms 1912 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1528 KB Output is correct
2 Correct 3 ms 1532 KB Output is correct
3 Correct 3 ms 1528 KB Output is correct
4 Correct 3 ms 1528 KB Output is correct
5 Correct 3 ms 1528 KB Output is correct
6 Correct 3 ms 1528 KB Output is correct
7 Correct 3 ms 1528 KB Output is correct
8 Correct 3 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Correct 159 ms 9336 KB Output is correct
12 Correct 3 ms 1528 KB Output is correct
13 Correct 158 ms 9208 KB Output is correct
14 Correct 3 ms 1528 KB Output is correct
15 Correct 160 ms 9336 KB Output is correct
16 Correct 159 ms 9308 KB Output is correct
17 Correct 157 ms 9308 KB Output is correct
18 Correct 161 ms 9336 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 8 ms 1784 KB Output is correct
4 Correct 6 ms 1788 KB Output is correct
5 Correct 6 ms 1784 KB Output is correct
6 Correct 6 ms 1784 KB Output is correct
7 Correct 6 ms 1784 KB Output is correct
8 Correct 4 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 4 ms 1528 KB Output is correct
11 Correct 7 ms 1784 KB Output is correct
12 Correct 6 ms 1784 KB Output is correct
13 Correct 3 ms 1528 KB Output is correct
14 Correct 6 ms 1784 KB Output is correct
15 Correct 3 ms 1528 KB Output is correct
16 Correct 6 ms 1788 KB Output is correct
17 Correct 3 ms 1528 KB Output is correct
18 Correct 6 ms 1784 KB Output is correct
19 Correct 4 ms 1528 KB Output is correct
20 Correct 5 ms 1784 KB Output is correct
21 Correct 5 ms 1784 KB Output is correct
22 Correct 4 ms 1528 KB Output is correct
23 Correct 7 ms 1784 KB Output is correct
24 Correct 4 ms 1528 KB Output is correct
25 Correct 7 ms 1784 KB Output is correct
26 Correct 7 ms 1784 KB Output is correct
27 Correct 6 ms 1912 KB Output is correct
28 Correct 7 ms 1784 KB Output is correct
29 Correct 6 ms 1784 KB Output is correct
30 Correct 7 ms 1784 KB Output is correct
31 Correct 7 ms 1784 KB Output is correct
32 Correct 7 ms 1784 KB Output is correct
33 Correct 7 ms 1784 KB Output is correct
34 Correct 7 ms 1784 KB Output is correct
35 Correct 5 ms 1660 KB Output is correct
36 Correct 5 ms 1656 KB Output is correct
37 Correct 5 ms 1656 KB Output is correct
38 Correct 4 ms 1528 KB Output is correct
39 Correct 4 ms 1528 KB Output is correct
40 Correct 9 ms 1788 KB Output is correct
41 Correct 4 ms 1656 KB Output is correct
42 Correct 9 ms 1912 KB Output is correct
43 Correct 9 ms 1912 KB Output is correct
44 Correct 13 ms 2040 KB Output is correct
45 Correct 3 ms 1528 KB Output is correct
46 Correct 9 ms 1784 KB Output is correct
47 Correct 15 ms 2012 KB Output is correct
48 Correct 9 ms 1784 KB Output is correct
49 Correct 15 ms 2040 KB Output is correct
50 Correct 16 ms 2040 KB Output is correct
51 Correct 34 ms 2424 KB Output is correct
52 Correct 6 ms 1912 KB Output is correct
53 Correct 36 ms 2616 KB Output is correct
54 Correct 42 ms 2552 KB Output is correct
55 Correct 7 ms 1784 KB Output is correct
56 Correct 6 ms 1784 KB Output is correct
57 Correct 4 ms 1528 KB Output is correct
58 Correct 35 ms 2556 KB Output is correct
59 Correct 8 ms 1812 KB Output is correct
60 Correct 6 ms 1784 KB Output is correct
61 Correct 8 ms 1916 KB Output is correct
62 Correct 8 ms 1780 KB Output is correct
63 Correct 13 ms 2040 KB Output is correct
64 Correct 12 ms 2044 KB Output is correct
65 Correct 9 ms 1784 KB Output is correct
66 Correct 10 ms 1912 KB Output is correct
67 Correct 21 ms 2168 KB Output is correct
68 Correct 12 ms 2040 KB Output is correct
69 Correct 9 ms 1784 KB Output is correct
70 Correct 14 ms 2040 KB Output is correct
71 Correct 20 ms 2172 KB Output is correct
72 Correct 19 ms 2168 KB Output is correct
73 Correct 6 ms 1784 KB Output is correct
74 Correct 15 ms 2012 KB Output is correct
75 Correct 19 ms 2168 KB Output is correct
76 Correct 11 ms 1912 KB Output is correct
77 Correct 23 ms 2296 KB Output is correct
78 Correct 7 ms 1784 KB Output is correct
79 Correct 13 ms 1912 KB Output is correct
80 Correct 11 ms 1912 KB Output is correct
81 Correct 26 ms 2424 KB Output is correct
82 Correct 4 ms 1656 KB Output is correct
83 Correct 13 ms 1912 KB Output is correct
84 Correct 17 ms 2296 KB Output is correct
85 Correct 4 ms 1656 KB Output is correct
86 Correct 17 ms 2296 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 8 ms 1784 KB Output is correct
4 Correct 6 ms 1788 KB Output is correct
5 Correct 6 ms 1784 KB Output is correct
6 Correct 6 ms 1784 KB Output is correct
7 Correct 6 ms 1784 KB Output is correct
8 Correct 4 ms 1528 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 4 ms 1528 KB Output is correct
11 Correct 7 ms 1784 KB Output is correct
12 Correct 6 ms 1784 KB Output is correct
13 Correct 3 ms 1528 KB Output is correct
14 Correct 6 ms 1784 KB Output is correct
15 Correct 3 ms 1528 KB Output is correct
16 Correct 6 ms 1788 KB Output is correct
17 Correct 3 ms 1528 KB Output is correct
18 Correct 6 ms 1784 KB Output is correct
19 Correct 4 ms 1528 KB Output is correct
20 Correct 5 ms 1784 KB Output is correct
21 Correct 5 ms 1784 KB Output is correct
22 Correct 4 ms 1528 KB Output is correct
23 Correct 7 ms 1784 KB Output is correct
24 Correct 4 ms 1528 KB Output is correct
25 Correct 7 ms 1784 KB Output is correct
26 Correct 7 ms 1784 KB Output is correct
27 Correct 6 ms 1912 KB Output is correct
28 Correct 7 ms 1784 KB Output is correct
29 Correct 6 ms 1784 KB Output is correct
30 Correct 7 ms 1784 KB Output is correct
31 Correct 7 ms 1784 KB Output is correct
32 Correct 7 ms 1784 KB Output is correct
33 Correct 7 ms 1784 KB Output is correct
34 Correct 7 ms 1784 KB Output is correct
35 Correct 5 ms 1660 KB Output is correct
36 Correct 5 ms 1656 KB Output is correct
37 Correct 5 ms 1656 KB Output is correct
38 Correct 4 ms 1528 KB Output is correct
39 Correct 4 ms 1528 KB Output is correct
40 Correct 9 ms 1788 KB Output is correct
41 Correct 4 ms 1656 KB Output is correct
42 Correct 9 ms 1912 KB Output is correct
43 Correct 9 ms 1912 KB Output is correct
44 Correct 3 ms 1528 KB Output is correct
45 Correct 102 ms 6056 KB Output is correct
46 Correct 53 ms 4628 KB Output is correct
47 Correct 106 ms 6136 KB Output is correct
48 Correct 102 ms 6012 KB Output is correct
49 Correct 35 ms 4468 KB Output is correct
50 Correct 117 ms 6648 KB Output is correct
51 Correct 103 ms 6136 KB Output is correct
52 Correct 37 ms 4472 KB Output is correct
53 Correct 35 ms 4340 KB Output is correct
54 Correct 12 ms 2040 KB Output is correct
55 Correct 116 ms 6596 KB Output is correct
56 Correct 27 ms 3832 KB Output is correct
57 Correct 37 ms 4344 KB Output is correct
58 Correct 50 ms 4600 KB Output is correct
59 Correct 26 ms 3832 KB Output is correct
60 Correct 25 ms 3832 KB Output is correct
61 Correct 50 ms 4600 KB Output is correct
62 Correct 38 ms 4212 KB Output is correct
63 Correct 63 ms 4856 KB Output is correct
64 Correct 26 ms 3860 KB Output is correct
65 Correct 82 ms 5444 KB Output is correct
66 Correct 38 ms 4192 KB Output is correct
67 Correct 64 ms 4912 KB Output is correct
68 Correct 75 ms 5348 KB Output is correct
69 Correct 81 ms 5496 KB Output is correct
70 Correct 38 ms 4216 KB Output is correct
71 Correct 77 ms 5424 KB Output is correct
72 Correct 62 ms 4832 KB Output is correct
73 Correct 87 ms 5712 KB Output is correct
74 Correct 39 ms 4236 KB Output is correct
75 Correct 35 ms 3292 KB Output is correct
76 Correct 61 ms 4828 KB Output is correct
77 Correct 88 ms 5820 KB Output is correct
78 Correct 45 ms 3568 KB Output is correct
79 Correct 36 ms 3188 KB Output is correct
80 Correct 19 ms 2424 KB Output is correct
81 Correct 46 ms 3600 KB Output is correct
82 Correct 64 ms 4940 KB Output is correct
83 Correct 19 ms 2424 KB Output is correct
84 Correct 63 ms 4984 KB Output is correct