oj.uz

Submission #366926

# Submission time Handle Problem Language Result Execution time Memory
366926 2021-02-15T18:32:42 Z Sparky_09 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 750 ms 78444 KB 
#include "bits/stdc++.h"
#include"tickets.h"

using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;
 
template <class T>
void rd(T &x) {
	int sgn = 1;
	char ch;
	x = 0;
	for (ch = getchar(); (ch < '0' || ch > '9') && ch != '-'; ch = getchar()) ;
	if (ch == '-') ch = getchar(), sgn = -1;
	for (; '0' <= ch && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
	x *= sgn;
}
template <class T>
void wr(T x) {
	if (x < 0) putchar('-'), wr(-x);
	else if (x < 10) putchar(x + '0');
	else wr(x / 10), putchar(x % 10 + '0');
}
void usaco(string s){
  freopen((s+".in").c_str(), "r", stdin);
  freopen((s+".out").c_str(), "w", stdout);
}
 
ll find_maximum(int k, std::vector<std::vector<int> > x) {
	const int n = x.size(), m = x[0].size();
	vector<pair<ll, int>> pairs;
	vector<int> cur0(n), cur1(n, m), rank(n), cnt0(n), cnt1(n);
	ll answer = 0;
	pairs.reserve(n * k);
	for(int i = 0; i < n; ++i) {
		for(int j = 1; j <= k; ++j) {
			pairs.emplace_back(x[i][k - j] + x[i][m - j], i);
			answer -= x[i][j - 1];
		}
	}
	nth_element(pairs.rbegin(), pairs.rbegin() + n / 2 * k, pairs.rend());
	for(int i = 0; i < n / 2 * k; ++i) ++ cnt1[pairs[i].second], answer += pairs[i].first;
	for(int i = 0; i < n; ++i) cnt0[i] = k - cnt1[i], rank[i] = i;
	for(int i = 0; i < n; ++i) fill(x[i].begin(), x[i].end(), -1);
	const auto cmp = [&](int x, int y) { return cnt0[x] < cnt0[y]; };
	for(int R = 0; R < k; ++R) {
		nth_element(rank.begin(), rank.begin() + n / 2, rank.end(), cmp);
		for(int i = 0;i < n / 2;++i) x[rank[i]][--cur1[rank[i]]] = R, --cnt1[rank[i]];
		for(int i = n / 2;i < n;++i) x[rank[i]][cur0[rank[i]]++] = R, --cnt0[rank[i]];
	}
	allocate_tickets(x);
	return answer;
}

Compilation message

tickets.cpp: In function 'void usaco(std::string)':
tickets.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   31 |   freopen((s+".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tickets.cpp:32:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   32 |   freopen((s+".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 748 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 35 ms 2924 KB Output is correct
6 Correct 647 ms 64364 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 25 ms 2668 KB Output is correct
6 Correct 563 ms 57836 KB Output is correct
7 Correct 612 ms 63888 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 6 ms 1004 KB Output is correct
13 Correct 20 ms 2540 KB Output is correct
14 Correct 20 ms 2540 KB Output is correct
15 Correct 610 ms 68332 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 29 ms 4076 KB Output is correct
6 Correct 5 ms 876 KB Output is correct
7 Correct 6 ms 1132 KB Output is correct
8 Correct 731 ms 75060 KB Output is correct
9 Correct 694 ms 77296 KB Output is correct
10 Correct 672 ms 70276 KB Output is correct
11 Correct 750 ms 74984 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 4 ms 620 KB Output is correct
11 Correct 4 ms 768 KB Output is correct
12 Correct 3 ms 620 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 4 ms 620 KB Output is correct
11 Correct 4 ms 768 KB Output is correct
12 Correct 3 ms 620 KB Output is correct
13 Correct 26 ms 2924 KB Output is correct
14 Correct 26 ms 2924 KB Output is correct
15 Correct 28 ms 3308 KB Output is correct
16 Correct 30 ms 4096 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 620 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 26 ms 3052 KB Output is correct
21 Correct 27 ms 3436 KB Output is correct
22 Correct 31 ms 3436 KB Output is correct
23 Correct 29 ms 3820 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 35 ms 2924 KB Output is correct
12 Correct 647 ms 64364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 25 ms 2668 KB Output is correct
18 Correct 563 ms 57836 KB Output is correct
19 Correct 612 ms 63888 KB Output is correct
20 Correct 3 ms 620 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 6 ms 1004 KB Output is correct
25 Correct 20 ms 2540 KB Output is correct
26 Correct 20 ms 2540 KB Output is correct
27 Correct 610 ms 68332 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 620 KB Output is correct
32 Correct 29 ms 4076 KB Output is correct
33 Correct 5 ms 876 KB Output is correct
34 Correct 6 ms 1132 KB Output is correct
35 Correct 731 ms 75060 KB Output is correct
36 Correct 694 ms 77296 KB Output is correct
37 Correct 672 ms 70276 KB Output is correct
38 Correct 750 ms 74984 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 2 ms 492 KB Output is correct
41 Correct 3 ms 620 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 3 ms 620 KB Output is correct
44 Correct 3 ms 620 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 2 ms 492 KB Output is correct
48 Correct 4 ms 620 KB Output is correct
49 Correct 4 ms 768 KB Output is correct
50 Correct 3 ms 620 KB Output is correct
51 Correct 26 ms 2924 KB Output is correct
52 Correct 26 ms 2924 KB Output is correct
53 Correct 28 ms 3308 KB Output is correct
54 Correct 30 ms 4096 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 2 ms 620 KB Output is correct
57 Correct 1 ms 492 KB Output is correct
58 Correct 26 ms 3052 KB Output is correct
59 Correct 27 ms 3436 KB Output is correct
60 Correct 31 ms 3436 KB Output is correct
61 Correct 29 ms 3820 KB Output is correct
62 Correct 71 ms 7504 KB Output is correct
63 Correct 73 ms 7532 KB Output is correct
64 Correct 89 ms 10732 KB Output is correct
65 Correct 305 ms 33644 KB Output is correct
66 Correct 320 ms 41452 KB Output is correct
67 Correct 8 ms 1132 KB Output is correct
68 Correct 5 ms 876 KB Output is correct
69 Correct 623 ms 47576 KB Output is correct
70 Correct 674 ms 56920 KB Output is correct
71 Correct 724 ms 78444 KB Output is correct
72 Correct 612 ms 75840 KB Output is correct
73 Correct 692 ms 70264 KB Output is correct
74 Correct 581 ms 61804 KB Output is correct
75 Correct 654 ms 63468 KB Output is correct