oj.uz

Submission #800136

# Submission time Handle Problem Language Result Execution time Memory
800136 2023-08-01T10:48:37 Z LittleCube Carnival Tickets (IOI20_tickets) C++17
100 / 100
 560 ms 88276 KB 
    #include "tickets.h"
    #include <bits/stdc++.h>
    #define pii pair<int, int>
    #define F first
    #define S second
    #define ll long long
    using namespace std;
     
    int pcnt[1500];
    vector<int> pos[1500], neg[1500];
     
    ll find_maximum(int k, vector<vector<int>> x)
    {
    	int n = x.size();
    	int m = x[0].size();
    	vector<vector<pii>> a;
    	vector<vector<int>> answer;
    	a.resize(n), answer.resize(n);
    	priority_queue<pii> pq;
    	ll ans = 0;
    	for (int i = 0; i < n; i++)
    	{
    		for (int j = 0; j < k; j++)
    			ans -= x[i][j];
    		pq.push(pii(x[i][m - 1] + x[i][k - 1], i));
    	}
    	for (int t = 1; t <= n / 2 * k; t++)
    	{
    		auto [val, i] = pq.top();
    		pq.pop();
    		ans += val;
    		pcnt[i]++;
    		if (pcnt[i] < k)
    			pq.push(pii(x[i][m - 1 - pcnt[i]] + x[i][k - 1 - pcnt[i]], i));
    	}
    	for (int i = 0; i < n; i++)
    	{
    		for (int j = 0; j < k - pcnt[i]; j++)
    			neg[i].emplace_back(j);
    		for (int j = 0; j < pcnt[i]; j++)
    			pos[i].emplace_back(m - j - 1);
    	}
    	for (int i = 0; i < n; i++)
    		answer[i].resize(m, -1);
     
    	for (int i = 0; i < k; i++)
    	{
    		vector<int> vis(n, 0);
    		int l = n / 2, r = n / 2;
    		for (int j = 0; j < n; j++)
    			if (pos[j].empty())
    			{
    				r--;
    				answer[j][neg[j].back()] = i;
    				neg[j].pop_back();
    				vis[j] = 1;
    			}
    			else if (neg[j].empty())
    			{
    				l--;
    				answer[j][pos[j].back()] = i;
    				pos[j].pop_back();
    				vis[j] = 1;
    			}
    		for (int j = 0; j < n; j++)
    			if (!vis[j])
    			{
    				if (l)
    				{
    					l--;
    					answer[j][pos[j].back()] = i;
    					pos[j].pop_back();
    				}
    				else
    				{
    					r--;
    					answer[j][neg[j].back()] = i;
    					neg[j].pop_back();
    				}
    			}
    	}
    	allocate_tickets(answer);
    	return ans;
    }

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 852 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 17 ms 2392 KB Output is correct
6 Correct 402 ms 51508 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 16 ms 2676 KB Output is correct
6 Correct 405 ms 58692 KB Output is correct
7 Correct 419 ms 61848 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 4 ms 980 KB Output is correct
13 Correct 14 ms 2396 KB Output is correct
14 Correct 14 ms 2408 KB Output is correct
15 Correct 435 ms 63692 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 20 ms 3024 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 5 ms 1108 KB Output is correct
8 Correct 551 ms 66368 KB Output is correct
9 Correct 524 ms 83000 KB Output is correct
10 Correct 521 ms 82316 KB Output is correct
11 Correct 560 ms 88276 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 544 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 544 KB Output is correct
13 Correct 16 ms 2416 KB Output is correct
14 Correct 17 ms 2412 KB Output is correct
15 Correct 18 ms 2776 KB Output is correct
16 Correct 23 ms 3156 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 17 ms 2644 KB Output is correct
21 Correct 18 ms 2644 KB Output is correct
22 Correct 18 ms 2900 KB Output is correct
23 Correct 19 ms 2784 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 17 ms 2392 KB Output is correct
12 Correct 402 ms 51508 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 16 ms 2676 KB Output is correct
18 Correct 405 ms 58692 KB Output is correct
19 Correct 419 ms 61848 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 4 ms 980 KB Output is correct
25 Correct 14 ms 2396 KB Output is correct
26 Correct 14 ms 2408 KB Output is correct
27 Correct 435 ms 63692 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 20 ms 3024 KB Output is correct
33 Correct 4 ms 724 KB Output is correct
34 Correct 5 ms 1108 KB Output is correct
35 Correct 551 ms 66368 KB Output is correct
36 Correct 524 ms 83000 KB Output is correct
37 Correct 521 ms 82316 KB Output is correct
38 Correct 560 ms 88276 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 504 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 544 KB Output is correct
51 Correct 16 ms 2416 KB Output is correct
52 Correct 17 ms 2412 KB Output is correct
53 Correct 18 ms 2776 KB Output is correct
54 Correct 23 ms 3156 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 17 ms 2644 KB Output is correct
59 Correct 18 ms 2644 KB Output is correct
60 Correct 18 ms 2900 KB Output is correct
61 Correct 19 ms 2784 KB Output is correct
62 Correct 46 ms 8476 KB Output is correct
63 Correct 47 ms 8528 KB Output is correct
64 Correct 57 ms 9932 KB Output is correct
65 Correct 206 ms 35704 KB Output is correct
66 Correct 235 ms 38544 KB Output is correct
67 Correct 5 ms 1236 KB Output is correct
68 Correct 4 ms 852 KB Output is correct
69 Correct 412 ms 73360 KB Output is correct
70 Correct 477 ms 80332 KB Output is correct
71 Correct 558 ms 88060 KB Output is correct
72 Correct 470 ms 72652 KB Output is correct
73 Correct 533 ms 85036 KB Output is correct
74 Correct 411 ms 65256 KB Output is correct
75 Correct 466 ms 77824 KB Output is correct