oj.uz

답안 #129973

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129973 2019-07-13T16:54:24 Z gs14004 Arranging Tickets (JOI17_arranging_tickets) C++17
45 / 100
 51 ms 380 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 505;
using pi = pair<int, int>;
 
int n, m;
int a[MAXN], b[MAXN], c[MAXN];
 
bool Do(vector<int> l, vector<int> r, vector<pi> intv, int K){
	l[0] = r[0] = 1e9;
	for(int i=1; i<l.size(); i++) l[i] = min(l[i], l[i - 1]);
	for(int i=1; i<r.size(); i++) r[i] = min(r[i], r[i - 1]);
	l.push_back(0);
	sort(intv.begin(), intv.end());
	priority_queue<int, vector<int>, greater<int>> pq;
	int ptr = 0;
	vector<int> opt(r.size());
	for(int i=0; i + 1<l.size(); i++){
		while(ptr < intv.size() && intv[ptr].first <= i){
			pq.push(intv[ptr++].second);
		}
		while(l[i + 1] < K){
			if(pq.empty()) return 0;
			int nxt = pq.top(); pq.pop();
			opt[nxt]++;
			K--;
		}
	}
	for(int i=opt.size()-2; i>=0; i--) opt[i] += opt[i + 1];
	for(int i=0; i<r.size(); i++){
		if(opt[i] > r[i]) return false;
	}
	return true;
}
 
bool trial(int x){
	int cnt[MAXN] = {};
	for(int i=0; i<m; i++){
		for(int j=a[i]; j<b[i]; j++) cnt[j]++;
	}
	int mx = *max_element(cnt + 1, cnt + n + 1);
	if(mx <= x) return true;
	for(int i=mx-x; i<=mx-x+1 && i<=m; i++){
		vector<int> surp(n - 1);
		for(int j=0; j<n-1; j++){
			surp[j] = x + i - cnt[j + 1];
			surp[j] /= 2;
		}
		// number of reversal
		for(int j=1; j<n; j++){ // where to cut
			vector<pi> intv;
			for(int k=0; k<m; k++){
				if(a[k] <= j && b[k] > j){
					intv.emplace_back(a[k] - 1, n - b[k]);
				}
			}
			vector<int> l = {0};
			vector<int> r = {0};
			for(int k=0; k<j-1; k++) l.push_back(surp[k]);
			for(int k=n-2; k>=j; k--) r.push_back(surp[k]);
			if(Do(l, r, intv, i)) return true;
		}
	}
	return false;
}
 
int main(){
	cin >> n >> m;
	if(n + m > 600) return 0;
	for(int i=0; i<m; i++){
		cin >> a[i] >> b[i] >> c[i];
		if(a[i] > b[i]) swap(a[i], b[i]);
	}
	int s = 0, e = 1000;
	while(s != e){
		int m = (s+e)/2;
		if(trial(m)) e = m;
		else s = m+1;
	}
	cout << s << endl;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 49 ms 252 KB Output is correct
17 Correct 27 ms 376 KB Output is correct
18 Correct 44 ms 376 KB Output is correct
19 Correct 25 ms 376 KB Output is correct
20 Correct 40 ms 256 KB Output is correct
21 Correct 50 ms 376 KB Output is correct
22 Correct 27 ms 376 KB Output is correct
23 Correct 32 ms 376 KB Output is correct
24 Correct 36 ms 376 KB Output is correct
25 Correct 25 ms 380 KB Output is correct
26 Correct 51 ms 376 KB Output is correct
27 Correct 40 ms 376 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 49 ms 252 KB Output is correct
17 Correct 27 ms 376 KB Output is correct
18 Correct 44 ms 376 KB Output is correct
19 Correct 25 ms 376 KB Output is correct
20 Correct 40 ms 256 KB Output is correct
21 Correct 50 ms 376 KB Output is correct
22 Correct 27 ms 376 KB Output is correct
23 Correct 32 ms 376 KB Output is correct
24 Correct 36 ms 376 KB Output is correct
25 Correct 25 ms 380 KB Output is correct
26 Correct 51 ms 376 KB Output is correct
27 Correct 40 ms 376 KB Output is correct
28 Incorrect 2 ms 256 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 49 ms 252 KB Output is correct
17 Correct 27 ms 376 KB Output is correct
18 Correct 44 ms 376 KB Output is correct
19 Correct 25 ms 376 KB Output is correct
20 Correct 40 ms 256 KB Output is correct
21 Correct 50 ms 376 KB Output is correct
22 Correct 27 ms 376 KB Output is correct
23 Correct 32 ms 376 KB Output is correct
24 Correct 36 ms 376 KB Output is correct
25 Correct 25 ms 380 KB Output is correct
26 Correct 51 ms 376 KB Output is correct
27 Correct 40 ms 376 KB Output is correct
28 Incorrect 2 ms 256 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 49 ms 252 KB Output is correct
17 Correct 27 ms 376 KB Output is correct
18 Correct 44 ms 376 KB Output is correct
19 Correct 25 ms 376 KB Output is correct
20 Correct 40 ms 256 KB Output is correct
21 Correct 50 ms 376 KB Output is correct
22 Correct 27 ms 376 KB Output is correct
23 Correct 32 ms 376 KB Output is correct
24 Correct 36 ms 376 KB Output is correct
25 Correct 25 ms 380 KB Output is correct
26 Correct 51 ms 376 KB Output is correct
27 Correct 40 ms 376 KB Output is correct
28 Incorrect 2 ms 256 KB Output isn't correct
29 Halted 0 ms 0 KB -