Submission #423861

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
423861	2021-06-11T13:23:09 Z	humbertoyusta	Carnival Tickets (IOI20_tickets)	C++14	100 / 100	1143 ms	114616 KB

tickets

#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define all(x) x.begin() , x.end()
typedef long long ll;
typedef pair<int,int> ii;

vector<int> vx[1505][2];

long long find_maximum(int k, std::vector<std::vector<int>> x) {

	int n = x.size();
	int m = x[0].size();

	std::vector<std::vector<int>> answer, fans;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		for (int j = 0; j < m; j++) {
            row[j] = -1;
		}
		answer.push_back(row);
		fans.pb(row);
	}

	ll res = 0;

	vector<vector<ii>> mat;
	for(int i=0; i<n; i++){
        vector<ii> row(m);
        for(int j=0; j<m; j++){
            row[j] = { x[i][j] , j };
        }
        sort(all(row));
        mat.pb(row);
	}

	for(int i=0; i<n; i++){
        for(int j=0; j<k; j++){
            res -= mat[i][j].f;
            fans[i][j] = 0;
        }
	}

	priority_queue<pair<int,ii>> q;

	for(int i=0; i<n; i++){
        q.push({mat[i][k-1].f + mat[i][m-1].f,{i,-1}});
	}

	for(int t=0; t<n*k/2; t++){

        pair<ll,ii> p = q.top();
        res += p.f;

        q.pop();

        fans[p.s.f][m+p.s.s] = 1;
        if( m != k ) fans[p.s.f][k+p.s.s] = -1;

        if( abs(p.s.s - 1) <= k ){
            p.s.s--;
            q.push({mat[p.s.f][k+p.s.s].f+mat[p.s.f][m+p.s.s].f,{p.s.f,p.s.s}});
        }
	}

    for(int i=0; i<n; i++){
        for(int j=0; j<m; j++){
            if( fans[i][j] == 0 ) vx[i][0].pb(j);
            if( fans[i][j] == 1 ) vx[i][1].pb(j);
        }
    }

    for(int t=0; t<k; t++){
        int cmn = n / 2, cmx = n / 2;
        vector<int> mk(n);
        for(int i=0; i<n; i++){
            if( vx[i][1].empty() ){
                mk[i] = 1;
                cmn --;
                answer[i][mat[i][vx[i][0].back()].s] = t;
                vx[i][0].pop_back();
                continue;
            }
            if( vx[i][0].empty() ){
                mk[i] = 1;
                answer[i][mat[i][vx[i][1].back()].s] = t;
                vx[i][1].pop_back();
                cmx --;
                continue;
            }
        }
        for(int i=0; i<n; i++){
            if( mk[i] ) continue;
            if( cmn > 0 ){
                cmn --;
                answer[i][mat[i][vx[i][0].back()].s] = t;
                vx[i][0].pop_back();
                continue;
            }
            if( cmx > 0 ){
                answer[i][mat[i][vx[i][1].back()].s] = t;
                vx[i][1].pop_back();
                cmx --;
                continue;
            }
        }
    }

	allocate_tickets(answer);
	return res;
}

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	2 ms	1020 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	3 ms	672 KB	Output is correct
5	Correct	50 ms	3644 KB	Output is correct
6	Correct	800 ms	78092 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	2 ms	588 KB	Output is correct
5	Correct	28 ms	3964 KB	Output is correct
6	Correct	760 ms	89392 KB	Output is correct
7	Correct	853 ms	92808 KB	Output is correct
8	Correct	4 ms	716 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	7 ms	1228 KB	Output is correct
13	Correct	24 ms	3480 KB	Output is correct
14	Correct	23 ms	3432 KB	Output is correct
15	Correct	926 ms	94436 KB	Output is correct

Subtask #4
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	5 ms	588 KB	Output is correct
5	Correct	37 ms	4312 KB	Output is correct
6	Correct	6 ms	1100 KB	Output is correct
7	Correct	8 ms	1416 KB	Output is correct
8	Correct	1143 ms	93220 KB	Output is correct
9	Correct	1058 ms	87680 KB	Output is correct
10	Correct	1048 ms	86980 KB	Output is correct
11	Correct	1111 ms	93132 KB	Output is correct

