oj.uz

Submission #670418

# Submission time Handle Problem Language Result Execution time Memory
670418 2022-12-09T01:26:41 Z CatalinT Carnival Tickets (IOI20_tickets) C++17
100 / 100
 795 ms 76224 KB 
#include <vector>
#include <iostream>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <set>
#include <map>
#include <string>
#include <unordered_map>
#include <functional>
#include <bitset>
#include <sstream>
#include <queue>

#include "tickets.h"

using namespace std;

using int64 = long long;

// void allocate_tickets(std::vector<std::vector<int>> _d) {
// }

struct Swap {
    int64 gain;
    int row;
    int l;
    int r;

    bool operator < (const Swap& other) const {
        if (gain != other.gain)
            return gain > other.gain;
        return row < other.row;
    }
};

long long find_maximum(int K, vector<vector<int>> D) {
    int N = D.size();
    int M = D[0].size();

    set<Swap> cand;

    int64 cur = 0;

    vector<vector<int>> assig(N, vector<int>(M, -1));

    for (int i = 0; i < N; i++) {
        for (int j = 0; j < K; j++) {
            cur += (-D[i][j]);
        }
        cand.insert(Swap{D[i][M-1] + D[i][K-1], i, K - 1, M - 1});
    }

    vector<int> deg(N);

    for (int steps = 0; steps < K * N / 2; steps++) {
        auto el = *cand.begin();
        cand.erase(cand.begin()); 
    
        cur += el.gain;

        deg[el.row]++;

        if (el.l >= 1) {
            el.l--;
            el.r--;
            el.gain = D[el.row][el.r] + D[el.row][el.l]; 
            cand.insert(el);
        }
    }

    auto old_deg = deg;

    priority_queue<pair<int, int>> heap;

    for (int i = 0; i < N; i++) {
        heap.push({deg[i], i});
    }

    for (int r = 0; r < K; r++) {
        // Assign N / 2 to the largest
        vector<pair<int, int>> put_back;
        vector<char> used(N);

        for (int i = 0; i < N / 2; i++) {
            auto el = heap.top();
            heap.pop();

            assig[el.second][M - 1 - (el.first - 1)] = r;

            assert(!used[el.second]);
            used[el.second] = true;

            el.first--;
            put_back.push_back(el);
        }

        for (auto el : put_back)
            heap.push(el);
    }

    for (int i = 0; i < N; i++) {
        old_deg[i] = K - old_deg[i];
        vector<char> used(K);
        for (int j = 0; j < M; j++) {
            if (assig[i][j] != -1) {
                used[assig[i][j]] = 1;
            }
        }
        int k = 0;
        for (int j = 0; j < old_deg[i]; j++) {
            while (used[k])
                k++;
            assig[i][j] = k;
            used[k] = 1;
        }
    }

    // for (int k = 0; k < K; k++) {
    //     cerr << "round: " << k << "\n";
    //     for (int i = 0; i < N; i++) {
    //         for (int j = 0; j < M; j++) {
    //             if (assig[i][j] == k) {
    //                 cerr << i << ", " << j << " = " << D[i][j] << "\n";
    //             }
    //         }
    //     }
    // }

    allocate_tickets(assig);

    return cur;
}

// int main() {
//     ios_base::sync_with_stdio(false);
//     cin.tie(NULL);

//     // int N, M, K;
//     // cin >> N >> M >> K;

//     // vector<vector<int>> D(N, vector<int>(M));

//     // for (int i = 0; i < N; i++) {
//     //     for (int j = 0; j < M; j++) {
//     //         cin >> D[i][j];
//     //     }
//     // }

//     // cerr << find_maximum(K, D) << "\n";

//     //cerr << find_maximum(2, {{0, 2, 5},{1, 1, 3}}) << "\n";
//     //cerr << find_maximum(1, {{5, 9}, {1, 4}, {3, 6}, {2, 7}}) << "\n";

//     return 0;
// }

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 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 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 23 ms 2376 KB Output is correct
6 Correct 464 ms 51400 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 20 ms 2316 KB Output is correct
6 Correct 497 ms 52460 KB Output is correct
7 Correct 508 ms 57272 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 0 ms 300 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 17 ms 2228 KB Output is correct
14 Correct 17 ms 2132 KB Output is correct
15 Correct 540 ms 57804 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 31 ms 2384 KB Output is correct
6 Correct 8 ms 732 KB Output is correct
7 Correct 10 ms 852 KB Output is correct
8 Correct 746 ms 54364 KB Output is correct
9 Correct 713 ms 71104 KB Output is correct
10 Correct 706 ms 71156 KB Output is correct
11 Correct 763 ms 76224 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 20 ms 2364 KB Output is correct
14 Correct 19 ms 2388 KB Output is correct
15 Correct 24 ms 2344 KB Output is correct
16 Correct 29 ms 2388 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 480 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 24 ms 2268 KB Output is correct
21 Correct 26 ms 2256 KB Output is correct
22 Correct 25 ms 2388 KB Output is correct
23 Correct 27 ms 2256 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 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 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 23 ms 2376 KB Output is correct
12 Correct 464 ms 51400 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 20 ms 2316 KB Output is correct
18 Correct 497 ms 52460 KB Output is correct
19 Correct 508 ms 57272 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 0 ms 300 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 6 ms 852 KB Output is correct
25 Correct 17 ms 2228 KB Output is correct
26 Correct 17 ms 2132 KB Output is correct
27 Correct 540 ms 57804 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 4 ms 340 KB Output is correct
32 Correct 31 ms 2384 KB Output is correct
33 Correct 8 ms 732 KB Output is correct
34 Correct 10 ms 852 KB Output is correct
35 Correct 746 ms 54364 KB Output is correct
36 Correct 713 ms 71104 KB Output is correct
37 Correct 706 ms 71156 KB Output is correct
38 Correct 763 ms 76224 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 340 KB Output is correct
43 Correct 2 ms 340 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 2 ms 340 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Correct 2 ms 340 KB Output is correct
50 Correct 2 ms 340 KB Output is correct
51 Correct 20 ms 2364 KB Output is correct
52 Correct 19 ms 2388 KB Output is correct
53 Correct 24 ms 2344 KB Output is correct
54 Correct 29 ms 2388 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 480 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 24 ms 2268 KB Output is correct
59 Correct 26 ms 2256 KB Output is correct
60 Correct 25 ms 2388 KB Output is correct
61 Correct 27 ms 2256 KB Output is correct
62 Correct 53 ms 8396 KB Output is correct
63 Correct 54 ms 8352 KB Output is correct
64 Correct 80 ms 8556 KB Output is correct
65 Correct 273 ms 33128 KB Output is correct
66 Correct 338 ms 33820 KB Output is correct
67 Correct 6 ms 1108 KB Output is correct
68 Correct 5 ms 800 KB Output is correct
69 Correct 476 ms 73304 KB Output is correct
70 Correct 619 ms 74220 KB Output is correct
71 Correct 795 ms 76136 KB Output is correct
72 Correct 617 ms 60636 KB Output is correct
73 Correct 719 ms 73452 KB Output is correct
74 Correct 511 ms 59304 KB Output is correct
75 Correct 608 ms 71928 KB Output is correct