oj.uz

Submission #295880

# Submission time Handle Problem Language Result Execution time Memory
295880 2020-09-10T05:11:52 Z eggag32 Building 4 (JOI20_building4) C++17
100 / 100
 323 ms 48472 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
const int mxN = 1e6 + 5;

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

int a[mxN][2];
int mx[mxN][2], mn[mxN][2];

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	int n;
	cin >> n;
	n *= 2;
	rep(j, 2) repn(i, 1, n + 1) cin >> a[i][j];
	repn(i, 1, n + 1){
		rep(j, 2){ //what we take
			mn[i][j] = 1e9, mx[i][j] = -1e9;
			rep(k, 2){
				//what we update from
				if(mn[i - 1][k] < 0 || a[i][j] < a[i - 1][k]) continue;
				mn[i][j] = min(mn[i][j], mn[i - 1][k] + (j == 0));
				mx[i][j] = max(mx[i][j], mx[i - 1][k] + (j == 0));
			}
		}
	}
	vi ans;
	if(mn[n][0] <= n / 2 && mx[n][0] >= n / 2) ans.pb(0);
	else if(mn[n][1] <= n / 2 && mx[n][1] >= n / 2) ans.pb(1);
	else{
		cout << -1 << endl;
		return 0;
	}
	int len = n / 2;
	for(int i = n - 1; i >= 1; i--){
		int lst = ans.back();
		if(lst == 0) len--;
		rep(j, 2){
			if(mx[i][j] < 0 || a[i + 1][lst] < a[i][j]) continue;
			if(mn[i][j] <= len && mx[i][j] >= len){
				ans.pb(j);
				break;
			}
		}
	}
	for(int i = n - 1; i >= 0; i--) cout << (char)('A' + ans[i]);
	cout << endl;
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 4 ms 512 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 2 ms 512 KB Output is correct
34 Correct 257 ms 41976 KB Output is correct
35 Correct 290 ms 44896 KB Output is correct
36 Correct 275 ms 44004 KB Output is correct
37 Correct 279 ms 44896 KB Output is correct
38 Correct 267 ms 45032 KB Output is correct
39 Correct 265 ms 44264 KB Output is correct
40 Correct 285 ms 47832 KB Output is correct
41 Correct 270 ms 45152 KB Output is correct
42 Correct 287 ms 46688 KB Output is correct
43 Correct 303 ms 48228 KB Output is correct
44 Correct 323 ms 48224 KB Output is correct
45 Correct 322 ms 48224 KB Output is correct
46 Correct 278 ms 48224 KB Output is correct
47 Correct 316 ms 47460 KB Output is correct
48 Correct 304 ms 47108 KB Output is correct
49 Correct 284 ms 47968 KB Output is correct
50 Correct 298 ms 47456 KB Output is correct
51 Correct 304 ms 47456 KB Output is correct
52 Correct 245 ms 36576 KB Output is correct
53 Correct 239 ms 36576 KB Output is correct
54 Correct 204 ms 36452 KB Output is correct
55 Correct 207 ms 36192 KB Output is correct
56 Correct 296 ms 48472 KB Output is correct
57 Correct 256 ms 43360 KB Output is correct
58 Correct 251 ms 43488 KB Output is correct
59 Correct 256 ms 43616 KB Output is correct
60 Correct 235 ms 41320 KB Output is correct
61 Correct 252 ms 43908 KB Output is correct
62 Correct 269 ms 43424 KB Output is correct
63 Correct 262 ms 44000 KB Output is correct
64 Correct 276 ms 42468 KB Output is correct
65 Correct 258 ms 44004 KB Output is correct