oj.uz

답안 #213580

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
213580 2020-03-26T08:13:55 Z tmwilliamlin168 건물 4 (JOI20_building4) C++14
100 / 100
 349 ms 35556 KB 
#include <bits/stdc++.h>
using namespace std;

const int mxN=5e5;
int n;
pair<int, char> p[2][2*mxN];
bool b[2][2*mxN];
char ans[2*mxN];
vector<array<int, 4>> r;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	for(int j : {0, 1}) {
		for(int i=0; i<2*n; ++i) {
			cin >> p[j][i].first;
			p[j][i].second='A'+j;
		}
	}
	for(int i=0; i<2*n; ++i) {
		if(p[0][i].first>p[1][i].first)
			swap(p[0][i], p[1][i]);
		if(i) {
			if(p[0][i-1].first>p[1][i].first) {
				cout << -1;
				return 0;
			}
			if(p[1][i-1].first>p[1][i].first) {
				b[0][i-1]=1;
			}
			if(p[0][i].first<p[0][i-1].first) {
				b[1][i]=1;
			}
			if(p[0][i].first<p[1][i-1].first) {
				//must choose 1 of (1, i) or (0, i-1)
				if(b[1][i-1])
					b[1][i]=1;
			}
		}
	}
	for(int i=2*n-1; i; --i) {
		if(p[0][i].first<p[1][i-1].first) {
			if(b[0][i])
				b[0][i-1]=1;
		}
	}
	for(int i=0; i<2*n; ++i) {
		if(b[0][i]&&b[1][i]) {
			cout << -1;
			return 0;
		}
	}
	int l[2]={n, n};
	for(int i=0; i<2*n; ++i) {
		for(int j : {0, 1}) {
			if(b[j][i]) {
				ans[i]=p[j][i].second;
				--l[p[j][i].second-'A'];
			}
		}
	}
	int mns=0, mxs=0;
	for(int i=0, j=0; i<2*n; i=j) {
		if(b[0][i]||b[1][i]) {
			++j;
			continue;
		}
		for(++j; j<2*n&&!b[0][j]&&!b[1][j]&&p[0][j].first<p[1][j-1].first; ++j);
		int c=0;
		for(int k=i; k<j; ++k)
			c+=p[0][k].second=='A';
		int mn=c, mx=c;
		for(int k=j-1; k>=i; --k) {
			c-=p[0][k].second=='A';
			c+=p[1][k].second=='A';
			mn=min(mn, c);
			mx=max(mx, c);
		}
		r.push_back({i, j, mn, mx});
		mns+=mn;
		mxs+=mx;
	}
	if(l[0]<mns||l[0]>mxs) {
		cout << -1;
		return 0;
	}
	l[0]-=mns;
	for(array<int, 4> ri : r) {
		int need=min(l[0], ri[3]-ri[2]);
		l[0]-=need;
		int c=0;
		for(int k=ri[0]; k<ri[1]; ++k) {
			c+=p[0][k].second=='A';
			ans[k]=p[0][k].second;
		}
		if(c-ri[2]==need)
			continue;
		for(int k=ri[1]-1; k>=ri[0]; --k) {
			c-=p[0][k].second=='A';
			c+=p[1][k].second=='A';
			ans[k]=p[1][k].second;
			if(c-ri[2]==need) {
				break;
			}
		}
	}
	for(int i=0; i<2*n; ++i)
		cout << ans[i];
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 6 ms 256 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 5 ms 640 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 6 ms 256 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 5 ms 640 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 277 ms 15736 KB Output is correct
35 Correct 329 ms 18496 KB Output is correct
36 Correct 326 ms 18296 KB Output is correct
37 Correct 336 ms 18680 KB Output is correct
38 Correct 349 ms 34148 KB Output is correct
39 Correct 296 ms 22368 KB Output is correct
40 Correct 339 ms 26216 KB Output is correct
41 Correct 292 ms 17144 KB Output is correct
42 Correct 320 ms 18424 KB Output is correct
43 Correct 332 ms 19960 KB Output is correct
44 Correct 333 ms 19960 KB Output is correct
45 Correct 334 ms 19960 KB Output is correct
46 Correct 347 ms 33856 KB Output is correct
47 Correct 334 ms 24032 KB Output is correct
48 Correct 324 ms 23268 KB Output is correct
49 Correct 348 ms 26344 KB Output is correct
50 Correct 329 ms 19960 KB Output is correct
51 Correct 346 ms 19960 KB Output is correct
52 Correct 213 ms 19960 KB Output is correct
53 Correct 204 ms 19960 KB Output is correct
54 Correct 207 ms 35520 KB Output is correct
55 Correct 207 ms 35556 KB Output is correct
56 Correct 315 ms 18040 KB Output is correct
57 Correct 284 ms 18424 KB Output is correct
58 Correct 292 ms 18552 KB Output is correct
59 Correct 284 ms 18040 KB Output is correct
60 Correct 265 ms 17784 KB Output is correct
61 Correct 280 ms 18808 KB Output is correct
62 Correct 276 ms 18684 KB Output is correct
63 Correct 286 ms 18936 KB Output is correct
64 Correct 268 ms 18168 KB Output is correct
65 Correct 289 ms 18808 KB Output is correct