Submission #346427

# Submission time Handle Problem Language Result Execution time Memory
346427 2021-01-09T16:08:45 Z two_sides Carnival Tickets (IOI20_tickets) C++17
100 / 100
865 ms 64876 KB
#include <bits/stdc++.h>
#include "tickets.h"

using namespace std;

const int N = 1505;

int a[N][N], l[N], r[N], b[N][N], p[N];
priority_queue <pair <int, int>> pq;

long long find_maximum(int k, vector <vector <int>> x) {
    long long res = 0;
    int n = x.size(), m = x[0].size();
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++)
            a[i][j] = x[i - 1][j - 1];
        for (int j = 1; j <= k; j++)
            res -= a[i][j];
        l[i] = k; r[i] = m;
        pq.emplace(a[i][k] + a[i][m], i);
    }
    int cntr = 0;
    for (int i = 1; i <= n; i++) p[i] = i;
    while (cntr < n / 2 * k) {
        int v, i; tie(v, i) = pq.top(); pq.pop();
        res += v; l[i]--; r[i]--; cntr++;
        if (l[i] > 0)
            pq.emplace(a[i][l[i]] + a[i][r[i]], i);
    }
    memset(b, -1, sizeof b);
    while (k--) {
        sort(p + 1, p + n + 1,
        [](int i, int j) {return l[i] > l[j];});
        for (int i = 1; i <= n / 2; i++) {
            b[p[i]][l[p[i]]] = k; l[p[i]]--;
        }
        for (int i = n / 2 + 1; i <= n; i++) {
            r[p[i]]++; b[p[i]][r[p[i]]] = k;
        }
    }
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            x[i][j] = b[i + 1][j + 1];
    allocate_tickets(x); return res;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 9196 KB Output is correct
