답안 #677040

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677040 2023-01-02T07:34:30 Z Cyanmond Political Development (BOI17_politicaldevelopment) C++17
100 / 100
427 ms 31432 KB
#include <bits/stdc++.h>

int main() {
    int N, K;
    std::cin >> N >> K;
    std::vector<int> D(N);
    std::vector<std::vector<int>> E(N);
    for (int i = 0; i < N; ++i) {
        std::cin >> D[i];
        E[i].resize(D[i]);
        for (auto &e : E[i]) {
            std::cin >> e;
        }
    }

    int answer = 0;

    //if (N <= 5000 or K <= 5) {
        // Group 1, 2, 4, 5
        // Group 3 ... Time Limit ?
        std::vector<std::unordered_set<int>> S(N);
        for (int i = 0; i < N; ++i) {
            for (auto &e : E[i]) {
                S[i].insert(e);
            }
        }

        std::set<std::pair<int, int>> group_size;
        for (int i = 0; i < N; ++i) {
            group_size.insert({D[i], i});
        }

        while (not group_size.empty()) {
            const auto [s, f] = *group_size.begin();
            group_size.erase(group_size.begin());

            // step 1 : brute force
            assert(s < K);
            std::vector<std::vector<bool>> table(s, std::vector<bool>(s));
            int i1 = 0;
            for (const int e : S[f]) {
                int i2 = 0;
                for (const int e2 : S[f]) {
                    if (S[e].find(e2) != S[e].end()) {
                        table[i1][i2] = true;
                    }
                    ++i2;
                }
                ++i1;
            }

            std::vector<bool> dp(1 << s);
            dp[0] = true;
            for (int state = 0; state < (1 << s); ++state) {
                if (not dp[state]) {
                    continue;
                }
                answer = std::max(answer, __builtin_popcount(state) + 1);
                for (int new_bit = 0; new_bit < s; ++new_bit) {
                    if ((state & (1 << new_bit)) or dp[state | (1 << new_bit)]) {
                        continue;
                    }
                    bool ok = true;
                    for (int i = 0; i < s; ++i) {
                        if (state & (1 << i)) {
                            if (not table[i][new_bit]) {
                                ok = false;
                                break;
                            }
                        }
                    }
                    if (ok) {
                        dp[state | (1 << new_bit)] = true;
                    }
                }
            }

            // step 2 : update
            for (const int e : S[f]) {
                S[e].erase(f);
                const auto itr = group_size.find({D[e], e});
                group_size.erase(itr);
                group_size.insert({--D[e], e});
            }
        }

        std::cout << answer << std::endl;
    //}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 9 ms 1972 KB Output is correct
4 Correct 7 ms 2040 KB Output is correct
5 Correct 7 ms 2024 KB Output is correct
6 Correct 9 ms 1996 KB Output is correct
7 Correct 14 ms 2004 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 9 ms 1972 KB Output is correct
4 Correct 7 ms 2040 KB Output is correct
5 Correct 7 ms 2024 KB Output is correct
6 Correct 9 ms 1996 KB Output is correct
7 Correct 14 ms 2004 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 11 ms 1944 KB Output is correct
12 Correct 7 ms 2004 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 7 ms 2004 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 9 ms 2016 KB Output is correct
17 Correct 0 ms 260 KB Output is correct
18 Correct 8 ms 2056 KB Output is correct
19 Correct 2 ms 960 KB Output is correct
20 Correct 6 ms 1748 KB Output is correct
21 Correct 6 ms 1748 KB Output is correct
22 Correct 3 ms 852 KB Output is correct
23 Correct 10 ms 2032 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 12 ms 2004 KB Output is correct
26 Correct 10 ms 1876 KB Output is correct
27 Correct 8 ms 1876 KB Output is correct
28 Correct 10 ms 1876 KB Output is correct
29 Correct 8 ms 1928 KB Output is correct
30 Correct 11 ms 2132 KB Output is correct
31 Correct 10 ms 2004 KB Output is correct
32 Correct 9 ms 2004 KB Output is correct
33 Correct 10 ms 1980 KB Output is correct
34 Correct 10 ms 2072 KB Output is correct
35 Correct 5 ms 1108 KB Output is correct
36 Correct 5 ms 1108 KB Output is correct
37 Correct 5 ms 1108 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 3 ms 724 KB Output is correct
40 Correct 13 ms 2260 KB Output is correct
41 Correct 4 ms 724 KB Output is correct
42 Correct 18 ms 2196 KB Output is correct
43 Correct 18 ms 2252 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 852 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 427 ms 28788 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 363 ms 31256 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 368 ms 31408 KB Output is correct
16 Correct 372 ms 31432 KB Output is correct
17 Correct 358 ms 31336 KB Output is correct
18 Correct 364 ms 31320 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 9 ms 1972 KB Output is correct
4 Correct 7 ms 2040 KB Output is correct
5 Correct 7 ms 2024 KB Output is correct
6 Correct 9 ms 1996 KB Output is correct
7 Correct 14 ms 2004 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 11 ms 1944 KB Output is correct
12 Correct 7 ms 2004 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 7 ms 2004 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 9 ms 2016 KB Output is correct
17 Correct 0 ms 260 KB Output is correct
18 Correct 8 ms 2056 KB Output is correct
19 Correct 2 ms 960 KB Output is correct
20 Correct 6 ms 1748 KB Output is correct
21 Correct 6 ms 1748 KB Output is correct
22 Correct 3 ms 852 KB Output is correct
23 Correct 10 ms 2032 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 12 ms 2004 KB Output is correct
26 Correct 10 ms 1876 KB Output is correct
27 Correct 8 ms 1876 KB Output is correct
28 Correct 10 ms 1876 KB Output is correct
29 Correct 8 ms 1928 KB Output is correct
30 Correct 11 ms 2132 KB Output is correct
31 Correct 10 ms 2004 KB Output is correct
32 Correct 9 ms 2004 KB Output is correct
33 Correct 10 ms 1980 KB Output is correct
34 Correct 10 ms 2072 KB Output is correct
35 Correct 5 ms 1108 KB Output is correct
36 Correct 5 ms 1108 KB Output is correct
37 Correct 5 ms 1108 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 3 ms 724 KB Output is correct
40 Correct 13 ms 2260 KB Output is correct
41 Correct 4 ms 724 KB Output is correct
42 Correct 18 ms 2196 KB Output is correct
43 Correct 18 ms 2252 KB Output is correct
44 Correct 32 ms 2920 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 13 ms 2260 KB Output is correct
47 Correct 26 ms 3028 KB Output is correct
48 Correct 14 ms 2260 KB Output is correct
49 Correct 28 ms 2988 KB Output is correct
50 Correct 25 ms 2960 KB Output is correct
51 Correct 56 ms 4692 KB Output is correct
52 Correct 7 ms 2004 KB Output is correct
53 Correct 46 ms 5068 KB Output is correct
54 Correct 65 ms 5204 KB Output is correct
55 Correct 9 ms 1988 KB Output is correct
56 Correct 7 ms 2004 KB Output is correct
57 Correct 2 ms 852 KB Output is correct
58 Correct 53 ms 5088 KB Output is correct
59 Correct 14 ms 2404 KB Output is correct
60 Correct 11 ms 2048 KB Output is correct
61 Correct 15 ms 2260 KB Output is correct
62 Correct 12 ms 2288 KB Output is correct
63 Correct 32 ms 2972 KB Output is correct
64 Correct 23 ms 2772 KB Output is correct
65 Correct 12 ms 2132 KB Output is correct
66 Correct 13 ms 2188 KB Output is correct
67 Correct 34 ms 3284 KB Output is correct
68 Correct 23 ms 2836 KB Output is correct
69 Correct 16 ms 2112 KB Output is correct
70 Correct 24 ms 2772 KB Output is correct
71 Correct 35 ms 3284 KB Output is correct
72 Correct 32 ms 3308 KB Output is correct
73 Correct 10 ms 1876 KB Output is correct
74 Correct 31 ms 2884 KB Output is correct
75 Correct 33 ms 3236 KB Output is correct
76 Correct 16 ms 2440 KB Output is correct
77 Correct 37 ms 3584 KB Output is correct
78 Correct 8 ms 1980 KB Output is correct
79 Correct 19 ms 2000 KB Output is correct
80 Correct 18 ms 2552 KB Output is correct
81 Correct 38 ms 3688 KB Output is correct
82 Correct 4 ms 756 KB Output is correct
83 Correct 19 ms 2012 KB Output is correct
84 Correct 28 ms 3020 KB Output is correct
85 Correct 4 ms 724 KB Output is correct
86 Correct 27 ms 3112 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 9 ms 1972 KB Output is correct
4 Correct 7 ms 2040 KB Output is correct
5 Correct 7 ms 2024 KB Output is correct
6 Correct 9 ms 1996 KB Output is correct
7 Correct 14 ms 2004 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 11 ms 1944 KB Output is correct
12 Correct 7 ms 2004 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 7 ms 2004 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 9 ms 2016 KB Output is correct
17 Correct 0 ms 260 KB Output is correct
18 Correct 8 ms 2056 KB Output is correct
19 Correct 2 ms 960 KB Output is correct
20 Correct 6 ms 1748 KB Output is correct
21 Correct 6 ms 1748 KB Output is correct
22 Correct 3 ms 852 KB Output is correct
23 Correct 10 ms 2032 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 12 ms 2004 KB Output is correct
26 Correct 10 ms 1876 KB Output is correct
27 Correct 8 ms 1876 KB Output is correct
28 Correct 10 ms 1876 KB Output is correct
29 Correct 8 ms 1928 KB Output is correct
30 Correct 11 ms 2132 KB Output is correct
31 Correct 10 ms 2004 KB Output is correct
32 Correct 9 ms 2004 KB Output is correct
33 Correct 10 ms 1980 KB Output is correct
34 Correct 10 ms 2072 KB Output is correct
35 Correct 5 ms 1108 KB Output is correct
36 Correct 5 ms 1108 KB Output is correct
37 Correct 5 ms 1108 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 3 ms 724 KB Output is correct
40 Correct 13 ms 2260 KB Output is correct
41 Correct 4 ms 724 KB Output is correct
42 Correct 18 ms 2196 KB Output is correct
43 Correct 18 ms 2252 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 258 ms 23816 KB Output is correct
46 Correct 124 ms 18872 KB Output is correct
47 Correct 260 ms 23856 KB Output is correct
48 Correct 254 ms 23816 KB Output is correct
49 Correct 87 ms 17680 KB Output is correct
50 Correct 255 ms 29780 KB Output is correct
51 Correct 252 ms 23756 KB Output is correct
52 Correct 87 ms 17436 KB Output is correct
53 Correct 84 ms 17756 KB Output is correct
54 Correct 20 ms 6740 KB Output is correct
55 Correct 252 ms 29880 KB Output is correct
56 Correct 65 ms 15308 KB Output is correct
57 Correct 91 ms 17544 KB Output is correct
58 Correct 113 ms 18396 KB Output is correct
59 Correct 65 ms 15356 KB Output is correct
60 Correct 65 ms 15360 KB Output is correct
61 Correct 114 ms 18488 KB Output is correct
62 Correct 94 ms 16872 KB Output is correct
63 Correct 156 ms 19276 KB Output is correct
64 Correct 65 ms 15324 KB Output is correct
65 Correct 189 ms 21076 KB Output is correct
66 Correct 101 ms 16880 KB Output is correct
67 Correct 171 ms 19256 KB Output is correct
68 Correct 178 ms 20444 KB Output is correct
69 Correct 190 ms 20976 KB Output is correct
70 Correct 107 ms 16828 KB Output is correct
71 Correct 189 ms 20564 KB Output is correct
72 Correct 157 ms 19476 KB Output is correct
73 Correct 207 ms 21892 KB Output is correct
74 Correct 96 ms 16928 KB Output is correct
75 Correct 76 ms 10108 KB Output is correct
76 Correct 148 ms 19476 KB Output is correct
77 Correct 219 ms 21956 KB Output is correct
78 Correct 106 ms 11072 KB Output is correct
79 Correct 75 ms 10076 KB Output is correct
80 Correct 33 ms 5460 KB Output is correct
81 Correct 101 ms 11104 KB Output is correct
82 Correct 163 ms 20048 KB Output is correct
83 Correct 33 ms 5444 KB Output is correct
84 Correct 164 ms 20152 KB Output is correct