oj.uz

Submission #315601

# Submission time Handle Problem Language Result Execution time Memory
315601 2020-10-23T10:21:48 Z VEGAnn Carnival Tickets (IOI20_tickets) C++14
100 / 100
 894 ms 60540 KB 
#include "tickets.h"
#include <bits/stdc++.h>
#define PB push_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define i2 array<int,2>
using namespace std;
typedef long long ll;
const int N = 1600;
const ll OO = 1e18;
priority_queue<i2> pq;
int ptr[N];

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();

	vector<vector<int>> answer;

	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);

		fill(all(row), -1);

		answer.push_back(row);
	}

	ll ans = 0;

    for (int i = 0; i < n; i++){
        for (int j = 0; j < k; j++)
            ans += x[i][m - k + j];

        ptr[i] = 0;

        pq.push({-x[i][m - k] - x[i][0], i});
    }

    // add again to pq only if ptr < m

    for (int itr = (n / 2) * k; itr > 0; itr--){
        i2 now = pq.top(); pq.pop();

        ans += now[0];
        int id = now[1];

        ptr[id]++;

        if (ptr[id] < k){
            pq.push({-x[id][m - k + ptr[id]] - x[id][ptr[id]], id});
        }
    }

    // add last tickets

    for (int i = 0, g1 = 0; i < n; i++){
        int now = 0;

        for (int j = 0; j < ptr[i]; j++){
            answer[i][j] = g1;
            g1++;
            if (g1 == k) g1 = 0;
        }

        for (int j = ptr[i], now = g1; j < k; j++){
            answer[i][m - k + j] = now;
            now++;
            if (now == k) now = 0;
        }
    }

    allocate_tickets(answer);

	return ans;
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:57:13: warning: unused variable 'now' [-Wunused-variable]
   57 |         int now = 0;
      |             ^~~

Subtask #1
11.0 / 11.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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 30 ms 2432 KB Output is correct
6 Correct 723 ms 51600 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 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 25 ms 2424 KB Output is correct
6 Correct 578 ms 52572 KB Output is correct
7 Correct 599 ms 52856 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 20 ms 2048 KB Output is correct
14 Correct 20 ms 2048 KB Output is correct
15 Correct 613 ms 53368 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 3 ms 512 KB Output is correct
5 Correct 35 ms 2424 KB Output is correct
6 Correct 8 ms 640 KB Output is correct
7 Correct 7 ms 896 KB Output is correct
8 Correct 894 ms 54264 KB Output is correct
9 Correct 808 ms 50888 KB Output is correct
10 Correct 802 ms 50808 KB Output is correct
11 Correct 855 ms 54392 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 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 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 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 30 ms 2376 KB Output is correct
14 Correct 30 ms 2424 KB Output is correct
15 Correct 32 ms 2424 KB Output is correct
16 Correct 36 ms 2552 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 28 ms 2424 KB Output is correct
21 Correct 31 ms 2432 KB Output is correct
22 Correct 28 ms 2432 KB Output is correct
23 Correct 34 ms 2464 KB Output is correct

Subtask #7
10.0 / 10.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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 30 ms 2432 KB Output is correct
12 Correct 723 ms 51600 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 25 ms 2424 KB Output is correct
18 Correct 578 ms 52572 KB Output is correct
19 Correct 599 ms 52856 KB Output is correct
20 Correct 3 ms 512 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 7 ms 896 KB Output is correct
25 Correct 20 ms 2048 KB Output is correct
26 Correct 20 ms 2048 KB Output is correct
27 Correct 613 ms 53368 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 3 ms 512 KB Output is correct
32 Correct 35 ms 2424 KB Output is correct
33 Correct 8 ms 640 KB Output is correct
34 Correct 7 ms 896 KB Output is correct
35 Correct 894 ms 54264 KB Output is correct
36 Correct 808 ms 50888 KB Output is correct
37 Correct 802 ms 50808 KB Output is correct
38 Correct 855 ms 54392 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 1 ms 256 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 2 ms 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 30 ms 2376 KB Output is correct
52 Correct 30 ms 2424 KB Output is correct
53 Correct 32 ms 2424 KB Output is correct
54 Correct 36 ms 2552 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 28 ms 2424 KB Output is correct
59 Correct 31 ms 2432 KB Output is correct
60 Correct 28 ms 2432 KB Output is correct
61 Correct 34 ms 2464 KB Output is correct
62 Correct 82 ms 6008 KB Output is correct
63 Correct 81 ms 6008 KB Output is correct
64 Correct 97 ms 6308 KB Output is correct
65 Correct 362 ms 23544 KB Output is correct
66 Correct 387 ms 23928 KB Output is correct
67 Correct 8 ms 896 KB Output is correct
68 Correct 6 ms 640 KB Output is correct
69 Correct 731 ms 57848 KB Output is correct
70 Correct 800 ms 54268 KB Output is correct
71 Correct 881 ms 56056 KB Output is correct
72 Correct 700 ms 60540 KB Output is correct
73 Correct 815 ms 57336 KB Output is correct
74 Correct 624 ms 50684 KB Output is correct
75 Correct 763 ms 50852 KB Output is correct