oj.uz

Submission #309811

# Submission time Handle Problem Language Result Execution time Memory
309811 2020-10-04T14:57:47 Z aZvezda Carnival Tickets (IOI20_tickets) C++14
100 / 100
 887 ms 54596 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
template<class T> inline void fix(T &x) {if(labs(x) >= mod) {x %= mod;} if(x < 0) {x += mod;}}
#define out(x) cout << __LINE__ << ": " << (#x) << " = " << (x) << endl

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	ll n = x.size();
	ll m = x[0].size();
	std::vector<std::vector<int> > answer;
	vector<vector<pair<ll, ll> > > pr;
	priority_queue<pair<ll, ll> > pq;
	vector<ll> got;
	got.resize(n);
	ll ans = 0;
	for (ll i = 0; i < n; i++) {
        vector<int> row(m);
        for(ll j = 0; j < m; j++) {
            row[j] = -1;
		}
		for(ll j = m - k; j < m; j ++) {
            ans += x[i][j];
		}
		pq.push({-x[i][0] - x[i][m - k], i});
		answer.push_back(row);
	}
	ll iter = n * k / 2;
	for(ll i = 0; i < iter; i ++) {
        auto curr = pq.top(); pq.pop();
        ans += curr.first;
        got[curr.second] ++;
        if(got[curr.second] < k) {
            pq.push({-x[curr.second][got[curr.second]] - x[curr.second][m - k + got[curr.second]], curr.second});
        }
	}
    ll cnt = 0;
    for(ll i = 0; i < n; i ++) {
        for(ll j = 0; j < got[i]; j ++) {
            answer[i][j] = (cnt + j) % k;
        }
        cnt += got[i];
        ll group = cnt;
        for(ll j = m - k + got[i]; j < m; j ++) {
            answer[i][j] = group % k;
            group ++;
        }
    }
	allocate_tickets(answer);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 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 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 29 ms 2432 KB Output is correct
6 Correct 711 ms 51576 KB Output is correct

Subtask #3
14.0 / 14.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 2 ms 512 KB Output is correct
5 Correct 24 ms 2432 KB Output is correct
6 Correct 586 ms 52472 KB Output is correct
7 Correct 622 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 0 ms 256 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 21 ms 2048 KB Output is correct
14 Correct 20 ms 2048 KB Output is correct
15 Correct 625 ms 53624 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 0 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 34 ms 2424 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 7 ms 896 KB Output is correct
8 Correct 887 ms 54520 KB Output is correct
9 Correct 802 ms 50672 KB Output is correct
10 Correct 821 ms 50844 KB Output is correct
11 Correct 871 ms 54596 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 4 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 4 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 29 ms 2424 KB Output is correct
14 Correct 30 ms 2424 KB Output is correct
15 Correct 32 ms 2428 KB Output is correct
16 Correct 34 ms 2424 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 26 ms 2404 KB Output is correct
21 Correct 32 ms 2424 KB Output is correct
22 Correct 28 ms 2432 KB Output is correct
23 Correct 33 ms 2424 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 29 ms 2432 KB Output is correct
12 Correct 711 ms 51576 KB Output is correct
13 Correct 0 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 24 ms 2432 KB Output is correct
18 Correct 586 ms 52472 KB Output is correct
19 Correct 622 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 0 ms 256 KB Output is correct
24 Correct 7 ms 896 KB Output is correct
25 Correct 21 ms 2048 KB Output is correct
26 Correct 20 ms 2048 KB Output is correct
27 Correct 625 ms 53624 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 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 34 ms 2424 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 7 ms 896 KB Output is correct
35 Correct 887 ms 54520 KB Output is correct
36 Correct 802 ms 50672 KB Output is correct
37 Correct 821 ms 50844 KB Output is correct
38 Correct 871 ms 54596 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 4 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 29 ms 2424 KB Output is correct
52 Correct 30 ms 2424 KB Output is correct
53 Correct 32 ms 2428 KB Output is correct
54 Correct 34 ms 2424 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 26 ms 2404 KB Output is correct
59 Correct 32 ms 2424 KB Output is correct
60 Correct 28 ms 2432 KB Output is correct
61 Correct 33 ms 2424 KB Output is correct
62 Correct 80 ms 6012 KB Output is correct
63 Correct 81 ms 6052 KB Output is correct
64 Correct 96 ms 6264 KB Output is correct
65 Correct 341 ms 23544 KB Output is correct
66 Correct 389 ms 24056 KB Output is correct
67 Correct 7 ms 896 KB Output is correct
68 Correct 6 ms 640 KB Output is correct
69 Correct 704 ms 51492 KB Output is correct
70 Correct 804 ms 52656 KB Output is correct
71 Correct 877 ms 54392 KB Output is correct
72 Correct 699 ms 52216 KB Output is correct
73 Correct 853 ms 52280 KB Output is correct
74 Correct 643 ms 50816 KB Output is correct
75 Correct 817 ms 50848 KB Output is correct