Submission #301223

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
301223	2020-09-17T18:10:39 Z	IgorI	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	1434 ms	109712 KB

tickets

#include <bits/stdc++.h>
#include "tickets.h"

using namespace std;

void allocate_tickets(vector<vector<int> > ans) ;

vector<vector<int> > solve01(int k, vector<vector<int> > x)
{
    int n = x.size(), m = x[0].size();
    long long res = 0;
    vector<vector<int> > ans(n, vector<int>(m, -1));
    vector<pair<int, int> > z;
    vector<int> fr(n), to(n, m - 1);
    for (int i = 0; i < n; i++)
    {
        int cnt = 0;
        for (int j = 0; j < m; j++)
        {
            cnt += (x[i][j] == 0);
        }
        z.push_back({cnt, i});
    }
    for (int j = 0; j < k; j++)
    {
        sort(z.begin(), z.end());
        reverse(z.begin(), z.end());
        int cnt0 = 0, cnt1 = 0;
        for (int i = 0; i < n / 2; i++)
        {
            if (z[i].first > 0)
            {
                z[i].first--;
                ans[z[i].second][fr[z[i].second]] = j;
                fr[z[i].second]++;
                cnt0++;
            }
            else
            {
                ans[z[i].second][to[z[i].second]] = j;
                to[z[i].second]--;
                cnt1++;
            }
        }
        for (int i = n / 2; i < n; i++)
        {
            if (z[i].first < m - j)
            {
                ans[z[i].second][to[z[i].second]] = j;
                to[z[i].second]--;
                cnt1++;
            }
            else
            {
                z[i].first--;
                ans[z[i].second][fr[z[i].second]] = j;
                fr[z[i].second]++;
                cnt0++;
            }
        }
        res += min(cnt0, cnt1);
    }
    return ans;
}

long long find_maximum(int k, std::vector<std::vector<int>> x)
{
    int n = x.size(), m = x[0].size();
    vector<vector<int> > edit(n, vector<int>(m, -1));
    vector<pair<long long, pair<int, int> > > moo;
    long long res = 0;
    for (int e = 0; e < k; e++)
    {
        for (int i = 0; i < n; i++)
        {
            edit[i][e] = 0;
            res -= x[i][e];
            moo.push_back({x[i][e] + x[i][e + m - k], {i, e}});
        }
    }
    sort(moo.begin(), moo.end());
    reverse(moo.begin(), moo.end());
    for (int i = 0; i < n / 2 * k; i++)
    {
        res += moo[i].first;
        int a = moo[i].second.first;
        int b = moo[i].second.second;
        edit[a][b] = -1;
        edit[a][b + m - k] = 1;
    }
    vector<vector<int> > x2(n);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (edit[i][j] != -1)
                x2[i].push_back(edit[i][j]);
        }
    }
    vector<vector<int> > ans2 = solve01(k, x2);
    vector<vector<int> > ans(n, vector<int>(m, -1));
    for (int i = 0; i < n; i++)
    {
        int p = 0;
        for (int j = 0; j < m; j++)
        {
            if (edit[i][j] != -1)
            {
                ans[i][j] = ans2[i][p];
                p++;
            }
        }
    }
    allocate_tickets(ans);
    return res;
}

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	1 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	2 ms	1024 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	0 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	4 ms	548 KB	Output is correct
5	Correct	32 ms	2808 KB	Output is correct
6	Correct	822 ms	60616 KB	Output is correct

Subtask #3
14.0 / 14.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	640 KB	Output is correct
5	Correct	40 ms	3692 KB	Output is correct
6	Correct	985 ms	81576 KB	Output is correct
7	Correct	1146 ms	89016 KB	Output is correct
8	Correct	8 ms	768 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	9 ms	1276 KB	Output is correct
13	Correct	36 ms	3376 KB	Output is correct
14	Correct	31 ms	3580 KB	Output is correct
15	Correct	1183 ms	100860 KB	Output is correct

Subtask #4
14.0 / 14.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	4 ms	640 KB	Output is correct
5	Correct	56 ms	4840 KB	Output is correct
6	Correct	8 ms	1020 KB	Output is correct
7	Correct	13 ms	1404 KB	Output is correct
8	Correct	1434 ms	109708 KB	Output is correct
9	Correct	1256 ms	103240 KB	Output is correct
10	Correct	1326 ms	102556 KB	Output is correct
11	Correct	1338 ms	109704 KB	Output is correct

