oj.uz

Submission #392914

# Submission time Handle Problem Language Result Execution time Memory
392914 2021-04-22T09:43:29 Z phathnv Carnival Tickets (IOI20_tickets) C++17
100 / 100
 926 ms 75884 KB 
#include <bits/stdc++.h>
#include "tickets.h"

using namespace std;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> answer(n, vector<int>(m, -1));
    vector<int> numMinus(n, k);
    priority_queue<pair<int, int>> pq;
    for(int i = 0; i < n; i++)
        pq.push({x[i][numMinus[i] - 1] + x[i][m - k + numMinus[i] - 1], i});
    for(int i = 0; i < k * n / 2; i++){
        int row = pq.top().second;
        pq.pop();
        numMinus[row]--;
        if (numMinus[row] > 0)
            pq.push({x[row][numMinus[row] - 1] + x[row][m - k + numMinus[row] - 1], row});
    }
    int plusPtr = 0, minusPtr = k - 1;
    long long total = 0;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < numMinus[i]; j++){
            answer[i][j] = minusPtr;
            minusPtr = (minusPtr == 0? k - 1 : minusPtr - 1);
            total -= x[i][j];
        }
        for(int j = m - k + numMinus[i]; j < m; j++){
            answer[i][j] = plusPtr;
            plusPtr = (plusPtr == k - 1? 0 : plusPtr + 1);
            total += x[i][j];
        }
    }
    allocate_tickets(answer);
	return total;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 35 ms 3124 KB Output is correct
6 Correct 767 ms 52084 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 456 KB Output is correct
5 Correct 31 ms 2472 KB Output is correct
6 Correct 610 ms 56748 KB Output is correct
7 Correct 648 ms 57028 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 7 ms 844 KB Output is correct
13 Correct 22 ms 2088 KB Output is correct
14 Correct 21 ms 2188 KB Output is correct
15 Correct 646 ms 57652 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 36 ms 2404 KB Output is correct
6 Correct 7 ms 588 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 926 ms 54248 KB Output is correct
9 Correct 822 ms 50556 KB Output is correct
10 Correct 780 ms 50684 KB Output is correct
11 Correct 842 ms 54308 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 496 KB Output is correct
5 Correct 3 ms 436 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 508 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 496 KB Output is correct
5 Correct 3 ms 436 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 508 KB Output is correct
13 Correct 28 ms 3168 KB Output is correct
14 Correct 28 ms 3252 KB Output is correct
15 Correct 34 ms 3140 KB Output is correct
16 Correct 33 ms 3264 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 2 ms 336 KB Output is correct
20 Correct 27 ms 2584 KB Output is correct
21 Correct 30 ms 3140 KB Output is correct
22 Correct 34 ms 2628 KB Output is correct
23 Correct 31 ms 3140 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 35 ms 3124 KB Output is correct
12 Correct 767 ms 52084 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 2 ms 456 KB Output is correct
17 Correct 31 ms 2472 KB Output is correct
18 Correct 610 ms 56748 KB Output is correct
19 Correct 648 ms 57028 KB Output is correct
20 Correct 4 ms 460 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 7 ms 844 KB Output is correct
25 Correct 22 ms 2088 KB Output is correct
26 Correct 21 ms 2188 KB Output is correct
27 Correct 646 ms 57652 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 3 ms 332 KB Output is correct
32 Correct 36 ms 2404 KB Output is correct
33 Correct 7 ms 588 KB Output is correct
34 Correct 7 ms 844 KB Output is correct
35 Correct 926 ms 54248 KB Output is correct
36 Correct 822 ms 50556 KB Output is correct
37 Correct 780 ms 50684 KB Output is correct
38 Correct 842 ms 54308 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 2 ms 332 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 3 ms 496 KB Output is correct
43 Correct 3 ms 436 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 508 KB Output is correct
51 Correct 28 ms 3168 KB Output is correct
52 Correct 28 ms 3252 KB Output is correct
53 Correct 34 ms 3140 KB Output is correct
54 Correct 33 ms 3264 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 2 ms 336 KB Output is correct
58 Correct 27 ms 2584 KB Output is correct
59 Correct 30 ms 3140 KB Output is correct
60 Correct 34 ms 2628 KB Output is correct
61 Correct 31 ms 3140 KB Output is correct
62 Correct 93 ms 8392 KB Output is correct
63 Correct 79 ms 8436 KB Output is correct
64 Correct 94 ms 8532 KB Output is correct
65 Correct 333 ms 33052 KB Output is correct
66 Correct 398 ms 33608 KB Output is correct
67 Correct 7 ms 972 KB Output is correct
68 Correct 6 ms 688 KB Output is correct
69 Correct 739 ms 73068 KB Output is correct
70 Correct 765 ms 74052 KB Output is correct
71 Correct 850 ms 75884 KB Output is correct
72 Correct 701 ms 60560 KB Output is correct
73 Correct 796 ms 73244 KB Output is correct
74 Correct 635 ms 59052 KB Output is correct
75 Correct 755 ms 71792 KB Output is correct