oj.uz

답안 #799209

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
799209 2023-07-31T10:46:31 Z QwertyPi 카니발 티켓 (IOI20_tickets) C++14
100 / 100
 1459 ms 171392 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

long long report(int n, int m, int k, vector<vector<int>>& x, vector<int>& c){
	vector<vector<int>> ans(n, vector<int>(m, -1));
	vector<pair<int, int>> v;
	for(int i = 0; i < n; i++){
		v.push_back({c[i], i});
	}
	vector<int> l(n, 0), r(n, m - 1);
	long long res = 0;
	for(int i = 0; i < k; i++){
		sort(v.begin(), v.end(), [](pair<int, int> p1, pair<int, int> p2){
			return p1.first > p2.first;
		});
		for(int j = 0; j < n / 2; j++){
			res += x[v[j].second][r[v[j].second]];
			ans[v[j].second][r[v[j].second]--] = i;
			v[j].first--;
		}
		for(int j = n / 2; j < n; j++){
			res -= x[v[j].second][l[v[j].second]];
			ans[v[j].second][l[v[j].second]++] = i;
		}
	}
	allocate_tickets(ans);
	return res;
}

struct value_key{
	long long value, key, id; bool negative;
	bool operator< (const value_key& o) const {
		return value < o.value;
	}
};

struct result_type{
	int left, right;
};

bool used[1500 * 1500];
result_type lambda_maximum(long long lambda, int n, int m, int k, vector<value_key>& a, vector<int>& p, vector<int>& p2){
	int L = 0, R = n * m - 1;
	fill(used, used + n * m, false);
	vector<long long> cnt(n, 0), prev_value(n, -(1LL << 31)), prev_cnt(n, 0);
	fill(p.begin(), p.end(), 0);
	fill(p2.begin(), p2.end(), 0);
	int left_bound = 0, right_bound = 0;
	while(L < n * m || R >= 0){
		long long value; int key, id; bool negative;
		if(R == -1 || (L < n * m && lambda - a[L].value >= a[R].value)){
			value = lambda - a[L].value; key = a[L].key; id = a[L++].id; negative = true;
		}else{
			value = a[R].value; key = a[R].key; id = a[R--].id; negative = false;
		}
		if(used[id]){
			if(value * 2 == lambda){
				if(negative){
					p[key]--; p2[key]++; left_bound--;
				}else{
					p2[key]++; right_bound++;
				}
			}
			continue;
		}
		if(cnt[key] < k){
			used[id] = true;
			cnt[key]++; if(!negative) p[key]++, left_bound++, right_bound++;
			prev_cnt[key] = (prev_value[key] == value ? prev_cnt[key] + (negative) : negative);
			prev_value[key] = value;
		}else if(prev_value[key] == value){
			if(!negative && prev_cnt[key] > 0) prev_cnt[key]--, p2[key]++, right_bound++;
		}
	}
	return {left_bound, right_bound};
}

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size(), m = x[0].size();
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			x[i][j] <<= 1;
		}
	}
	vector<value_key> a;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			a.push_back({x[i][j], i, i * m + j});
		}
	}
	sort(a.begin(), a.end());
	long long L = 0, R = 1LL << 32;
	vector<int> p(n), p2(n);
	while(L <= R){
		long long M = (L + R) / 2;
		result_type range = lambda_maximum(M, n, m, k, a, p, p2);
		if(range.right < n * k / 2){
			R = M - 1;
		}else if(range.left > n * k / 2){
			L = M + 1;
		}else{
			int cnt = range.left;
			for(int i = 0; i < n; i++){
				while(cnt < n * k / 2 && p2[i] > 0){
					cnt++; p[i]++; p2[i]--;
				}
			}
			long long ans = report(n, m, k, x, p) >> 1;
			return ans;
		}
	}
	return -1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 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 3 ms 724 KB Output is correct
