oj.uz

Submission #983971

# Submission time Handle Problem Language Result Execution time Memory
983971 2024-05-16T08:41:13 Z phoenix0423 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1062 ms 76432 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define pb push_back
#define eb emplace_back
#include "tickets.h"
const int maxn = 1505;
const ll INF = 1e18;
// ll dp[maxn][maxn];

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> ans(n, vector<int>(m, -1));
	ll cost = 0;
	multiset<pll> stl, str; // l : l -> r, r : r -> l
	vector<int> l(n), r(n);
	auto rid = [&](int i) -> void {
		if(l[i]) stl.erase({x[i][r[i]] + x[i][l[i] - 1], i});
		if(r[i] < m - 1) str.erase({x[i][r[i] + 1] + x[i][l[i]], i});
	};
	auto put = [&](int i) -> void {
		if(l[i]) stl.insert({x[i][r[i]] + x[i][l[i] - 1], i});
		if(r[i] < m - 1) str.insert({x[i][r[i] + 1] + x[i][l[i]], i});
	};
	for(int i = 0; i < n; i++){
		if(i < n / 2) l[i] = k, r[i] = m - 1;
		else l[i] = 0, r[i] = m - 1 - k;
		for(int j = 0; j < l[i]; j++) cost -= x[i][j];
		for(int j = r[i] + 1; j < m; j++) cost += x[i][j];
		put(i);
	}
	while(true){
		auto [a, b] = *prev(stl.end());
		auto [c, d] = *str.begin();
		if(b == d || a <= c) break;
		rid(b), rid(d);
		// swap(ans[b][l[b] - 1], ans[b][r[b]]);
		// swap(ans[d][l[d]], ans[d][r[d] + 1]);
		l[b] --, r[b] --;
		l[d] ++, r[d] ++;
		put(b), put(d);
	}
	vector<int> cnt(k);
	for(int i = 0; i < n; i++){
		priority_queue<pll, vector<pll>, greater<pll>> q;
		for(int j = 0; j < k; j++) q.push({cnt[j], j});
		set<int> used;
		for(int j = 0; j < l[i]; j++){
			auto [c, val] = q.top(); q.pop();
			cnt[val] ++;
			ans[i][j] = val, used.insert(val);
		}
		int c = 0;
		for(int j = r[i] + 1; j < m; j++){
			while(used.count(c)) c++;
			ans[i][j] = c;
			c++;
		}
		while(used.count(c)) c++;
		assert(c == k);
	}
	int mn = 1e9, mx = 0;
	cost = 0;
	vector<vector<int>> a(k);
	for(int i = 0; i < n; i++){
		for(int j = 0; j < l[i]; j++) cost -= x[i][j], mx = max(mx, x[i][j]);
		for(int j = r[i] + 1; j < m; j++) cost += x[i][j], mn = min(mn, x[i][j]);
	}
	// cout<<mn<<" "<<mx<<"\n";
	assert(mn >= mx);
	allocate_tickets(ans);
	return cost;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 16 ms 2396 KB Output is correct
6 Correct 395 ms 51580 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 19 ms 2632 KB Output is correct
6 Correct 450 ms 56864 KB Output is correct
7 Correct 552 ms 57412 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 860 KB Output is correct
13 Correct 19 ms 2336 KB Output is correct
14 Correct 20 ms 2136 KB Output is correct
15 Correct 662 ms 57936 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 39 ms 3424 KB Output is correct
6 Correct 7 ms 860 KB Output is correct
7 Correct 10 ms 1116 KB Output is correct
8 Correct 1062 ms 76380 KB Output is correct
9 Correct 972 ms 71452 KB Output is correct
10 Correct 1010 ms 71384 KB Output is correct
11 Correct 1054 ms 76432 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 472 KB Output is correct
12 Correct 3 ms 604 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 472 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 16 ms 3164 KB Output is correct
14 Correct 21 ms 3404 KB Output is correct
15 Correct 34 ms 3420 KB Output is correct
16 Correct 38 ms 3408 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 36 ms 2640 KB Output is correct
21 Correct 30 ms 3152 KB Output is correct
22 Correct 36 ms 2616 KB Output is correct
23 Correct 36 ms 3156 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 16 ms 2396 KB Output is correct
12 Correct 395 ms 51580 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 19 ms 2632 KB Output is correct
18 Correct 450 ms 56864 KB Output is correct
19 Correct 552 ms 57412 KB Output is correct
20 Correct 4 ms 604 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 6 ms 860 KB Output is correct
25 Correct 19 ms 2336 KB Output is correct
26 Correct 20 ms 2136 KB Output is correct
27 Correct 662 ms 57936 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 3 ms 604 KB Output is correct
32 Correct 39 ms 3424 KB Output is correct
33 Correct 7 ms 860 KB Output is correct
34 Correct 10 ms 1116 KB Output is correct
35 Correct 1062 ms 76380 KB Output is correct
36 Correct 972 ms 71452 KB Output is correct
37 Correct 1010 ms 71384 KB Output is correct
38 Correct 1054 ms 76432 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 3 ms 348 KB Output is correct
41 Correct 2 ms 348 KB Output is correct
42 Correct 2 ms 600 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 3 ms 604 KB Output is correct
49 Correct 3 ms 472 KB Output is correct
50 Correct 3 ms 604 KB Output is correct
51 Correct 16 ms 3164 KB Output is correct
52 Correct 21 ms 3404 KB Output is correct
53 Correct 34 ms 3420 KB Output is correct
54 Correct 38 ms 3408 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 3 ms 604 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 36 ms 2640 KB Output is correct
59 Correct 30 ms 3152 KB Output is correct
60 Correct 36 ms 2616 KB Output is correct
61 Correct 36 ms 3156 KB Output is correct
62 Correct 45 ms 8528 KB Output is correct
63 Correct 45 ms 8532 KB Output is correct
64 Correct 107 ms 8784 KB Output is correct
65 Correct 306 ms 33400 KB Output is correct
66 Correct 444 ms 33872 KB Output is correct
67 Correct 7 ms 1112 KB Output is correct
68 Correct 6 ms 860 KB Output is correct
69 Correct 400 ms 73456 KB Output is correct
70 Correct 785 ms 74328 KB Output is correct
71 Correct 1048 ms 76372 KB Output is correct
72 Correct 854 ms 60760 KB Output is correct
73 Correct 954 ms 73560 KB Output is correct
74 Correct 622 ms 59732 KB Output is correct
75 Correct 717 ms 72280 KB Output is correct