oj.uz

Submission #616790

# Submission time Handle Problem Language Result Execution time Memory
616790 2022-08-01T06:48:26 Z wiwiho Carnival Tickets (IOI20_tickets) C++14
100 / 100
 707 ms 76600 KB 
#include "tickets.h"

#include <bits/stdc++.h>

#define iter(a) a.begin(), a.end()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(iter(a), greater<>())
#define eb emplace_back
#define ef emplace_front
#define pob pop_back()
#define pof pop_front()
#define mp make_pair
#define F first
#define S second
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) { \
    for(auto pv : a) b << pv << " "; \
    b << "\n"; \
}

using namespace std;

typedef long long ll;

using pii = pair<int, int>;
using pll = pair<ll, ll>;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

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

    ll sum = 0;
    vector<vector<bool>> big(n, vector<bool>(m)), small(n, vector<bool>(m));
    vector<int> cnt(n, K);
    priority_queue<pii> pq;
    for(int i = 0; i < n; i++){
        for(int j = m - K; j < m; j++){
            big[i][j] = true;
        }
        pq.push(mp(-x[i][m - K] - x[i][0], i));
    }

    for(int i = 0; i < n * K / 2; i++){
        int id = pq.top().S;
        pq.pop();
        big[id][m - cnt[id]] = false;
        small[id][K - cnt[id]] = true;
        cnt[id]--;
        if(cnt[id] == 0) continue;
        pq.push(mp(-x[id][m - cnt[id]] - x[id][K - cnt[id]], id));
    }

    vector<vector<int>> ans(n, vector<int>(m));
    int now = 0;
    for(int i = 0; i < n; i++){
        int cb = 0, cs = 0;
        for(int j = 0; j < m; j++){
            if(big[i][j]){
                ans[i][j] = (now + cb) % K;
                cb++;
                sum += x[i][j];
            }
            else if(small[i][j]){
                ans[i][j] = (now + cnt[i] + cs) % K;
                cs++;
                sum -= x[i][j];
            }
            else ans[i][j] = -1;
        }
        now += cnt[i];
        now %= K;
    }

	allocate_tickets(ans);
	return sum;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 20 ms 3388 KB Output is correct
6 Correct 581 ms 73760 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 18 ms 2528 KB Output is correct
6 Correct 503 ms 57404 KB Output is correct
7 Correct 528 ms 57764 KB Output is correct
8 Correct 4 ms 472 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 16 ms 2260 KB Output is correct
14 Correct 22 ms 2196 KB Output is correct
15 Correct 501 ms 58444 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 24 ms 3252 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 7 ms 1236 KB Output is correct
8 Correct 688 ms 56384 KB Output is correct
9 Correct 655 ms 52616 KB Output is correct
10 Correct 578 ms 52760 KB Output is correct
11 Correct 652 ms 56336 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 3 ms 440 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 496 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 440 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 444 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 3 ms 440 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 496 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 440 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 444 KB Output is correct
13 Correct 20 ms 3224 KB Output is correct
14 Correct 21 ms 3276 KB Output is correct
15 Correct 21 ms 3248 KB Output is correct
16 Correct 24 ms 3336 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 19 ms 2612 KB Output is correct
21 Correct 22 ms 3232 KB Output is correct
22 Correct 28 ms 2632 KB Output is correct
23 Correct 24 ms 3248 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 20 ms 3388 KB Output is correct
12 Correct 581 ms 73760 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 18 ms 2528 KB Output is correct
18 Correct 503 ms 57404 KB Output is correct
19 Correct 528 ms 57764 KB Output is correct
20 Correct 4 ms 472 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 6 ms 852 KB Output is correct
25 Correct 16 ms 2260 KB Output is correct
26 Correct 22 ms 2196 KB Output is correct
27 Correct 501 ms 58444 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 24 ms 3252 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 7 ms 1236 KB Output is correct
35 Correct 688 ms 56384 KB Output is correct
36 Correct 655 ms 52616 KB Output is correct
37 Correct 578 ms 52760 KB Output is correct
38 Correct 652 ms 56336 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 440 KB Output is correct
41 Correct 3 ms 440 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 3 ms 496 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 440 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 3 ms 444 KB Output is correct
51 Correct 20 ms 3224 KB Output is correct
52 Correct 21 ms 3276 KB Output is correct
53 Correct 21 ms 3248 KB Output is correct
54 Correct 24 ms 3336 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 468 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 19 ms 2612 KB Output is correct
59 Correct 22 ms 3232 KB Output is correct
60 Correct 28 ms 2632 KB Output is correct
61 Correct 24 ms 3248 KB Output is correct
62 Correct 57 ms 8528 KB Output is correct
63 Correct 58 ms 8424 KB Output is correct
64 Correct 71 ms 8644 KB Output is correct
65 Correct 292 ms 33472 KB Output is correct
66 Correct 313 ms 33856 KB Output is correct
67 Correct 8 ms 1216 KB Output is correct
68 Correct 4 ms 692 KB Output is correct
69 Correct 528 ms 73768 KB Output is correct
70 Correct 660 ms 74736 KB Output is correct
71 Correct 707 ms 76600 KB Output is correct
72 Correct 568 ms 61140 KB Output is correct
73 Correct 654 ms 73952 KB Output is correct
74 Correct 580 ms 59640 KB Output is correct
75 Correct 664 ms 72484 KB Output is correct