oj.uz

답안 #320788

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
320788 2020-11-09T23:16:43 Z aZvezda 건물 4 (JOI20_building4) C++14
100 / 100
 351 ms 83416 KB 
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

const ll MAX_N = 1e6 + 10;
ll n;
ll arr[MAX_N][2];	

ll dpLow[MAX_N][2], dpHigh[MAX_N][2];

bool output(ll x, ll y, ll got = mod) {
	if(x == -1) {return true;}

	if(dpLow[x][0] <= y && y <= dpHigh[x][0] && arr[x][0] <= got) {
		output(x - 1, y, arr[x][0]);
		cout << "A";
		return true;
	} else if(dpLow[x][1] <= y && y <= dpHigh[x][1] && arr[x][1] <= got) {	
		output(x - 1, y - 1, arr[x][1]);
		cout << "B";
		return true;
	}
	return false;
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	cin >> n;
	n *= 2;
	for(ll j = 0; j < 2; j ++) {
		for(ll i = 0; i < n; i ++ ){
			cin >> arr[i][j];
		}
	}
	
	for(ll i = 0; i < n; i ++) {
		dpLow[i][0] = dpLow[i][1] = mod;
		dpHigh[i][0] = dpHigh[i][1] = -mod;
	}
	
	dpLow[0][0] = 0; dpHigh[0][0] = 0;
	dpLow[0][1] = 1; dpHigh[0][1] = 1;
	
	for(ll i = 0; i < n; i ++) {
		for(ll j = 0; j < 2; j ++) {
			ll now = arr[i][j];
			if(now <= arr[i + 1][0]) {
				chkmin(dpLow[i + 1][0], dpLow[i][j]);
				chkmax(dpHigh[i + 1][0], dpHigh[i][j]);
			}
			if(now <= arr[i + 1][1]) {
				chkmin(dpLow[i + 1][1], dpLow[i][j] + 1);
				chkmax(dpHigh[i + 1][1], dpHigh[i][j] + 1);
			}
		}
	}
	if(!output(n - 1, n / 2)) {
		cout << -1 << endl;
	} 
	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 2 ms 620 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 2 ms 620 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 2 ms 620 KB Output is correct
19 Correct 2 ms 620 KB Output is correct
20 Correct 2 ms 748 KB Output is correct
21 Correct 1 ms 620 KB Output is correct
22 Correct 1 ms 620 KB Output is correct
23 Correct 2 ms 620 KB Output is correct
24 Correct 2 ms 620 KB Output is correct
25 Correct 1 ms 760 KB Output is correct
26 Correct 2 ms 620 KB Output is correct
27 Correct 1 ms 620 KB Output is correct
28 Correct 1 ms 620 KB Output is correct
29 Correct 1 ms 620 KB Output is correct
30 Correct 1 ms 620 KB Output is correct
31 Correct 3 ms 620 KB Output is correct
32 Correct 1 ms 620 KB Output is correct
33 Correct 1 ms 620 KB Output is correct
34 Correct 264 ms 60668 KB Output is correct
35 Correct 299 ms 77284 KB Output is correct
36 Correct 327 ms 76160 KB Output is correct
37 Correct 300 ms 77800 KB Output is correct
38 Correct 300 ms 77540 KB Output is correct
39 Correct 303 ms 76888 KB Output is correct
40 Correct 303 ms 82760 KB Output is correct
41 Correct 329 ms 78584 KB Output is correct
42 Correct 317 ms 80608 KB Output is correct
43 Correct 325 ms 83412 KB Output is correct
44 Correct 326 ms 83300 KB Output is correct
45 Correct 330 ms 83296 KB Output is correct
46 Correct 351 ms 83252 KB Output is correct
47 Correct 320 ms 82660 KB Output is correct
48 Correct 307 ms 82260 KB Output is correct
49 Correct 307 ms 83172 KB Output is correct
50 Correct 334 ms 82596 KB Output is correct
51 Correct 338 ms 82684 KB Output is correct
52 Correct 283 ms 71652 KB Output is correct
53 Correct 267 ms 71668 KB Output is correct
54 Correct 225 ms 71644 KB Output is correct
55 Correct 237 ms 71396 KB Output is correct
56 Correct 304 ms 83416 KB Output is correct
57 Correct 282 ms 78308 KB Output is correct
58 Correct 302 ms 78564 KB Output is correct
59 Correct 325 ms 78532 KB Output is correct
60 Correct 270 ms 74212 KB Output is correct
61 Correct 290 ms 78980 KB Output is correct
62 Correct 273 ms 77924 KB Output is correct
63 Correct 305 ms 79224 KB Output is correct
64 Correct 269 ms 76356 KB Output is correct
65 Correct 277 ms 79160 KB Output is correct