oj.uz

Submission #308084

# Submission time Handle Problem Language Result Execution time Memory
308084 2020-09-30T03:12:25 Z SHZhang Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1047 ms 96368 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <cstdlib>
#include <utility>
#include <cmath>
#include <queue>
#include <stack>
#include <cstring>

using namespace std;

#define ll long long

#ifndef ONLINE_JUDGE
#define debug(format, ...) fprintf(stderr, \
    "%s:%d: " format "\n", __func__, __LINE__,##__VA_ARGS__)
#else
#define debug(format, ...)
#define NDEBUG
#endif

#include "tickets.h"

int n, m, k;
int a[1505][1505];
int sign[1505][1505];
int nxt[1505];
vector<int> pos[1505], neg[1505];
int output_arr[1505][1505];
bool used[1505];

ll find_maximum(int K, vector<vector<int> > input)
{
    n = input.size();
    m = input[0].size();
    k = K;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            a[i][j] = input[i][j];
        }
        for (int j = 0; j < k; j++) {
            sign[i][j] = -1;
        }
        nxt[i] = k - 1;
    }
    priority_queue<pair<ll, int> > pq;
    for (int i = 0; i < n; i++) {
        pq.push(make_pair((ll)a[i][k - 1] + (ll)a[i][m - 1], i));
    }
    for (int i = 1; i <= (n * k) / 2; i++) {
        pair<ll, int> pr = pq.top(); pq.pop();
        sign[pr.second][nxt[pr.second]]++;
        sign[pr.second][nxt[pr.second] + m - k]++;
        if (nxt[pr.second]) {
            nxt[pr.second]--;
            pr.first = (ll)a[pr.second][nxt[pr.second]] +
                (ll)a[pr.second][nxt[pr.second] + m - k];

            pq.push(pr);
        }
    }
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            ans += (ll)a[i][j] * (ll)sign[i][j];
            if (sign[i][j] > 0) {
                pos[i].push_back(j);
            } else if (sign[i][j] < 0) {
                neg[i].push_back(j);
            }
        }
    }

    for (int i = 1; i <= k; i++) {
        int pos_chosen = 0, neg_chosen = 0;
        for (int j = 0; j < n; j++) used[j] = false;
        for (int j = 0; j < n; j++) {
            if (pos[j].empty()) {
                neg_chosen++; output_arr[j][neg[j].back()] = i;
                neg[j].pop_back(); used[j] = true;
            } else if (neg[j].empty()) {
                pos_chosen++; output_arr[j][pos[j].back()] = i;
                pos[j].pop_back(); used[j] = true;
            }
        }
        for (int j = 0; j < n; j++) {
            if (used[j]) continue;
            if (pos_chosen < n / 2) {
                pos_chosen++; output_arr[j][pos[j].back()] = i;
                pos[j].pop_back();
            } else {
                neg_chosen++; output_arr[j][neg[j].back()] = i;
                neg[j].pop_back();
            }
        }
    }
    vector<vector<int> > final_ans(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            final_ans[i].push_back(output_arr[i][j] - 1);
        }
    }
    allocate_tickets(final_ans);
    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 512 KB Output is correct
