oj.uz

Submission #824954

# Submission time Handle Problem Language Result Execution time Memory
824954 2023-08-14T12:23:29 Z pedroslrey Carnival Tickets (IOI20_tickets) C++14
100 / 100
 852 ms 79332 KB 
#include <bits/stdc++.h>
#include "tickets.h"

using namespace std;
using lli = long long;

vector<vector<int>> calc(vector<stack<int>> plus, vector<stack<int>> minus, int m, int k) {
	int n = plus.size();

	vector<vector<int>> ans(n, vector<int>(m, -1));
	for (int round = 0; round < k; ++round) {
		int cntplus = 0, cntminus = 0;
		auto add_plus = [&plus, &ans, &round, &cntplus](int i) {
			ans[i][plus[i].top()] = round;
			plus[i].pop();
			++cntplus;
		};

		auto add_minus = [&minus, &ans, &round, &cntminus](int i) {
			ans[i][minus[i].top()] = round;
			minus[i].pop();
			++cntminus;
		};

		// cerr << "BEGIN\n";
		for (int i = 0; i < n; ++i) {
			// cerr << plus[i].size() << " " << minus[i].size() << "\n";
			if (plus[i].empty()) add_minus(i);
			else if (minus[i].empty()) add_plus(i);
		}
		for (int i = 0; i < n; ++i)
			if (!plus[i].empty() && !minus[i].empty())
				if (cntplus > cntminus) add_minus(i);
				else add_plus(i);
		// cerr << "END " << cntplus << " " << cntminus << "\n";
	}

	return ans;
}

lli val(vector<vector<int>> &ans, vector<vector<int>> &ms, int k) {
	int n = ans.size(), m = ans[0].size();

	vector<vector<int>> rounds(k);
	for (int i = 0; i < n; ++i) 
		for (int j = 0; j < m; ++j) 
			if (ans[i][j] != -1) rounds[ans[i][j]].push_back(ms[i][j]);

	lli sum = 0;
	for (int r = 0; r < k; ++r) {
		sort(rounds[r].begin(), rounds[r].end());

		for (int i = 0; i < n/2; ++i)
			sum -= rounds[r][i];
		for (int i = n/2; i < n; ++i)
			sum += rounds[r][i];
	}

	return sum;
}

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

	vector<vector<int>> ids(n, vector<int>(m));
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j)
			ids[i][j] = j;

		sort(ids[i].begin(), ids[i].end(), [&](int a, int b) { return ms[i][a] < ms[i][b]; });
	}

	vector<int> stage(n, 0);
	set<pair<lli, int>> increase;

	auto add = [&](int i) {
		int x = stage[i]; auto &id = ids[i];
		increase.emplace(ms[i][id[k-1-x]] + ms[i][id[m-1-x]], i);
	};

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

	for (int i = 0; i < n*k/2; ++i) {
		auto [x, idx] = *increase.rbegin(); increase.erase(--increase.end());
		
		++stage[idx];
		if (stage[idx] < k) add(idx);
	}

	vector<stack<int>> plus(n), minus(n);
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < k - stage[i]; ++j)
			minus[i].push(ids[i][j]);
		for (int j = m-1; j >= m - stage[i]; --j)
			plus[i].push(ids[i][j]);
	}

	auto ans = calc(plus, minus, m, k);
	allocate_tickets(ans);

	return val(ans, ms, k);
}

Compilation message

tickets.cpp: In function 'std::vector<std::vector<int> > calc(std::vector<std::stack<int> >, std::vector<std::stack<int> >, int, int)':
tickets.cpp:32:7: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   32 |    if (!plus[i].empty() && !minus[i].empty())
      |       ^
tickets.cpp: In function 'lli find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:85:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   85 |   auto [x, idx] = *increase.rbegin(); increase.erase(--increase.end());
      |        ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 5 ms 4692 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 17 ms 3056 KB Output is correct
6 Correct 464 ms 62472 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 20 ms 3484 KB Output is correct
6 Correct 446 ms 71852 KB Output is correct
7 Correct 494 ms 73372 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 304 KB Output is correct
12 Correct 5 ms 1108 KB Output is correct
13 Correct 16 ms 2996 KB Output is correct
14 Correct 16 ms 3028 KB Output is correct
15 Correct 500 ms 75708 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 0 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 28 ms 4468 KB Output is correct
6 Correct 4 ms 1076 KB Output is correct
7 Correct 8 ms 4948 KB Output is correct
8 Correct 852 ms 76088 KB Output is correct
9 Correct 757 ms 71132 KB Output is correct
10 Correct 792 ms 71064 KB Output is correct
11 Correct 808 ms 76164 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 628 KB Output is correct
6 Correct 2 ms 692 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 568 KB Output is correct
12 Correct 2 ms 692 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 628 KB Output is correct
6 Correct 2 ms 692 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 568 KB Output is correct
12 Correct 2 ms 692 KB Output is correct
13 Correct 18 ms 4052 KB Output is correct
14 Correct 18 ms 3976 KB Output is correct
15 Correct 22 ms 3972 KB Output is correct
16 Correct 27 ms 4532 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 1236 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 22 ms 3500 KB Output is correct
21 Correct 23 ms 3992 KB Output is correct
22 Correct 24 ms 3668 KB Output is correct
23 Correct 26 ms 4168 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 5 ms 4692 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 17 ms 3056 KB Output is correct
12 Correct 464 ms 62472 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 20 ms 3484 KB Output is correct
18 Correct 446 ms 71852 KB Output is correct
19 Correct 494 ms 73372 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 304 KB Output is correct
24 Correct 5 ms 1108 KB Output is correct
25 Correct 16 ms 2996 KB Output is correct
26 Correct 16 ms 3028 KB Output is correct
27 Correct 500 ms 75708 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 300 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 620 KB Output is correct
32 Correct 28 ms 4468 KB Output is correct
33 Correct 4 ms 1076 KB Output is correct
34 Correct 8 ms 4948 KB Output is correct
35 Correct 852 ms 76088 KB Output is correct
36 Correct 757 ms 71132 KB Output is correct
37 Correct 792 ms 71064 KB Output is correct
38 Correct 808 ms 76164 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 628 KB Output is correct
44 Correct 2 ms 692 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 3 ms 568 KB Output is correct
50 Correct 2 ms 692 KB Output is correct
51 Correct 18 ms 4052 KB Output is correct
52 Correct 18 ms 3976 KB Output is correct
53 Correct 22 ms 3972 KB Output is correct
54 Correct 27 ms 4532 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 1236 KB Output is correct
57 Correct 1 ms 1108 KB Output is correct
58 Correct 22 ms 3500 KB Output is correct
59 Correct 23 ms 3992 KB Output is correct
60 Correct 24 ms 3668 KB Output is correct
61 Correct 26 ms 4168 KB Output is correct
62 Correct 60 ms 10036 KB Output is correct
63 Correct 48 ms 10048 KB Output is correct
64 Correct 74 ms 11080 KB Output is correct
65 Correct 264 ms 39876 KB Output is correct
66 Correct 321 ms 42416 KB Output is correct
67 Correct 7 ms 4948 KB Output is correct
68 Correct 6 ms 984 KB Output is correct
69 Correct 492 ms 64556 KB Output is correct
70 Correct 675 ms 68960 KB Output is correct
71 Correct 835 ms 75996 KB Output is correct
72 Correct 635 ms 79332 KB Output is correct
73 Correct 763 ms 72932 KB Output is correct
74 Correct 526 ms 73804 KB Output is correct
75 Correct 639 ms 67444 KB Output is correct