oj.uz

Submission #985497

# Submission time Handle Problem Language Result Execution time Memory
985497 2024-05-18T01:49:33 Z vjudge2 Council (JOI23_council) C++17
62 / 100
 4000 ms 57840 KB 
#include <bits/stdc++.h>
using namespace std;

void update(vector<pair<int, int>>& a, vector<pair<int, int>>& b) {
    vector<pair<int, int>> u;
    set<int> occ;
    // for (int i = 0; i < 2; i++) cout << a[i].first << ' ' << a[i].second << '\n';
    // for (int i = 0; i < 2; i++) cout << b[i].first << ' ' << b[i].second << '\n';
    for (int i = 0; i < 2; i++) {
        // if (!occ.count(a[i]) && a[i].first != -1) {
            u.push_back(a[i]);
            // occ.insert(a[i]);
        // }
        // if (!occ.count(b[i]) && b[i].first != -1) {
            u.push_back(b[i]);
            // occ.insert(b[i]);
        // }
    }
    sort(u.begin(), u.end(), [] (pair<int, int> x, pair<int, int> y) {
        return x.first > y.first;
    });
    vector<pair<int, int>> v;
    for (int i = 0; i < u.size(); i++) {
        if (!occ.count(u[i].second) && u[i].first != -1) {
            v.push_back(u[i]);
            occ.insert(u[i].second);
        }
    }
    while ((int) v.size() > 2) v.pop_back();
    while ((int) v.size() < 2) v.push_back({-1, -1});
    a = v;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);   
    int n, m;
    cin >> n >> m;
    vector<int> a(n, 0), freq(m, 0), b(n, 0);
    vector<vector<pair<int, int>>> dp(1 << m, vector<pair<int, int>> (2, {-1, -1}));
    for (int i = 0; i < n; i++) {
        int x;
        for (int j = 0; j < m; j++) {
            cin >> x;
            a[i] += (x << j);
            b[i] += ((1 - x) << j);
            if (x) freq[j]++;
        }
        // bitset<6> bs(b[i]);
        // cout << bs.to_string() << '\n';
        if (dp[b[i]][0].first == -1) dp[b[i]][0].first = __builtin_popcount(b[i]), dp[b[i]][0].second = i;
        else if (dp[b[i]][1].first == -1) dp[b[i]][1].first = __builtin_popcount(b[i]), dp[b[i]][1].second = i;
    }
//     4 6
// 1 1 0 0 1 1
// 1 0 1 1 1 1
// 0 0 0 0 0 1
// 0 1 1 1 0 0
    // max(popcount(b[sth] & s))..
    for (int i = (1 << m) - 1; i >= 0; i--) {
        for (int j = 0; j < m; j++) {
            if (i & (1 << j)) {
                int k = (i ^ (1 << j));
                vector<pair<int, int>> t = dp[i];
                for (auto& [x, y] : t) if (x != -1) x--;
                update(dp[k], t);
            }
        }
    }
    // for (int i = 0; i < (1 << m); i++) {
    //     bitset<6> bs(i);
    //     cout << bs.to_string() << '\n';
    //     cout << dp[i][0].first << ' ' << dp[i][1].first << '\n';
    // }
    for (int i = 0; i < (1 << m); i++) {
        for (int j = 0; j < m; j++) {
            if (i & (1 << j)) {
                int k = (i ^ (1 << j));
                // if (i == 23) cout << "debug: " << dp[i][0].first << ' ' << dp[i][1].first << ' ' << dp[k][0].first << ' ' << dp[k][1].first << '\n';
                update(dp[i], dp[k]);
                // if (i == 23) cout << "debug: " << dp[i][0].first << ' ' << dp[i][1].first << '\n';
            }
        }
        // bitset<6> bs(i);
        // cout << bs.to_string() << '\n';
        // cout << dp[i][0].first << ' ' << dp[i][1].first << '\n';
    }
    for (int i = 0; i < n; i++) {
        int ans = 0, sub = 0;
        for (int j = 0; j < m; j++) {
            int cnter = freq[j];
            if (a[i] & (1 << j)) cnter--;
            if (cnter > n / 2) ans++;
            else if (cnter == n / 2) {
                sub += (1 << j);
                // cout << "crit: " << j << '\n';
            }
        }
        // cout << ans << '\n';
        // cout << dp[sub][0].first << ' ' << dp[sub][0].second << '\n';
        // cout << dp[sub][1].first << ' ' << dp[sub][1].second << '\n';
        if (i == dp[sub][0].second) cout << ans + dp[sub][1].first << '\n';
        else cout << ans + dp[sub][0].first << '\n';
    }
}

Compilation message

