oj.uz

Submission #300554

# Submission time Handle Problem Language Result Execution time Memory
300554 2020-09-17T09:21:16 Z imeimi2000 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1168 ms 62344 KB 
#ifdef imeimi

#include <vector>

long long find_maximum(int k, std::vector<std::vector<int>> d);
void allocate_tickets( std::vector<std::vector<int>> _x);

#include <cassert>
#include <cstdio>
#include <vector>
#include <string>

static int n;
static int m;
static int k;
static std::vector<std::vector<int>> d;
static std::vector<std::vector<int>> x;
static int called = 0;

static void check(bool cond, std::string message) {
    if (!cond) {
        printf("%s\n", message.c_str());
        exit(0);
    }
}


void allocate_tickets( std::vector<std::vector<int>> _d) {
    check(!called, "allocate_tickets called more than once");
    d = _d;
    check((int)d.size() == n, "allocate_tickets called with parameter of wrong size");
    for (int i = 0; i < n; i++) {
        check((int)d[i].size() == m, "allocate_tickets called with parameter of wrong size");
    }
    called = 1;
}

int main() {
    assert(scanf("%d %d %d", &n, &m, &k) == 3);
    x.resize(n);
    for (int i = 0; i < n; i++) {
        x[i].resize(m);
        for (int j=0; j < m; j++) {
            assert(scanf("%d", &x[i][j]) == 1);
        }
    }
    fclose(stdin);

    long long answer = find_maximum(k, x);
    check(called, "failure to call allocate_tickets");
    printf("%lld\n", answer);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (j) printf(" ");
            printf("%d", d[i][j]);
        }
        printf("\n");
    }
    fclose(stdout);
    return 0;
}

#else

#include "tickets.h"

#endif

#include <bits/stdc++.h>

using namespace std;
typedef long long llong;
typedef pair<int, int> pii;

llong find_maximum(int k, vector<vector<int>> X) {
    int n = X.size(), m = X[0].size();
    llong ret = 0;
    vector<pii> ord;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < k; ++j) ret -= X[i][j];
        for (int j = 0; j < k; ++j) {
            ord.emplace_back(X[i][j] + X[i][j + m - k], i);
        }
    }
    sort(ord.rbegin(), ord.rend());
    while (int(ord.size()) > n * k / 2) ord.pop_back();
    vector<int> pcnt(n, 0);
    for (auto [c, i] : ord) {
        ret += c;
        ++pcnt[i];
    }
    priority_queue<pii> pq;
    for (int i = 0; i < n; ++i) pq.emplace(pcnt[i], i);
    vector<vector<int>> ans(n, vector<int>(m, -1));
    vector<int> lcnt(n, 0), hcnt = pcnt;
    for (int r = 0; r < k; ++r) {
        vector<bool> used(n, 0);
        for (int i = 0; i < n / 2; ++i) {
            int j = pq.top().second; pq.pop();
            used[j] = 1;
            ans[j][m - (hcnt[j]--)] = r;
        }
        for (int i = 0; i < n; ++i) {
            if (used[i]) pq.emplace(hcnt[i], i);
            else ans[i][lcnt[i]++] = r;
        }
    }
    allocate_tickets(ans);
    return ret;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 32 ms 2424 KB Output is correct
6 Correct 817 ms 51484 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 27 ms 2556 KB Output is correct
6 Correct 703 ms 53488 KB Output is correct
7 Correct 713 ms 56416 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 7 ms 904 KB Output is correct
13 Correct 24 ms 2300 KB Output is correct
14 Correct 25 ms 2300 KB Output is correct
15 Correct 820 ms 58808 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 43 ms 2800 KB Output is correct
6 Correct 7 ms 768 KB Output is correct
7 Correct 8 ms 1024 KB Output is correct
8 Correct 1168 ms 62232 KB Output is correct
9 Correct 1080 ms 58136 KB Output is correct
10 Correct 1059 ms 58264 KB Output is correct
11 Correct 1163 ms 62344 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 31 ms 2432 KB Output is correct
14 Correct 43 ms 2424 KB Output is correct
15 Correct 43 ms 2556 KB Output is correct
16 Correct 44 ms 2800 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 36 ms 2552 KB Output is correct
21 Correct 37 ms 2560 KB Output is correct
22 Correct 41 ms 2676 KB Output is correct
23 Correct 40 ms 2676 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 32 ms 2424 KB Output is correct
12 Correct 817 ms 51484 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 27 ms 2556 KB Output is correct
18 Correct 703 ms 53488 KB Output is correct
19 Correct 713 ms 56416 KB Output is correct
20 Correct 4 ms 640 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 7 ms 904 KB Output is correct
25 Correct 24 ms 2300 KB Output is correct
26 Correct 25 ms 2300 KB Output is correct
27 Correct 820 ms 58808 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 43 ms 2800 KB Output is correct
33 Correct 7 ms 768 KB Output is correct
34 Correct 8 ms 1024 KB Output is correct
35 Correct 1168 ms 62232 KB Output is correct
36 Correct 1080 ms 58136 KB Output is correct
37 Correct 1059 ms 58264 KB Output is correct
38 Correct 1163 ms 62344 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 4 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 5 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 6 ms 512 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 3 ms 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 31 ms 2432 KB Output is correct
52 Correct 43 ms 2424 KB Output is correct
53 Correct 43 ms 2556 KB Output is correct
54 Correct 44 ms 2800 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 36 ms 2552 KB Output is correct
59 Correct 37 ms 2560 KB Output is correct
60 Correct 41 ms 2676 KB Output is correct
61 Correct 40 ms 2676 KB Output is correct
62 Correct 95 ms 6124 KB Output is correct
63 Correct 114 ms 6140 KB Output is correct
64 Correct 155 ms 7268 KB Output is correct
65 Correct 455 ms 24032 KB Output is correct
66 Correct 474 ms 27964 KB Output is correct
67 Correct 14 ms 1024 KB Output is correct
68 Correct 7 ms 768 KB Output is correct
69 Correct 804 ms 51484 KB Output is correct
70 Correct 1044 ms 53472 KB Output is correct
71 Correct 1124 ms 62292 KB Output is correct
72 Correct 982 ms 59540 KB Output is correct
73 Correct 1054 ms 59132 KB Output is correct
74 Correct 806 ms 52504 KB Output is correct
75 Correct 989 ms 52336 KB Output is correct