Submission #479000

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
479000	2021-10-09T10:56:47 Z	khoabright	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	868 ms	76664 KB

tickets

#include <bits/stdc++.h>
using namespace std;

//#define int long long 
#define ff first
#define ss second
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define rep1(i, a, b) for (int i = (int)a; i >= (int)b; --i)
#define mp make_pair
#define vii vector<vector<int>>
#define ll long long 

void allocate_tickets(vii a);

struct ticket{
    int color, order, value;
};

bool operator < (const ticket &x, const ticket &y) {
    if (x.value == y.value) {
        return mp(x.color, x.order) < mp(y.color, y.order);
    }
    return x.value < y.value;
}  

ll find_maximum(int k, vii a) {
    int n = a.size(), m = a[0].size();
    vii allo(n, vector<int> (m));
    
    ll prize = 0;
    vector<ticket> Replace;
    vector<int> Plus(n + 1, k);

    rep(i, 0, n - 1) {
        rep1(j, m - 1, m - k) {
            prize += a[i][j];
            allo[i][j] = 1;
        }

        rep(j, 0, k - 1) {
            ticket tmp;
            tmp.color = i;
            tmp.order = j;
            tmp.value = a[i][j] + a[i][m - k + j];
            Replace.push_back(tmp);
        }
    }

    sort(all(Replace));
    
    rep(i, 1, k * (n / 2)) {
        auto [color, order, value] = Replace[i - 1];
        prize -= value;

        --Plus[color];            
        allo[color][m - k + order] = 0;
        allo[color][order] = -1;
    }

    vector<int> v(n);
    rep(i, 0, n - 1) v[i] = i;

    sort(all(v), [&](int x, int y) {
        return Plus[x] < Plus[y];
    });

    int start = -1;
    rep(ii, 0, n - 1) {
        int i = v[ii];

        vector<bool> used(m);

        rep(j, 0, m - 1) {
            if (allo[i][j] != -1) break;
            start = (start + 1) % k;
            allo[i][j] = start + 1;
            used[start] = 1;
        }

        int fin = 0;
        rep1(j, m - 1, 0) {
            if (allo[i][j] != 1) break;
            while (fin < k && used[fin]) ++ fin;
            if (fin >= k) break;
            allo[i][j] = fin + 1;
            ++fin;
        }
    }
    

    rep(i, 0, n - 1) rep(j, 0, m - 1) --allo[i][j];

    allocate_tickets(allo);
    return prize;
}

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	368 KB	Output is correct
6	Correct	2 ms	716 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct
5	Correct	25 ms	2392 KB	Output is correct
6	Correct	549 ms	51356 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	288 KB	Output is correct
4	Correct	2 ms	460 KB	Output is correct
5	Correct	23 ms	2756 KB	Output is correct
6	Correct	613 ms	58164 KB	Output is correct
7	Correct	602 ms	62584 KB	Output is correct
8	Correct	3 ms	716 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	7 ms	884 KB	Output is correct
13	Correct	21 ms	2456 KB	Output is correct
14	Correct	20 ms	2600 KB	Output is correct
15	Correct	660 ms	66108 KB	Output is correct

Subtask #4
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	3 ms	588 KB	Output is correct
5	Correct	35 ms	3304 KB	Output is correct
6	Correct	5 ms	844 KB	Output is correct
7	Correct	7 ms	1036 KB	Output is correct
8	Correct	834 ms	76644 KB	Output is correct
9	Correct	768 ms	74948 KB	Output is correct
10	Correct	808 ms	74924 KB	Output is correct
11	Correct	839 ms	76664 KB	Output is correct

Subtask #5
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	2 ms	460 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	2 ms	428 KB	Output is correct
5	Correct	3 ms	460 KB	Output is correct
6	Correct	3 ms	584 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	3 ms	460 KB	Output is correct
10	Correct	2 ms	460 KB	Output is correct
11	Correct	3 ms	460 KB	Output is correct
12	Correct	3 ms	588 KB	Output is correct

