oj.uz

Submission #850682

# Submission time Handle Problem Language Result Execution time Memory
850682 2023-09-17T09:24:15 Z abcvuitunggio Carnival Tickets (IOI20_tickets) C++17
100 / 100
 607 ms 88260 KB 
#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
long long find_maximum(int k, vector <vector <int>> x) {
	int n=x.size(),m=x[0].size();
	int idx[n];
	long long res=0;
	vector <vector <int>> answer;
	vector <int> v[n];
	priority_queue <pair <int, int>> q;
	answer.resize(n);
	for (int i=0;i<n;i++){
        idx[i]=k;
        answer[i].resize(m,-1);
        for (int j=k-1;j>=0;j--){
            res-=x[i][j];
            v[i].push_back(x[i][m-j-1]+x[i][k-j-1]);
        }
        q.push({v[i].back(),i});
    }
    for (int i=0;i<n*k/2;i++){
        res+=q.top().first;
        idx[q.top().second]--;
        v[q.top().second].pop_back();
        q.push({v[q.top().second].back(),q.top().second});
        q.pop();
    }
    vector <pair <int, int>> ve;
    for (int i=0;i<k;i++){
        ve.clear();
        for (int j=0;j<n;j++)
            ve.push_back({idx[j],j});
        sort(ve.begin(),ve.end());
        for (int j=0;j<n/2;j++){
            x[ve[j].second].pop_back();
            answer[ve[j].second][x[ve[j].second].size()]=i;
        }
        for (int j=n/2;j<n;j++){
            idx[ve[j].second]--;
            answer[ve[j].second][idx[ve[j].second]]=i;
        }
    }
	allocate_tickets(answer);
	return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 856 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 428 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 16 ms 2512 KB Output is correct
6 Correct 402 ms 51484 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 17 ms 2648 KB Output is correct
6 Correct 417 ms 58604 KB Output is correct
7 Correct 441 ms 58960 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 5 ms 856 KB Output is correct
13 Correct 15 ms 2392 KB Output is correct
14 Correct 15 ms 2432 KB Output is correct
15 Correct 466 ms 65540 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 22 ms 3152 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 5 ms 1112 KB Output is correct
8 Correct 549 ms 66368 KB Output is correct
9 Correct 556 ms 62820 KB Output is correct
10 Correct 549 ms 62144 KB Output is correct
11 Correct 607 ms 66660 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 600 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 16 ms 2392 KB Output is correct
14 Correct 17 ms 2396 KB Output is correct
15 Correct 19 ms 2828 KB Output is correct
16 Correct 21 ms 3152 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 19 ms 2648 KB Output is correct
21 Correct 21 ms 2648 KB Output is correct
22 Correct 21 ms 2908 KB Output is correct
23 Correct 22 ms 2904 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 428 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 16 ms 2512 KB Output is correct
12 Correct 402 ms 51484 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 17 ms 2648 KB Output is correct
18 Correct 417 ms 58604 KB Output is correct
19 Correct 441 ms 58960 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 5 ms 856 KB Output is correct
25 Correct 15 ms 2392 KB Output is correct
26 Correct 15 ms 2432 KB Output is correct
27 Correct 466 ms 65540 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 22 ms 3152 KB Output is correct
33 Correct 4 ms 860 KB Output is correct
34 Correct 5 ms 1112 KB Output is correct
35 Correct 549 ms 66368 KB Output is correct
36 Correct 556 ms 62820 KB Output is correct
37 Correct 549 ms 62144 KB Output is correct
38 Correct 607 ms 66660 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 2 ms 344 KB Output is correct
43 Correct 2 ms 600 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 2 ms 600 KB Output is correct
48 Correct 2 ms 600 KB Output is correct
49 Correct 2 ms 600 KB Output is correct
50 Correct 2 ms 600 KB Output is correct
51 Correct 16 ms 2392 KB Output is correct
52 Correct 17 ms 2396 KB Output is correct
53 Correct 19 ms 2828 KB Output is correct
54 Correct 21 ms 3152 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 2 ms 604 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 19 ms 2648 KB Output is correct
59 Correct 21 ms 2648 KB Output is correct
60 Correct 21 ms 2908 KB Output is correct
61 Correct 22 ms 2904 KB Output is correct
62 Correct 46 ms 8348 KB Output is correct
63 Correct 45 ms 8528 KB Output is correct
64 Correct 62 ms 9660 KB Output is correct
65 Correct 207 ms 35152 KB Output is correct
66 Correct 248 ms 37684 KB Output is correct
67 Correct 5 ms 1112 KB Output is correct
68 Correct 4 ms 988 KB Output is correct
69 Correct 404 ms 73244 KB Output is correct
70 Correct 479 ms 80348 KB Output is correct
71 Correct 580 ms 88260 KB Output is correct
72 Correct 511 ms 72712 KB Output is correct
73 Correct 560 ms 85328 KB Output is correct
74 Correct 442 ms 65104 KB Output is correct
75 Correct 495 ms 77676 KB Output is correct