5 Correct 47 ms 5192 KB Output is correct
6 Correct 1287 ms 149400 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 33 ms 5192 KB Output is correct
6 Correct 1092 ms 149592 KB Output is correct
7 Correct 1045 ms 153780 KB Output is correct
8 Correct 5 ms 968 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 9 ms 1612 KB Output is correct
13 Correct 29 ms 5324 KB Output is correct
14 Correct 28 ms 5196 KB Output is correct
15 Correct 1150 ms 153816 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 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 4 ms 724 KB Output is correct
5 Correct 65 ms 5188 KB Output is correct
6 Correct 7 ms 1104 KB Output is correct
7 Correct 7 ms 1488 KB Output is correct
8 Correct 1456 ms 149548 KB Output is correct
9 Correct 1216 ms 168712 KB Output is correct
10 Correct 1217 ms 168740 KB Output is correct
11 Correct 1364 ms 171392 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 724 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 3 ms 724 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 724 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 44 ms 5208 KB Output is correct
14 Correct 46 ms 5192 KB Output is correct
15 Correct 45 ms 5252 KB Output is correct
16 Correct 46 ms 5232 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 39 ms 5224 KB Output is correct
21 Correct 35 ms 5188 KB Output is correct
22 Correct 43 ms 5188 KB Output is correct
23 Correct 38 ms 5252 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 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 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 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 3 ms 724 KB Output is correct
11 Correct 47 ms 5192 KB Output is correct
12 Correct 1287 ms 149400 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 33 ms 5192 KB Output is correct
18 Correct 1092 ms 149592 KB Output is correct
19 Correct 1045 ms 153780 KB Output is correct
20 Correct 5 ms 968 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 9 ms 1612 KB Output is correct
25 Correct 29 ms 5324 KB Output is correct
26 Correct 28 ms 5196 KB Output is correct
27 Correct 1150 ms 153816 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 4 ms 724 KB Output is correct
32 Correct 65 ms 5188 KB Output is correct
33 Correct 7 ms 1104 KB Output is correct
34 Correct 7 ms 1488 KB Output is correct
35 Correct 1456 ms 149548 KB Output is correct
36 Correct 1216 ms 168712 KB Output is correct
37 Correct 1217 ms 168740 KB Output is correct
38 Correct 1364 ms 171392 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 3 ms 724 KB Output is correct
41 Correct 3 ms 724 KB Output is correct
42 Correct 4 ms 724 KB Output is correct
43 Correct 4 ms 724 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 3 ms 724 KB Output is correct
48 Correct 3 ms 724 KB Output is correct
49 Correct 3 ms 724 KB Output is correct
50 Correct 3 ms 724 KB Output is correct
51 Correct 44 ms 5208 KB Output is correct
52 Correct 46 ms 5192 KB Output is correct
53 Correct 45 ms 5252 KB Output is correct
54 Correct 46 ms 5232 KB Output is correct
55 Correct 2 ms 468 KB Output is correct
56 Correct 3 ms 724 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 39 ms 5224 KB Output is correct
59 Correct 35 ms 5188 KB Output is correct
60 Correct 43 ms 5188 KB Output is correct
61 Correct 38 ms 5252 KB Output is correct
62 Correct 113 ms 15736 KB Output is correct
63 Correct 133 ms 15808 KB Output is correct
64 Correct 150 ms 15792 KB Output is correct
65 Correct 598 ms 62084 KB Output is correct
66 Correct 542 ms 61960 KB Output is correct
67 Correct 7 ms 1488 KB Output is correct
68 Correct 8 ms 1236 KB Output is correct
69 Correct 1426 ms 171196 KB Output is correct
70 Correct 1434 ms 171304 KB Output is correct
71 Correct 1448 ms 171172 KB Output is correct
72 Correct 1202 ms 157424 KB Output is correct
73 Correct 1344 ms 170008 KB Output is correct
74 Correct 1183 ms 157244 KB Output is correct
75 Correct 1459 ms 169940 KB Output is correct