oj.uz

Submission #473619

# Submission time Handle Problem Language Result Execution time Memory
473619 2021-09-15T17:30:31 Z keta_tsimakuridze Building 4 (JOI20_building4) C++14
100 / 100
 543 ms 78372 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define pii pair<int,int>
using namespace std;
const int N = 1e6 + 5, mod = 1e9 + 7; // !
int t, a[N], b[N], n, c[N], pos[N];
map<int,int> id;
main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin >> n;
	n *= 2;
	for(int i = 1; i <= n; i++) cin >> a[i];
	for(int i = 1; i <= n; i++) cin >> b[i];
	int sum  = 0;
	for(int i = 1; i <= n; i++) {
		if(c[i - 1] > max(a[i],b[i]))  {
			cout << -1;
			return 0;
		}
		if(c[i - 1] > min(a[i],b[i])) {
			c[i] = max(a[i],b[i]);
			if(a[i] < b[i]) pos[i] = 1;
			else pos[i] = -1;
		}
		else {
			c[i] = min(a[i],b[i]);
			if(a[i] < b[i]) pos[i] = -1;
			else pos[i] = 1;
		}
		sum += pos[i];
	}
	int changed = 0;
	if(sum > 0) {
		changed = 1;
		swap(a,b);
		for(int i = 1; i <= n; i++) {
			pos[i] *= - 1;
		}
		sum = -sum;
	}
	sum = -sum;
	for(int i = 1; i <= n; i++) {
		int j = i; 
		if(c[j] == max(a[j],b[j]) && a[j] != b[j]) continue;
		int f = 0;
		while(j < n) {
			if(max(a[j + 1],b[j + 1]) < max(a[j],b[j])) {
				f = 1; break;
			}
			if(max(a[j],b[j]) <= c[j + 1]) {
				break;
			}
			else j++;
		}
		if(!f) { 
			int max_ = 0, cur = 0;
			id.clear();
			id[0] = j + 1;
			for(int k = j; k >= i; k--) {
				cur += -2 * pos[k];
				id[cur] = k;
				if(cur > max_) {
					max_ = cur;
				} 
			}
			if (max_ <= sum) {
				sum -= max_;
				for(int k = j; k >= id[max_]; k--) {
					pos[k] *= -1;
				}
			}
			else {
				for(int k = j; k >= id[sum]; k--) {
					pos[k] *= -1;
				}
				sum = 0;
			}	
		}
		i = j;
	}
	if(sum) {
		cout << -1;
		return 0;
	}
	sum = 0;
	for(int i = 1; i <= n; i++) {
		if(changed) pos[i] *= -1;
		if(pos[i] == 1) cout << 'B';
		else cout << 'A';
		sum += pos[i];
	}
}

Compilation message

building4.cpp:9:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    9 | main(){
      | ^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8140 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 6 ms 8140 KB Output is correct
4 Correct 6 ms 8140 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 7 ms 8140 KB Output is correct
9 Correct 8 ms 8140 KB Output is correct
10 Correct 7 ms 8268 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 8 ms 8140 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 8 ms 8176 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 7 ms 8140 KB Output is correct
21 Correct 7 ms 8140 KB Output is correct
22 Correct 7 ms 8168 KB Output is correct
23 Correct 7 ms 8268 KB Output is correct
24 Correct 8 ms 8188 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 2 ms 588 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8140 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 6 ms 8140 KB Output is correct
4 Correct 6 ms 8140 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 7 ms 8140 KB Output is correct
9 Correct 8 ms 8140 KB Output is correct
10 Correct 7 ms 8268 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 8 ms 8140 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 8 ms 8176 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 7 ms 8140 KB Output is correct
21 Correct 7 ms 8140 KB Output is correct
22 Correct 7 ms 8168 KB Output is correct
23 Correct 7 ms 8268 KB Output is correct
24 Correct 8 ms 8188 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 2 ms 588 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 239 ms 7972 KB Output is correct
35 Correct 276 ms 15760 KB Output is correct
36 Correct 273 ms 15392 KB Output is correct
37 Correct 285 ms 15812 KB Output is correct
38 Correct 384 ms 16308 KB Output is correct
39 Correct 294 ms 16452 KB Output is correct
40 Correct 325 ms 16824 KB Output is correct
41 Correct 538 ms 61172 KB Output is correct
42 Correct 292 ms 16480 KB Output is correct
43 Correct 307 ms 16900 KB Output is correct
44 Correct 296 ms 16968 KB Output is correct
45 Correct 305 ms 16892 KB Output is correct
46 Correct 383 ms 16844 KB Output is correct
47 Correct 319 ms 17020 KB Output is correct
48 Correct 313 ms 16836 KB Output is correct
49 Correct 319 ms 16848 KB Output is correct
50 Correct 302 ms 16904 KB Output is correct
51 Correct 296 ms 16836 KB Output is correct
52 Correct 237 ms 16836 KB Output is correct
53 Correct 232 ms 16836 KB Output is correct
54 Correct 293 ms 16964 KB Output is correct
55 Correct 280 ms 16912 KB Output is correct
56 Correct 536 ms 58296 KB Output is correct
57 Correct 350 ms 28612 KB Output is correct
58 Correct 390 ms 43256 KB Output is correct
59 Correct 543 ms 78372 KB Output is correct
60 Correct 290 ms 30404 KB Output is correct
61 Correct 302 ms 32324 KB Output is correct
62 Correct 297 ms 31832 KB Output is correct
63 Correct 296 ms 32132 KB Output is correct
64 Correct 293 ms 31232 KB Output is correct
65 Correct 306 ms 32500 KB Output is correct