2 Correct 5 ms 9196 KB Output is correct
3 Correct 6 ms 9196 KB Output is correct
4 Correct 6 ms 9580 KB Output is correct
5 Correct 6 ms 10476 KB Output is correct
6 Correct 9 ms 15596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 9196 KB Output is correct
2 Correct 5 ms 9196 KB Output is correct
3 Correct 5 ms 9196 KB Output is correct
4 Correct 7 ms 9708 KB Output is correct
5 Correct 33 ms 13420 KB Output is correct
6 Correct 662 ms 61880 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 9196 KB Output is correct
2 Correct 5 ms 9196 KB Output is correct
3 Correct 5 ms 9196 KB Output is correct
4 Correct 7 ms 9708 KB Output is correct
5 Correct 31 ms 12780 KB Output is correct
6 Correct 640 ms 64004 KB Output is correct
7 Correct 668 ms 64364 KB Output is correct
8 Correct 9 ms 9836 KB Output is correct
9 Correct 5 ms 9196 KB Output is correct
10 Correct 5 ms 9196 KB Output is correct
11 Correct 5 ms 9196 KB Output is correct
12 Correct 12 ms 10348 KB Output is correct
13 Correct 28 ms 13036 KB Output is correct
14 Correct 27 ms 11756 KB Output is correct
15 Correct 696 ms 64876 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 9196 KB Output is correct
2 Correct 5 ms 9196 KB Output is correct
3 Correct 5 ms 9196 KB Output is correct
4 Correct 8 ms 9708 KB Output is correct
5 Correct 39 ms 13420 KB Output is correct
6 Correct 11 ms 9708 KB Output is correct
7 Correct 14 ms 15852 KB Output is correct
8 Correct 863 ms 63292 KB Output is correct
9 Correct 799 ms 60140 KB Output is correct
10 Correct 803 ms 59628 KB Output is correct
11 Correct 865 ms 63340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 9196 KB Output is correct
2 Correct 7 ms 9708 KB Output is correct
3 Correct 7 ms 9708 KB Output is correct
4 Correct 7 ms 9708 KB Output is correct
5 Correct 8 ms 9836 KB Output is correct
6 Correct 7 ms 9708 KB Output is correct
7 Correct 6 ms 9196 KB Output is correct
8 Correct 5 ms 9580 KB Output is correct
9 Correct 7 ms 9708 KB Output is correct
10 Correct 7 ms 9708 KB Output is correct
11 Correct 7 ms 9708 KB Output is correct
12 Correct 8 ms 9708 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 9196 KB Output is correct
2 Correct 7 ms 9708 KB Output is correct
3 Correct 7 ms 9708 KB Output is correct
4 Correct 7 ms 9708 KB Output is correct
5 Correct 8 ms 9836 KB Output is correct
6 Correct 7 ms 9708 KB Output is correct
7 Correct 6 ms 9196 KB Output is correct
8 Correct 5 ms 9580 KB Output is correct
9 Correct 7 ms 9708 KB Output is correct
10 Correct 7 ms 9708 KB Output is correct
11 Correct 7 ms 9708 KB Output is correct
12 Correct 8 ms 9708 KB Output is correct
13 Correct 32 ms 13420 KB Output is correct
14 Correct 32 ms 13420 KB Output is correct
15 Correct 36 ms 13420 KB Output is correct
16 Correct 40 ms 13548 KB Output is correct
17 Correct 6 ms 9324 KB Output is correct
18 Correct 8 ms 10604 KB Output is correct
19 Correct 7 ms 10584 KB Output is correct
20 Correct 33 ms 12780 KB Output is correct
21 Correct 36 ms 13292 KB Output is correct
22 Correct 34 ms 12780 KB Output is correct
23 Correct 38 ms 13292 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 9196 KB Output is correct
2 Correct 5 ms 9196 KB Output is correct
3 Correct 6 ms 9196 KB Output is correct
4 Correct 6 ms 9580 KB Output is correct
5 Correct 6 ms 10476 KB Output is correct
6 Correct 9 ms 15596 KB Output is correct
7 Correct 5 ms 9196 KB Output is correct
8 Correct 5 ms 9196 KB Output is correct
9 Correct 5 ms 9196 KB Output is correct
10 Correct 7 ms 9708 KB Output is correct
11 Correct 33 ms 13420 KB Output is correct
12 Correct 662 ms 61880 KB Output is correct
13 Correct 5 ms 9196 KB Output is correct
14 Correct 5 ms 9196 KB Output is correct
15 Correct 5 ms 9196 KB Output is correct
16 Correct 7 ms 9708 KB Output is correct
17 Correct 31 ms 12780 KB Output is correct
18 Correct 640 ms 64004 KB Output is correct
19 Correct 668 ms 64364 KB Output is correct
20 Correct 9 ms 9836 KB Output is correct
21 Correct 5 ms 9196 KB Output is correct
22 Correct 5 ms 9196 KB Output is correct
23 Correct 5 ms 9196 KB Output is correct
24 Correct 12 ms 10348 KB Output is correct
25 Correct 28 ms 13036 KB Output is correct
26 Correct 27 ms 11756 KB Output is correct
27 Correct 696 ms 64876 KB Output is correct
28 Correct 5 ms 9196 KB Output is correct
29 Correct 5 ms 9196 KB Output is correct
30 Correct 5 ms 9196 KB Output is correct
31 Correct 8 ms 9708 KB Output is correct
32 Correct 39 ms 13420 KB Output is correct
33 Correct 11 ms 9708 KB Output is correct
34 Correct 14 ms 15852 KB Output is correct
35 Correct 863 ms 63292 KB Output is correct
36 Correct 799 ms 60140 KB Output is correct
37 Correct 803 ms 59628 KB Output is correct
38 Correct 865 ms 63340 KB Output is correct
39 Correct 5 ms 9196 KB Output is correct
40 Correct 7 ms 9708 KB Output is correct
41 Correct 7 ms 9708 KB Output is correct
42 Correct 7 ms 9708 KB Output is correct
43 Correct 8 ms 9836 KB Output is correct
44 Correct 7 ms 9708 KB Output is correct
45 Correct 6 ms 9196 KB Output is correct
46 Correct 5 ms 9580 KB Output is correct
47 Correct 7 ms 9708 KB Output is correct
48 Correct 7 ms 9708 KB Output is correct
49 Correct 7 ms 9708 KB Output is correct
50 Correct 8 ms 9708 KB Output is correct
51 Correct 32 ms 13420 KB Output is correct
52 Correct 32 ms 13420 KB Output is correct
53 Correct 36 ms 13420 KB Output is correct
54 Correct 40 ms 13548 KB Output is correct
55 Correct 6 ms 9324 KB Output is correct
56 Correct 8 ms 10604 KB Output is correct
57 Correct 7 ms 10584 KB Output is correct
58 Correct 33 ms 12780 KB Output is correct
59 Correct 36 ms 13292 KB Output is correct
60 Correct 34 ms 12780 KB Output is correct
61 Correct 38 ms 13292 KB Output is correct
62 Correct 80 ms 19308 KB Output is correct
63 Correct 82 ms 19308 KB Output is correct
64 Correct 98 ms 19564 KB Output is correct
65 Correct 346 ms 36972 KB Output is correct
66 Correct 389 ms 37612 KB Output is correct
67 Correct 14 ms 15852 KB Output is correct
68 Correct 10 ms 9708 KB Output is correct
69 Correct 663 ms 60652 KB Output is correct
70 Correct 767 ms 61420 KB Output is correct
71 Correct 858 ms 63212 KB Output is correct
72 Correct 730 ms 64208 KB Output is correct
73 Correct 824 ms 61172 KB Output is correct
74 Correct 676 ms 62788 KB Output is correct
75 Correct 748 ms 59756 KB Output is correct