Subtask #5
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	3 ms	512 KB	Output is correct
3	Correct	4 ms	512 KB	Output is correct
4	Correct	4 ms	512 KB	Output is correct
5	Correct	3 ms	640 KB	Output is correct
6	Correct	3 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	4 ms	616 KB	Output is correct
10	Correct	4 ms	640 KB	Output is correct
11	Correct	4 ms	640 KB	Output is correct
12	Correct	5 ms	640 KB	Output is correct

Subtask #6
23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	3 ms	512 KB	Output is correct
3	Correct	4 ms	512 KB	Output is correct
4	Correct	4 ms	512 KB	Output is correct
5	Correct	3 ms	640 KB	Output is correct
6	Correct	3 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	4 ms	616 KB	Output is correct
10	Correct	4 ms	640 KB	Output is correct
11	Correct	4 ms	640 KB	Output is correct
12	Correct	5 ms	640 KB	Output is correct
13	Correct	32 ms	2836 KB	Output is correct
14	Correct	32 ms	2808 KB	Output is correct
15	Correct	46 ms	3692 KB	Output is correct
16	Correct	49 ms	4840 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	3 ms	640 KB	Output is correct
19	Correct	3 ms	512 KB	Output is correct
20	Correct	39 ms	3864 KB	Output is correct
21	Correct	41 ms	3828 KB	Output is correct
22	Correct	41 ms	4724 KB	Output is correct
23	Correct	46 ms	4584 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	1 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	2 ms	1024 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	4 ms	548 KB	Output is correct
11	Correct	32 ms	2808 KB	Output is correct
12	Correct	822 ms	60616 KB	Output is correct
13	Correct	1 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	3 ms	640 KB	Output is correct
17	Correct	40 ms	3692 KB	Output is correct
18	Correct	985 ms	81576 KB	Output is correct
19	Correct	1146 ms	89016 KB	Output is correct
20	Correct	8 ms	768 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	0 ms	256 KB	Output is correct
24	Correct	9 ms	1276 KB	Output is correct
25	Correct	36 ms	3376 KB	Output is correct
26	Correct	31 ms	3580 KB	Output is correct
27	Correct	1183 ms	100860 KB	Output is correct
28	Correct	1 ms	256 KB	Output is correct
29	Correct	1 ms	256 KB	Output is correct
30	Correct	1 ms	256 KB	Output is correct
31	Correct	4 ms	640 KB	Output is correct
32	Correct	56 ms	4840 KB	Output is correct
33	Correct	8 ms	1020 KB	Output is correct
34	Correct	13 ms	1404 KB	Output is correct
35	Correct	1434 ms	109708 KB	Output is correct
36	Correct	1256 ms	103240 KB	Output is correct
37	Correct	1326 ms	102556 KB	Output is correct
38	Correct	1338 ms	109704 KB	Output is correct
39	Correct	0 ms	256 KB	Output is correct
40	Correct	3 ms	512 KB	Output is correct
41	Correct	4 ms	512 KB	Output is correct
42	Correct	4 ms	512 KB	Output is correct
43	Correct	3 ms	640 KB	Output is correct
44	Correct	3 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	4 ms	616 KB	Output is correct
48	Correct	4 ms	640 KB	Output is correct
49	Correct	4 ms	640 KB	Output is correct
50	Correct	5 ms	640 KB	Output is correct
51	Correct	32 ms	2836 KB	Output is correct
52	Correct	32 ms	2808 KB	Output is correct
53	Correct	46 ms	3692 KB	Output is correct
54	Correct	49 ms	4840 KB	Output is correct
55	Correct	1 ms	384 KB	Output is correct
56	Correct	3 ms	640 KB	Output is correct
57	Correct	3 ms	512 KB	Output is correct
58	Correct	39 ms	3864 KB	Output is correct
59	Correct	41 ms	3828 KB	Output is correct
60	Correct	41 ms	4724 KB	Output is correct
61	Correct	46 ms	4584 KB	Output is correct
62	Correct	89 ms	7160 KB	Output is correct
63	Correct	89 ms	7168 KB	Output is correct
64	Correct	139 ms	12260 KB	Output is correct
65	Correct	648 ms	35924 KB	Output is correct
66	Correct	618 ms	47748 KB	Output is correct
67	Correct	10 ms	1404 KB	Output is correct
68	Correct	20 ms	1020 KB	Output is correct
69	Correct	845 ms	60636 KB	Output is correct
70	Correct	1081 ms	81576 KB	Output is correct
71	Correct	1387 ms	109712 KB	Output is correct
72	Correct	1223 ms	104912 KB	Output is correct
73	Correct	1275 ms	103224 KB	Output is correct
74	Correct	931 ms	81308 KB	Output is correct
75	Correct	1136 ms	80352 KB	Output is correct

Submission #301223

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