oj.uz

Submission #833049

# Submission time Handle Problem Language Result Execution time Memory
833049 2023-08-21T21:02:19 Z PanosPask Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1424 ms 108800 KB 
#include <bits/stdc++.h>
#include "tickets.h"
#define mp make_pair

using namespace std;

typedef long long ll;

struct Add_Positive {
    int colour;
    int rm;
    int add;
};

int N, M, K;
vector<vector<int>> x;
vector<vector<int>> s;

priority_queue<Add_Positive> q;

vector<vector<int>> pl;
vector<vector<int>> mi;

bool plus_sort(const int& a, const int& b)
{
    return pl[a].size() < pl[b].size();
}

bool operator < (const Add_Positive&a, const Add_Positive& b) {
    if (x[a.colour][a.rm] + x[a.colour][a.add] == x[b.colour][b.add] + x[b.colour][b.rm])
        return a.rm < b.rm;

    return x[a.colour][a.rm] + x[a.colour][a.add] < x[b.colour][b.add] + x[b.colour][b.rm];
}

ll find_maximum(int k, vector<vector<int>> X)
{
    N = X.size();
    M = X[0].size();
    x = X;
    K = k;

    s.assign(N, vector<int>(M, -1));

    pl.resize(N);
    mi.resize(N);

    int begin_pos = M - K;
    ll ans = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < K; j++) {
            ans -= x[i][j];
            mi[i].push_back(j);
            q.push({i, j, j + begin_pos});
        }
    }

    for (int cnt = 0; cnt < K * N / 2; cnt++) {
        // Swap a negative for a positive
        auto cur = q.top();
        q.pop();

        ans += x[cur.colour][cur.add] + x[cur.colour][cur.rm];

        mi[cur.colour].pop_back();
        pl[cur.colour].push_back(cur.add);
    }

    for (int r = 0; r < K; r++) {
        vector<int> p;
        for (int i = 0; i < N; i++)
            p.push_back(i);
        sort(p.begin(), p.end(), plus_sort);

        for (int i = 0; i < N / 2; i++) {
            int v = p[i];
            s[v][mi[v].back()] = r;
            mi[v].pop_back();
        }
        for (int i = N / 2; i < N; i++) {
            int v = p[i];
            s[v][pl[v].back()] = r;
            pl[v].pop_back();
        }
    }

    allocate_tickets(s);

    return ans;
}

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 1 ms 852 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 468 KB Output is correct
5 Correct 17 ms 2772 KB Output is correct
6 Correct 423 ms 60400 KB Output is correct

Subtask #3
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 2 ms 468 KB Output is correct
5 Correct 22 ms 3708 KB Output is correct
6 Correct 713 ms 83780 KB Output is correct
7 Correct 887 ms 88456 KB Output is correct
8 Correct 4 ms 724 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 1216 KB Output is correct
13 Correct 21 ms 3496 KB Output is correct
14 Correct 22 ms 3648 KB Output is correct
15 Correct 1002 ms 101036 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 35 ms 4780 KB Output is correct
6 Correct 5 ms 960 KB Output is correct
7 Correct 6 ms 1364 KB Output is correct
8 Correct 1363 ms 108224 KB Output is correct
9 Correct 1292 ms 101184 KB Output is correct
10 Correct 1298 ms 100092 KB Output is correct
11 Correct 1424 ms 107120 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 1 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 620 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 1 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 620 KB Output is correct
13 Correct 17 ms 2772 KB Output is correct
14 Correct 17 ms 2724 KB Output is correct
15 Correct 26 ms 3728 KB Output is correct
16 Correct 34 ms 4800 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 30 ms 3904 KB Output is correct
21 Correct 27 ms 3804 KB Output is correct
22 Correct 32 ms 4524 KB Output is correct
23 Correct 38 ms 4464 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 1 ms 852 KB Output is correct
7 Correct 1 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 468 KB Output is correct
11 Correct 17 ms 2772 KB Output is correct
12 Correct 423 ms 60400 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 22 ms 3708 KB Output is correct
18 Correct 713 ms 83780 KB Output is correct
19 Correct 887 ms 88456 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 6 ms 1216 KB Output is correct
25 Correct 21 ms 3496 KB Output is correct
26 Correct 22 ms 3648 KB Output is correct
27 Correct 1002 ms 101036 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 35 ms 4780 KB Output is correct
33 Correct 5 ms 960 KB Output is correct
34 Correct 6 ms 1364 KB Output is correct
35 Correct 1363 ms 108224 KB Output is correct
36 Correct 1292 ms 101184 KB Output is correct
37 Correct 1298 ms 100092 KB Output is correct
38 Correct 1424 ms 107120 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 2 ms 596 KB Output is correct
50 Correct 3 ms 620 KB Output is correct
51 Correct 17 ms 2772 KB Output is correct
52 Correct 17 ms 2724 KB Output is correct
53 Correct 26 ms 3728 KB Output is correct
54 Correct 34 ms 4800 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 30 ms 3904 KB Output is correct
59 Correct 27 ms 3804 KB Output is correct
60 Correct 32 ms 4524 KB Output is correct
61 Correct 38 ms 4464 KB Output is correct
62 Correct 48 ms 7884 KB Output is correct
63 Correct 49 ms 7984 KB Output is correct
64 Correct 119 ms 12776 KB Output is correct
65 Correct 343 ms 37756 KB Output is correct
66 Correct 516 ms 47404 KB Output is correct
67 Correct 7 ms 1492 KB Output is correct
68 Correct 6 ms 1124 KB Output is correct
69 Correct 422 ms 61216 KB Output is correct
70 Correct 889 ms 84496 KB Output is correct
71 Correct 1419 ms 108800 KB Output is correct
72 Correct 1280 ms 103496 KB Output is correct
73 Correct 1376 ms 102156 KB Output is correct
74 Correct 869 ms 82844 KB Output is correct
75 Correct 936 ms 82228 KB Output is correct