Subtask #5
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	3 ms	588 KB	Output is correct
3	Correct	3 ms	588 KB	Output is correct
4	Correct	3 ms	588 KB	Output is correct
5	Correct	3 ms	636 KB	Output is correct
6	Correct	3 ms	632 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	3 ms	588 KB	Output is correct
10	Correct	3 ms	632 KB	Output is correct
11	Correct	3 ms	588 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	332 KB	Output is correct
2	Correct	3 ms	588 KB	Output is correct
3	Correct	3 ms	588 KB	Output is correct
4	Correct	3 ms	588 KB	Output is correct
5	Correct	3 ms	636 KB	Output is correct
6	Correct	3 ms	632 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	3 ms	588 KB	Output is correct
10	Correct	3 ms	632 KB	Output is correct
11	Correct	3 ms	588 KB	Output is correct
12	Correct	3 ms	588 KB	Output is correct
13	Correct	31 ms	4372 KB	Output is correct
14	Correct	29 ms	4324 KB	Output is correct
15	Correct	32 ms	4708 KB	Output is correct
16	Correct	36 ms	5060 KB	Output is correct
17	Correct	1 ms	460 KB	Output is correct
18	Correct	4 ms	716 KB	Output is correct
19	Correct	2 ms	460 KB	Output is correct
20	Correct	30 ms	4092 KB	Output is correct
21	Correct	32 ms	4592 KB	Output is correct
22	Correct	32 ms	4292 KB	Output is correct
23	Correct	35 ms	4692 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	2 ms	1020 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	3 ms	672 KB	Output is correct
11	Correct	50 ms	3644 KB	Output is correct
12	Correct	800 ms	78092 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	2 ms	588 KB	Output is correct
17	Correct	28 ms	3964 KB	Output is correct
18	Correct	760 ms	89392 KB	Output is correct
19	Correct	853 ms	92808 KB	Output is correct
20	Correct	4 ms	716 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	7 ms	1228 KB	Output is correct
25	Correct	24 ms	3480 KB	Output is correct
26	Correct	23 ms	3432 KB	Output is correct
27	Correct	926 ms	94436 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	5 ms	588 KB	Output is correct
32	Correct	37 ms	4312 KB	Output is correct
33	Correct	6 ms	1100 KB	Output is correct
34	Correct	8 ms	1416 KB	Output is correct
35	Correct	1143 ms	93220 KB	Output is correct
36	Correct	1058 ms	87680 KB	Output is correct
37	Correct	1048 ms	86980 KB	Output is correct
38	Correct	1111 ms	93132 KB	Output is correct
39	Correct	1 ms	332 KB	Output is correct
40	Correct	3 ms	588 KB	Output is correct
41	Correct	3 ms	588 KB	Output is correct
42	Correct	3 ms	588 KB	Output is correct
43	Correct	3 ms	636 KB	Output is correct
44	Correct	3 ms	632 KB	Output is correct
45	Correct	1 ms	332 KB	Output is correct
46	Correct	1 ms	332 KB	Output is correct
47	Correct	3 ms	588 KB	Output is correct
48	Correct	3 ms	632 KB	Output is correct
49	Correct	3 ms	588 KB	Output is correct
50	Correct	3 ms	588 KB	Output is correct
51	Correct	31 ms	4372 KB	Output is correct
52	Correct	29 ms	4324 KB	Output is correct
53	Correct	32 ms	4708 KB	Output is correct
54	Correct	36 ms	5060 KB	Output is correct
55	Correct	1 ms	460 KB	Output is correct
56	Correct	4 ms	716 KB	Output is correct
57	Correct	2 ms	460 KB	Output is correct
58	Correct	30 ms	4092 KB	Output is correct
59	Correct	32 ms	4592 KB	Output is correct
60	Correct	32 ms	4292 KB	Output is correct
61	Correct	35 ms	4692 KB	Output is correct
62	Correct	76 ms	11432 KB	Output is correct
63	Correct	83 ms	11508 KB	Output is correct
64	Correct	106 ms	12992 KB	Output is correct
65	Correct	396 ms	47540 KB	Output is correct
66	Correct	453 ms	50316 KB	Output is correct
67	Correct	8 ms	1484 KB	Output is correct
68	Correct	6 ms	1100 KB	Output is correct
69	Correct	687 ms	100104 KB	Output is correct
70	Correct	892 ms	106724 KB	Output is correct
71	Correct	1046 ms	114616 KB	Output is correct
72	Correct	952 ms	98224 KB	Output is correct
73	Correct	1022 ms	110656 KB	Output is correct
74	Correct	762 ms	90868 KB	Output is correct
75	Correct	868 ms	103620 KB	Output is correct

Submission #423861

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