oj.uz

Submission #308071

# Submission time Handle Problem Language Result Execution time Memory
308071 2020-09-30T02:42:19 Z jwvg0425 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1069 ms 95728 KB 
#include "tickets.h"
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;

template<typename T, typename Pr = less<T>>
using pq = priority_queue<T, vector<T>, Pr>;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;

vector<ii64> ts[1505];
ii trace[1505];

i64 find_maximum(int k, vector<vector<int>> x)
{
    int n = x.size();
    int m = x[0].size();

    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            ts[i].emplace_back(x[i][j], j);

    vector<vector<int>> ans(n, vector<int>(m, -1));

    i64 ret = 0;
    pq<ii64, greater<ii64>> q;

    for (int color = 0; color < n; color++)
    {
        sort(all(ts[color]));

        for (int i = m - 1; i >= m - k; i--)
            ret += ts[color][i].xx;

        trace[color] = ii(0, k);
        q.emplace(ts[color][m - k].xx + ts[color][0].xx, color);
    }

    for (int i = 0; i < k * n / 2; i++)
    {
        auto [val, c] = q.top();
        q.pop();
        ret -= val;
        trace[c].xx++;
        trace[c].yy--;

        if (trace[c].xx < k)
            q.emplace(ts[c][trace[c].xx].xx + ts[c][m - trace[c].yy].xx, c);
    }

    int gidx = 0;
    for (int color = 0; color < n; color++)
    {
        for (int i = 0; i < trace[color].xx; i++)
        {
            ans[color][ts[color][i].yy] = gidx;
            gidx = (gidx + 1) % k;
        }

        int lgi = gidx;

        for (int i = 0; i < trace[color].yy; i++)
        {
            ans[color][ts[color][m - 1 - i].yy] = lgi;
            lgi = (lgi + 1) % k;
        }
    }

    allocate_tickets(ans);

    return ret;
}

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 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 41 ms 4988 KB Output is correct
6 Correct 868 ms 92704 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 384 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 28 ms 4856 KB Output is correct
6 Correct 718 ms 93808 KB Output is correct
7 Correct 706 ms 94108 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 8 ms 1536 KB Output is correct
13 Correct 24 ms 4096 KB Output is correct
14 Correct 23 ms 3320 KB Output is correct
15 Correct 710 ms 94692 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 384 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 40 ms 4856 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 10 ms 1280 KB Output is correct
8 Correct 993 ms 95608 KB Output is correct
9 Correct 928 ms 89720 KB Output is correct
10 Correct 902 ms 89336 KB Output is correct
11 Correct 995 ms 95728 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 640 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 4 ms 640 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 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 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 640 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 4 ms 640 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 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 35 ms 4856 KB Output is correct
14 Correct 36 ms 4856 KB Output is correct
15 Correct 39 ms 4856 KB Output is correct
16 Correct 41 ms 4856 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 34 ms 4856 KB Output is correct
21 Correct 38 ms 4736 KB Output is correct
22 Correct 33 ms 4896 KB Output is correct
23 Correct 37 ms 4728 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 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 41 ms 4988 KB Output is correct
12 Correct 868 ms 92704 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 384 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 28 ms 4856 KB Output is correct
18 Correct 718 ms 93808 KB Output is correct
19 Correct 706 ms 94108 KB Output is correct
20 Correct 5 ms 768 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 1 ms 288 KB Output is correct
24 Correct 8 ms 1536 KB Output is correct
25 Correct 24 ms 4096 KB Output is correct
26 Correct 23 ms 3320 KB Output is correct
27 Correct 710 ms 94692 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 384 KB Output is correct
31 Correct 3 ms 640 KB Output is correct
32 Correct 40 ms 4856 KB Output is correct
33 Correct 7 ms 1024 KB Output is correct
34 Correct 10 ms 1280 KB Output is correct
35 Correct 993 ms 95608 KB Output is correct
36 Correct 928 ms 89720 KB Output is correct
37 Correct 902 ms 89336 KB Output is correct
38 Correct 995 ms 95728 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 3 ms 640 KB Output is correct
41 Correct 3 ms 640 KB Output is correct
42 Correct 3 ms 640 KB Output is correct
43 Correct 3 ms 640 KB Output is correct
44 Correct 4 ms 640 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 640 KB Output is correct
48 Correct 3 ms 640 KB Output is correct
49 Correct 3 ms 640 KB Output is correct
50 Correct 3 ms 640 KB Output is correct
51 Correct 35 ms 4856 KB Output is correct
52 Correct 36 ms 4856 KB Output is correct
53 Correct 39 ms 4856 KB Output is correct
54 Correct 41 ms 4856 KB Output is correct
55 Correct 2 ms 512 KB Output is correct
56 Correct 3 ms 640 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 34 ms 4856 KB Output is correct
59 Correct 38 ms 4736 KB Output is correct
60 Correct 33 ms 4896 KB Output is correct
61 Correct 37 ms 4728 KB Output is correct
62 Correct 94 ms 10104 KB Output is correct
63 Correct 93 ms 10108 KB Output is correct
64 Correct 106 ms 10360 KB Output is correct
65 Correct 432 ms 39556 KB Output is correct
66 Correct 429 ms 40184 KB Output is correct
67 Correct 8 ms 1280 KB Output is correct
68 Correct 6 ms 1024 KB Output is correct
69 Correct 828 ms 92692 KB Output is correct
70 Correct 911 ms 93772 KB Output is correct
71 Correct 992 ms 95516 KB Output is correct
72 Correct 794 ms 92380 KB Output is correct
73 Correct 987 ms 92152 KB Output is correct
74 Correct 731 ms 91000 KB Output is correct
75 Correct 1069 ms 90616 KB Output is correct