Submission #520682

# Submission time Handle Problem Language Result Execution time Memory
520682 2022-01-30T18:43:12 Z ymm Building 4 (JOI20_building4) C++17
100 / 100
243 ms 45236 KB
///
///   Oh? You're approaching me?
///

#include <bits/stdc++.h>
#define Loop(x,l,r) for(ll x = ll(l); x < ll(r); ++x)
#define LoopR(x,l,r) for(ll x = ll(r)-1; x >= ll(l); --x)
#define Kill(x) exit((cout << (x) << '\n', 0))
typedef long long ll;
typedef std::pair<int,int> pii;
typedef std::pair<ll,ll> pll;
using namespace std;

const int N = 1'000'010;

int dpal[N], dpar[N];
int dpbl[N], dpbr[N];
int a[N], b[N];
int n;

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	cin >> n; n*=2;
	//Loop(i,0,n) cout << (a[i]=rand()%100) << ' '; cout << '\n';//cin >> a[i];
	//Loop(i,0,n) cout << (b[i]=rand()%100) << ' '; cout << '\n';//cin >> b[i];
	Loop(i,0,n) cin >> a[i];
	Loop(i,0,n) cin >> b[i];
	dpal[0] = 1; dpar[0] = 2;
	dpbl[0] = 0; dpbr[0] = 1;
	Loop(i,1,n){
		int l, r;

		l = min(a[i-1]<=a[i]?dpal[i-1]:N, b[i-1]<=a[i]?dpbl[i-1]:N);
		r = max(a[i-1]<=a[i]?dpar[i-1]:0, b[i-1]<=a[i]?dpbr[i-1]:0);
		if(r) {dpal[i] = l+1; dpar[i] = r+1;} else {dpal[i] = N; dpar[i] = 0;}

		l = min(a[i-1]<=b[i]?dpal[i-1]:N, b[i-1]<=b[i]?dpbl[i-1]:N);
		r = max(a[i-1]<=b[i]?dpar[i-1]:0, b[i-1]<=b[i]?dpbr[i-1]:0);
		dpbl[i] = l; dpbr[i] = r;

		if(!(!dpar[i] || !dpbr[i] || max(dpal[i], dpbl[i]) <= min(dpar[i], dpbr[i]))){
			cout <<"err\n";
		}
//		cout << dpal[i] << ' ' << dpar[i] << '\n';
//		cout << dpbl[i] << ' ' << dpbr[i] << '\n';
//		cout << '\n';
	}
	if(!(dpal[n-1] <= n/2 && n/2 < dpar[n-1]) && !(dpbl[n-1] <= n/2 && n/2 < dpbr[n-1]))
		Kill(-1);
	int k=n/2, lst=1e9+10;
	string ans;
	LoopR(i,0,n){
		if(dpal[i] <= k && k < dpar[i] && a[i]<=lst){
			ans.push_back('A');
			lst=a[i];
			--k;
		} else {
			ans.push_back('B');
			lst=b[i];
		}
	}
	reverse(ans.begin(), ans.end());
	cout << ans << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 1 ms 388 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 2 ms 580 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 ms 424 KB Output is correct
17 Correct 1 ms 540 KB Output is correct
18 Correct 1 ms 516 KB Output is correct
19 Correct 2 ms 536 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 452 KB Output is correct
27 Correct 1 ms 484 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 456 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 448 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 1 ms 388 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 2 ms 580 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 ms 424 KB Output is correct
17 Correct 1 ms 540 KB Output is correct
18 Correct 1 ms 516 KB Output is correct
19 Correct 2 ms 536 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 452 KB Output is correct
27 Correct 1 ms 484 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 456 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 448 KB Output is correct
34 Correct 202 ms 42300 KB Output is correct
35 Correct 205 ms 42132 KB Output is correct
36 Correct 214 ms 41312 KB Output is correct
37 Correct 212 ms 42100 KB Output is correct
38 Correct 194 ms 42060 KB Output is correct
39 Correct 186 ms 41328 KB Output is correct
40 Correct 206 ms 44748 KB Output is correct
41 Correct 198 ms 42288 KB Output is correct
42 Correct 221 ms 43692 KB Output is correct
43 Correct 215 ms 45232 KB Output is correct
44 Correct 223 ms 45236 KB Output is correct
45 Correct 232 ms 45140 KB Output is correct
46 Correct 211 ms 45180 KB Output is correct
47 Correct 210 ms 44216 KB Output is correct
48 Correct 225 ms 44012 KB Output is correct
49 Correct 243 ms 44728 KB Output is correct
50 Correct 213 ms 44352 KB Output is correct
51 Correct 240 ms 44344 KB Output is correct
52 Correct 172 ms 33432 KB Output is correct
53 Correct 151 ms 33484 KB Output is correct
54 Correct 156 ms 33420 KB Output is correct
55 Correct 139 ms 33208 KB Output is correct
56 Correct 214 ms 45228 KB Output is correct
57 Correct 186 ms 40392 KB Output is correct
58 Correct 183 ms 40344 KB Output is correct
59 Correct 179 ms 40376 KB Output is correct
60 Correct 169 ms 38344 KB Output is correct
61 Correct 194 ms 40816 KB Output is correct
62 Correct 192 ms 40304 KB Output is correct
63 Correct 186 ms 41084 KB Output is correct
64 Correct 181 ms 39580 KB Output is correct
65 Correct 190 ms 40880 KB Output is correct