Subtask #6
23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	2 ms	460 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	2 ms	428 KB	Output is correct
5	Correct	3 ms	460 KB	Output is correct
6	Correct	3 ms	584 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	3 ms	460 KB	Output is correct
10	Correct	2 ms	460 KB	Output is correct
11	Correct	3 ms	460 KB	Output is correct
12	Correct	3 ms	588 KB	Output is correct
13	Correct	27 ms	2484 KB	Output is correct
14	Correct	22 ms	2508 KB	Output is correct
15	Correct	28 ms	2756 KB	Output is correct
16	Correct	32 ms	3268 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	3 ms	460 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	26 ms	2868 KB	Output is correct
21	Correct	30 ms	2872 KB	Output is correct
22	Correct	29 ms	3140 KB	Output is correct
23	Correct	33 ms	3196 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	368 KB	Output is correct
6	Correct	2 ms	716 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	25 ms	2392 KB	Output is correct
12	Correct	549 ms	51356 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	288 KB	Output is correct
16	Correct	2 ms	460 KB	Output is correct
17	Correct	23 ms	2756 KB	Output is correct
18	Correct	613 ms	58164 KB	Output is correct
19	Correct	602 ms	62584 KB	Output is correct
20	Correct	3 ms	716 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	7 ms	884 KB	Output is correct
25	Correct	21 ms	2456 KB	Output is correct
26	Correct	20 ms	2600 KB	Output is correct
27	Correct	660 ms	66108 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	3 ms	588 KB	Output is correct
32	Correct	35 ms	3304 KB	Output is correct
33	Correct	5 ms	844 KB	Output is correct
34	Correct	7 ms	1036 KB	Output is correct
35	Correct	834 ms	76644 KB	Output is correct
36	Correct	768 ms	74948 KB	Output is correct
37	Correct	808 ms	74924 KB	Output is correct
38	Correct	839 ms	76664 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	2 ms	460 KB	Output is correct
41	Correct	2 ms	460 KB	Output is correct
42	Correct	2 ms	428 KB	Output is correct
43	Correct	3 ms	460 KB	Output is correct
44	Correct	3 ms	584 KB	Output is correct
45	Correct	1 ms	204 KB	Output is correct
46	Correct	1 ms	332 KB	Output is correct
47	Correct	3 ms	460 KB	Output is correct
48	Correct	2 ms	460 KB	Output is correct
49	Correct	3 ms	460 KB	Output is correct
50	Correct	3 ms	588 KB	Output is correct
51	Correct	27 ms	2484 KB	Output is correct
52	Correct	22 ms	2508 KB	Output is correct
53	Correct	28 ms	2756 KB	Output is correct
54	Correct	32 ms	3268 KB	Output is correct
55	Correct	1 ms	332 KB	Output is correct
56	Correct	3 ms	460 KB	Output is correct
57	Correct	1 ms	332 KB	Output is correct
58	Correct	26 ms	2868 KB	Output is correct
59	Correct	30 ms	2872 KB	Output is correct
60	Correct	29 ms	3140 KB	Output is correct
61	Correct	33 ms	3196 KB	Output is correct
62	Correct	63 ms	6268 KB	Output is correct
63	Correct	63 ms	6324 KB	Output is correct
64	Correct	91 ms	8404 KB	Output is correct
65	Correct	312 ms	26328 KB	Output is correct
66	Correct	380 ms	32148 KB	Output is correct
67	Correct	6 ms	1012 KB	Output is correct
68	Correct	5 ms	844 KB	Output is correct
69	Correct	572 ms	51696 KB	Output is correct
70	Correct	664 ms	58032 KB	Output is correct
71	Correct	868 ms	76444 KB	Output is correct
72	Correct	794 ms	75516 KB	Output is correct
73	Correct	794 ms	66936 KB	Output is correct
74	Correct	614 ms	57172 KB	Output is correct
75	Correct	662 ms	56644 KB	Output is correct

Submission #479000

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 16.0 / 16.0

Subtask #3 14.0 / 14.0

Subtask #4 14.0 / 14.0

Subtask #5 12.0 / 12.0

Subtask #6 23.0 / 23.0

Subtask #7 10.0 / 10.0

Subtask #1
11.0 / 11.0

Subtask #2
16.0 / 16.0

Subtask #3
14.0 / 14.0

Subtask #4
14.0 / 14.0

Subtask #5
12.0 / 12.0

Subtask #6
23.0 / 23.0

Subtask #7
10.0 / 10.0