3 Correct 0 ms 512 KB Output is correct
4 Correct 1 ms 1408 KB Output is correct
5 Correct 2 ms 4096 KB Output is correct
6 Correct 12 ms 18944 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 0 ms 512 KB Output is correct
4 Correct 3 ms 1536 KB Output is correct
5 Correct 33 ms 6908 KB Output is correct
6 Correct 759 ms 74232 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 3 ms 1664 KB Output is correct
5 Correct 29 ms 7552 KB Output is correct
6 Correct 673 ms 88424 KB Output is correct
7 Correct 689 ms 91768 KB Output is correct
8 Correct 4 ms 2048 KB Output is correct
9 Correct 0 ms 512 KB Output is correct
10 Correct 0 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 8 ms 3072 KB Output is correct
13 Correct 27 ms 9592 KB Output is correct
14 Correct 26 ms 5120 KB Output is correct
15 Correct 729 ms 93436 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 4 ms 1664 KB Output is correct
5 Correct 41 ms 8056 KB Output is correct
6 Correct 6 ms 1024 KB Output is correct
7 Correct 19 ms 19328 KB Output is correct
8 Correct 1037 ms 96248 KB Output is correct
9 Correct 985 ms 93180 KB Output is correct
10 Correct 967 ms 89908 KB Output is correct
11 Correct 1047 ms 96368 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 1536 KB Output is correct
3 Correct 3 ms 1664 KB Output is correct
4 Correct 3 ms 1664 KB Output is correct
5 Correct 3 ms 1664 KB Output is correct
6 Correct 3 ms 1664 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 1408 KB Output is correct
9 Correct 3 ms 1664 KB Output is correct
10 Correct 4 ms 1664 KB Output is correct
11 Correct 4 ms 1664 KB Output is correct
12 Correct 4 ms 1664 KB Output is correct
13 Correct 34 ms 7288 KB Output is correct
14 Correct 45 ms 7416 KB Output is correct
15 Correct 37 ms 7672 KB Output is correct
16 Correct 41 ms 8056 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 5 ms 4352 KB Output is correct
19 Correct 3 ms 4096 KB Output is correct
20 Correct 32 ms 7672 KB Output is correct
21 Correct 38 ms 7424 KB Output is correct
22 Correct 34 ms 7800 KB Output is correct
23 Correct 38 ms 7808 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 512 KB Output is correct
3 Correct 0 ms 512 KB Output is correct
4 Correct 1 ms 1408 KB Output is correct
5 Correct 2 ms 4096 KB Output is correct
6 Correct 12 ms 18944 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 0 ms 512 KB Output is correct
10 Correct 3 ms 1536 KB Output is correct
11 Correct 33 ms 6908 KB Output is correct
12 Correct 759 ms 74232 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 3 ms 1664 KB Output is correct
17 Correct 29 ms 7552 KB Output is correct
18 Correct 673 ms 88424 KB Output is correct
19 Correct 689 ms 91768 KB Output is correct
20 Correct 4 ms 2048 KB Output is correct
21 Correct 0 ms 512 KB Output is correct
22 Correct 0 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 8 ms 3072 KB Output is correct
25 Correct 27 ms 9592 KB Output is correct
26 Correct 26 ms 5120 KB Output is correct
27 Correct 729 ms 93436 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 4 ms 1664 KB Output is correct
32 Correct 41 ms 8056 KB Output is correct
33 Correct 6 ms 1024 KB Output is correct
34 Correct 19 ms 19328 KB Output is correct
35 Correct 1037 ms 96248 KB Output is correct
36 Correct 985 ms 93180 KB Output is correct
37 Correct 967 ms 89908 KB Output is correct
38 Correct 1047 ms 96368 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 3 ms 1536 KB Output is correct
41 Correct 3 ms 1664 KB Output is correct
42 Correct 3 ms 1664 KB Output is correct
43 Correct 3 ms 1664 KB Output is correct
44 Correct 3 ms 1664 KB Output is correct
45 Correct 1 ms 512 KB Output is correct
46 Correct 1 ms 1408 KB Output is correct
47 Correct 3 ms 1664 KB Output is correct
48 Correct 4 ms 1664 KB Output is correct
49 Correct 4 ms 1664 KB Output is correct
50 Correct 4 ms 1664 KB Output is correct
51 Correct 34 ms 7288 KB Output is correct
52 Correct 45 ms 7416 KB Output is correct
53 Correct 37 ms 7672 KB Output is correct
54 Correct 41 ms 8056 KB Output is correct
55 Correct 2 ms 512 KB Output is correct
56 Correct 5 ms 4352 KB Output is correct
57 Correct 3 ms 4096 KB Output is correct
58 Correct 32 ms 7672 KB Output is correct
59 Correct 38 ms 7424 KB Output is correct
60 Correct 34 ms 7800 KB Output is correct
61 Correct 38 ms 7808 KB Output is correct
62 Correct 92 ms 14356 KB Output is correct
63 Correct 94 ms 14968 KB Output is correct
64 Correct 111 ms 16548 KB Output is correct
65 Correct 404 ms 43896 KB Output is correct
66 Correct 452 ms 46712 KB Output is correct
67 Correct 18 ms 19328 KB Output is correct
68 Correct 6 ms 1024 KB Output is correct
69 Correct 762 ms 75896 KB Output is correct
70 Correct 906 ms 88328 KB Output is correct
71 Correct 1036 ms 96248 KB Output is correct
72 Correct 825 ms 94368 KB Output is correct
73 Correct 1000 ms 92664 KB Output is correct
74 Correct 731 ms 87036 KB Output is correct
75 Correct 889 ms 85624 KB Output is correct