oj.uz

Submission #416474

# Submission time Handle Problem Language Result Execution time Memory
416474 2021-06-02T13:01:26 Z Kevin_Zhang_TW Carnival Tickets (IOI20_tickets) C++17
100 / 100
 807 ms 76100 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV 
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
#include "tickets.h"
#include <vector>

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<int> lat(n), rat(n, m);

	for (int i = 0;i < n;++i) {
		for (int j = 0, &ind = rat[i];j < k;++j)
			sum += x[i][--ind];
	}

	int req = n / 2 * k;

	priority_queue< pair<ll,ll> > pq;

	auto upd = [&](int ind) {
		pq.emplace( -(x[ind][lat[ind]] + x[ind][rat[ind]]), ind );
	};

	for (int i = 0;i < n;++i)
		upd(i);

	while (req--) {
		auto [ w, id ] = pq.top(); pq.pop();
		sum += w;

		DE(id, lat[id], rat[id]);
		++lat[id], ++rat[id];
		if (lat[id] == k) continue;
		upd(id);
	}

	vector<vector<int>> answer(n, vector<int>(m, -1));

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

		DE(i, lat[i], rat[i]);

		int c = s;

		for (int j = 0;j < lat[i];++j) {
			answer[i][j] = c++;
			if (c == k) c = 0;
		}
		for (int j = rat[i];j < m;++j) {
			answer[i][j] = c++;
			if (c == k) c = 0;
		}

		s = (s + lat[i]) % k;
	}

	allocate_tickets(answer);
	return sum;
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
tickets.cpp:47:3: note: in expansion of macro 'DE'
   47 |   DE(id, lat[id], rat[id]);
      |   ^~
tickets.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
tickets.cpp:57:3: note: in expansion of macro 'DE'
   57 |   DE(i, lat[i], rat[i]);
      |   ^~

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 2 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 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 25 ms 3140 KB Output is correct
6 Correct 710 ms 73244 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 460 KB Output is correct
5 Correct 23 ms 2472 KB Output is correct
6 Correct 583 ms 56776 KB Output is correct
7 Correct 570 ms 57048 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 204 KB Output is correct
12 Correct 6 ms 844 KB Output is correct
13 Correct 20 ms 2096 KB Output is correct
14 Correct 20 ms 2148 KB Output is correct
15 Correct 678 ms 57760 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 460 KB Output is correct
5 Correct 30 ms 3232 KB Output is correct
6 Correct 6 ms 688 KB Output is correct
7 Correct 6 ms 944 KB Output is correct
8 Correct 807 ms 76100 KB Output is correct
9 Correct 742 ms 70940 KB Output is correct
10 Correct 745 ms 71012 KB Output is correct
11 Correct 761 ms 76040 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 460 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 3 ms 428 KB Output is correct
5 Correct 2 ms 460 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 204 KB Output is correct
9 Correct 2 ms 440 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 460 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 460 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 3 ms 428 KB Output is correct
5 Correct 2 ms 460 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 204 KB Output is correct
9 Correct 2 ms 440 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 460 KB Output is correct
13 Correct 28 ms 3212 KB Output is correct
14 Correct 27 ms 3228 KB Output is correct
15 Correct 28 ms 3140 KB Output is correct
16 Correct 30 ms 3260 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 25 ms 2660 KB Output is correct
21 Correct 28 ms 3140 KB Output is correct
22 Correct 30 ms 2708 KB Output is correct
23 Correct 29 ms 3168 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 2 ms 716 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 25 ms 3140 KB Output is correct
12 Correct 710 ms 73244 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 460 KB Output is correct
17 Correct 23 ms 2472 KB Output is correct
18 Correct 583 ms 56776 KB Output is correct
19 Correct 570 ms 57048 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 204 KB Output is correct
24 Correct 6 ms 844 KB Output is correct
25 Correct 20 ms 2096 KB Output is correct
26 Correct 20 ms 2148 KB Output is correct
27 Correct 678 ms 57760 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 460 KB Output is correct
32 Correct 30 ms 3232 KB Output is correct
33 Correct 6 ms 688 KB Output is correct
34 Correct 6 ms 944 KB Output is correct
35 Correct 807 ms 76100 KB Output is correct
36 Correct 742 ms 70940 KB Output is correct
37 Correct 745 ms 71012 KB Output is correct
38 Correct 761 ms 76040 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 2 ms 432 KB Output is correct
42 Correct 3 ms 428 KB Output is correct
43 Correct 2 ms 460 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 204 KB Output is correct
47 Correct 2 ms 440 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 460 KB Output is correct
51 Correct 28 ms 3212 KB Output is correct
52 Correct 27 ms 3228 KB Output is correct
53 Correct 28 ms 3140 KB Output is correct
54 Correct 30 ms 3260 KB Output is correct
55 Correct 1 ms 308 KB Output is correct
56 Correct 2 ms 460 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 25 ms 2660 KB Output is correct
59 Correct 28 ms 3140 KB Output is correct
60 Correct 30 ms 2708 KB Output is correct
61 Correct 29 ms 3168 KB Output is correct
62 Correct 71 ms 8368 KB Output is correct
63 Correct 70 ms 8404 KB Output is correct
64 Correct 85 ms 8516 KB Output is correct
65 Correct 314 ms 33092 KB Output is correct
66 Correct 347 ms 33592 KB Output is correct
67 Correct 6 ms 972 KB Output is correct
68 Correct 6 ms 712 KB Output is correct
69 Correct 624 ms 73284 KB Output is correct
70 Correct 727 ms 74268 KB Output is correct
71 Correct 790 ms 75988 KB Output is correct
72 Correct 647 ms 60588 KB Output is correct
73 Correct 730 ms 73256 KB Output is correct
74 Correct 597 ms 59000 KB Output is correct
75 Correct 679 ms 71872 KB Output is correct