council.cpp: In function 'void update(std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)':
council.cpp:23:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for (int i = 0; i < u.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 9 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3877 ms 57680 KB Output is correct
6 Correct 3244 ms 57840 KB Output is correct
7 Correct 3476 ms 57684 KB Output is correct
8 Correct 3722 ms 57684 KB Output is correct
9 Execution timed out 4037 ms 57680 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 9 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3877 ms 57680 KB Output is correct
6 Correct 3244 ms 57840 KB Output is correct
7 Correct 3476 ms 57684 KB Output is correct
8 Correct 3722 ms 57684 KB Output is correct
9 Execution timed out 4037 ms 57680 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 41 ms 4544 KB Output is correct
3 Correct 41 ms 4432 KB Output is correct
4 Correct 36 ms 3904 KB Output is correct
5 Correct 42 ms 4456 KB Output is correct
6 Correct 30 ms 3920 KB Output is correct
7 Correct 44 ms 4432 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 41 ms 4544 KB Output is correct
3 Correct 41 ms 4432 KB Output is correct
4 Correct 36 ms 3904 KB Output is correct
5 Correct 42 ms 4456 KB Output is correct
6 Correct 30 ms 3920 KB Output is correct
7 Correct 44 ms 4432 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 163 ms 9100 KB Output is correct
21 Correct 144 ms 8588 KB Output is correct
22 Correct 159 ms 8532 KB Output is correct
23 Correct 145 ms 9492 KB Output is correct
24 Correct 135 ms 9488 KB Output is correct
25 Correct 150 ms 9108 KB Output is correct
26 Correct 161 ms 9300 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 3 ms 344 KB Output is correct
36 Correct 3 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 856 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 348 KB Output is correct
45 Correct 3 ms 348 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 41 ms 4544 KB Output is correct
3 Correct 41 ms 4432 KB Output is correct
4 Correct 36 ms 3904 KB Output is correct
5 Correct 42 ms 4456 KB Output is correct
6 Correct 30 ms 3920 KB Output is correct
7 Correct 44 ms 4432 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 163 ms 9100 KB Output is correct
21 Correct 144 ms 8588 KB Output is correct
22 Correct 159 ms 8532 KB Output is correct
23 Correct 145 ms 9492 KB Output is correct
24 Correct 135 ms 9488 KB Output is correct
25 Correct 150 ms 9108 KB Output is correct
26 Correct 161 ms 9300 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 3 ms 344 KB Output is correct
36 Correct 3 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 856 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 348 KB Output is correct
45 Correct 3 ms 348 KB Output is correct
46 Correct 9 ms 604 KB Output is correct
47 Correct 272 ms 12268 KB Output is correct
48 Correct 228 ms 11424 KB Output is correct
49 Correct 223 ms 11344 KB Output is correct
50 Correct 222 ms 12936 KB Output is correct
51 Correct 215 ms 12368 KB Output is correct
52 Correct 263 ms 12376 KB Output is correct
53 Correct 287 ms 12624 KB Output is correct
54 Correct 43 ms 1116 KB Output is correct
55 Correct 38 ms 1116 KB Output is correct
56 Correct 43 ms 1368 KB Output is correct
57 Correct 39 ms 1116 KB Output is correct
58 Correct 41 ms 1372 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 41 ms 4544 KB Output is correct
3 Correct 41 ms 4432 KB Output is correct
4 Correct 36 ms 3904 KB Output is correct
5 Correct 42 ms 4456 KB Output is correct
6 Correct 30 ms 3920 KB Output is correct
7 Correct 44 ms 4432 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 163 ms 9100 KB Output is correct
21 Correct 144 ms 8588 KB Output is correct
22 Correct 159 ms 8532 KB Output is correct
23 Correct 145 ms 9492 KB Output is correct
24 Correct 135 ms 9488 KB Output is correct
25 Correct 150 ms 9108 KB Output is correct
26 Correct 161 ms 9300 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 3 ms 344 KB Output is correct
36 Correct 3 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 856 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 348 KB Output is correct
45 Correct 3 ms 348 KB Output is correct
46 Correct 9 ms 604 KB Output is correct
47 Correct 272 ms 12268 KB Output is correct
48 Correct 228 ms 11424 KB Output is correct
49 Correct 223 ms 11344 KB Output is correct
50 Correct 222 ms 12936 KB Output is correct
51 Correct 215 ms 12368 KB Output is correct
52 Correct 263 ms 12376 KB Output is correct
53 Correct 287 ms 12624 KB Output is correct
54 Correct 43 ms 1116 KB Output is correct
55 Correct 38 ms 1116 KB Output is correct
56 Correct 43 ms 1368 KB Output is correct
57 Correct 39 ms 1116 KB Output is correct
58 Correct 41 ms 1372 KB Output is correct
59 Correct 495 ms 16488 KB Output is correct
60 Correct 724 ms 12608 KB Output is correct
61 Correct 743 ms 13140 KB Output is correct
62 Correct 732 ms 13140 KB Output is correct
63 Correct 497 ms 16212 KB Output is correct
64 Correct 809 ms 20712 KB Output is correct
65 Correct 793 ms 20872 KB Output is correct
66 Correct 559 ms 20816 KB Output is correct
67 Correct 619 ms 20468 KB Output is correct
68 Correct 866 ms 20452 KB Output is correct
69 Correct 879 ms 20944 KB Output is correct
70 Correct 430 ms 7516 KB Output is correct
71 Correct 360 ms 7512 KB Output is correct
72 Correct 396 ms 7512 KB Output is correct
73 Correct 377 ms 7512 KB Output is correct
74 Correct 387 ms 7512 KB Output is correct
75 Correct 511 ms 7772 KB Output is correct

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 9 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3877 ms 57680 KB Output is correct
6 Correct 3244 ms 57840 KB Output is correct
7 Correct 3476 ms 57684 KB Output is correct
8 Correct 3722 ms 57684 KB Output is correct
9 Execution timed out 4037 ms 57680 KB Time limit exceeded
10 Halted 0 ms 0 KB -