oj.uz

Submission #800948

# Submission time Handle Problem Language Result Execution time Memory
800948 2023-08-02T02:08:32 Z becaido Carnival Tickets (IOI20_tickets) C++17
100 / 100
 548 ms 54392 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 1505;

int cnt[SIZE];
bool is[SIZE];
int L[SIZE], R[SIZE];
priority_queue<pair<int, int>> pq;
ll find_maximum(int k, vector<vector<int>> x) {
    int n = x.size();
    int m = x[0].size();
    ll sum = 0;
    vector<vector<int>> ans;
    ans.resize(n, vector<int>(m, -1));
    fill(cnt, cnt + n, k);
    FOR (i, 0, n - 1) {
        sum += accumulate(x[i].begin() + m - cnt[i], x[i].end(), 0ll);
        pq.emplace(-x[i][0] - x[i][m - cnt[i]], i);
    }
    FOR (t, 1, n * k / 2) {
        auto [delta, i] = pq.top();
        pq.pop();
        sum += delta;
        cnt[i]--;
        if (cnt[i] > 0) pq.emplace(-x[i][k - cnt[i]] - x[i][m - cnt[i]], i);
    }
    pq = {};
    FOR (i, 0, n - 1) {
        pq.emplace(cnt[i], i);
        R[i] = m - 1;
    }
    FOR (t, 0, k - 1) {
        fill(is, is + n, 0);
        vector<pair<int, int>> vp;
        FOR (i, 0, n / 2 - 1) {
            auto [c, p] = pq.top();
            pq.pop();
            is[p] = 1;
            ans[p][R[p]--] = t;
            vp.pb(c - 1, p);
        }
        for (auto [c, i] : vp) pq.emplace(c, i);
        FOR (i, 0, n - 1) if (!is[i]) ans[i][L[i]++] = t;
    }
    allocate_tickets(ans);
    return sum;
}

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 0 ms 340 KB Output is correct
6 Correct 1 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 18 ms 2352 KB Output is correct
6 Correct 392 ms 51376 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 16 ms 2300 KB Output is correct
6 Correct 408 ms 52276 KB Output is correct
7 Correct 426 ms 52740 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 0 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 4 ms 724 KB Output is correct
13 Correct 14 ms 2004 KB Output is correct
14 Correct 15 ms 1968 KB Output is correct
15 Correct 464 ms 53392 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 2 ms 340 KB Output is correct
5 Correct 22 ms 2404 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 546 ms 54232 KB Output is correct
9 Correct 510 ms 50556 KB Output is correct
10 Correct 512 ms 50652 KB Output is correct
11 Correct 548 ms 54208 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 468 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 468 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 468 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 468 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 16 ms 2324 KB Output is correct
14 Correct 16 ms 2284 KB Output is correct
15 Correct 20 ms 2356 KB Output is correct
16 Correct 21 ms 2320 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 18 ms 2296 KB Output is correct
21 Correct 19 ms 2336 KB Output is correct
22 Correct 19 ms 2260 KB Output is correct
23 Correct 20 ms 2244 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 0 ms 340 KB Output is correct
6 Correct 1 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 18 ms 2352 KB Output is correct
12 Correct 392 ms 51376 KB Output is correct
13 Correct 1 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 1 ms 340 KB Output is correct
17 Correct 16 ms 2300 KB Output is correct
18 Correct 408 ms 52276 KB Output is correct
19 Correct 426 ms 52740 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 0 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 4 ms 724 KB Output is correct
25 Correct 14 ms 2004 KB Output is correct
26 Correct 15 ms 1968 KB Output is correct
27 Correct 464 ms 53392 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 2 ms 340 KB Output is correct
32 Correct 22 ms 2404 KB Output is correct
33 Correct 3 ms 596 KB Output is correct
34 Correct 5 ms 852 KB Output is correct
35 Correct 546 ms 54232 KB Output is correct
36 Correct 510 ms 50556 KB Output is correct
37 Correct 512 ms 50652 KB Output is correct
38 Correct 548 ms 54208 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 468 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 468 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 16 ms 2324 KB Output is correct
52 Correct 16 ms 2284 KB Output is correct
53 Correct 20 ms 2356 KB Output is correct
54 Correct 21 ms 2320 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 18 ms 2296 KB Output is correct
59 Correct 19 ms 2336 KB Output is correct
60 Correct 19 ms 2260 KB Output is correct
61 Correct 20 ms 2244 KB Output is correct
62 Correct 44 ms 6000 KB Output is correct
63 Correct 46 ms 5964 KB Output is correct
64 Correct 61 ms 6240 KB Output is correct
65 Correct 209 ms 23392 KB Output is correct
66 Correct 240 ms 23880 KB Output is correct
67 Correct 5 ms 852 KB Output is correct
68 Correct 3 ms 596 KB Output is correct
69 Correct 383 ms 51380 KB Output is correct
70 Correct 464 ms 52328 KB Output is correct
71 Correct 548 ms 54392 KB Output is correct
72 Correct 509 ms 52192 KB Output is correct
73 Correct 525 ms 52260 KB Output is correct
74 Correct 433 ms 50600 KB Output is correct
75 Correct 471 ms 50676 KB Output is correct