oj.uz

답안 #285436

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
285436 2020-08-28T23:51:31 Z YJU 건물 4 (JOI20_building4) C++14
100 / 100
 315 ms 75988 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll MOD=1e9+7;
const ll N=2e6+5;
const ld pi=3.14159265359;
const ll INF=(1LL<<60);
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(a) (ll)a.size()
 
ll n,u[N][2],mn[N][2],mx[N][2];
vector<ll> ans;
 
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n;
	n*=2;
	REP(j,2)REP1(i,n)cin>>u[i][j];
	mn[1][0]=mx[1][0]=0;
	mn[1][1]=mx[1][1]=1;
	for(int i=2;i<=n;i++){
		mn[i][0]=mn[i][1]=INF;mx[i][0]=mx[i][1]=-INF;
		REP(take,2)REP(lst,2){
			if(u[i][take]>=u[i-1][lst]){
				mn[i][take]=min(mn[i][take],mn[i-1][lst]+take);
				mx[i][take]=max(mx[i][take],mx[i-1][lst]+take);
			}
		}
	}
	ll le=n/2,lst=INF;
	for(int i=n;i>=1;i--){
		ll flag=-1;
		REP(take,2){
			if(u[i][take]<=lst&&mn[i][take]<=le&&le<=mx[i][take]){
				flag=take;
				lst=u[i][take];
				break;
			}
		}
		if(flag==-1){cout<<"-1\n";return 0;}
		ans.pb(flag);le-=flag;
	}
	reverse(ans.begin(),ans.end());
	for(ll i:ans)cout<<(i?'B':'A');
	cout<<"\n";
	return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 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 1 ms 512 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 2 ms 640 KB Output is correct
19 Correct 2 ms 768 KB Output is correct
20 Correct 1 ms 640 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 1 ms 640 KB Output is correct
23 Correct 2 ms 640 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 2 ms 640 KB Output is correct
26 Correct 2 ms 640 KB Output is correct
27 Correct 2 ms 640 KB Output is correct
28 Correct 1 ms 640 KB Output is correct
29 Correct 2 ms 640 KB Output is correct
30 Correct 1 ms 640 KB Output is correct
31 Correct 2 ms 640 KB Output is correct
32 Correct 1 ms 640 KB Output is correct
33 Correct 1 ms 640 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 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 1 ms 512 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 2 ms 640 KB Output is correct
19 Correct 2 ms 768 KB Output is correct
20 Correct 1 ms 640 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 1 ms 640 KB Output is correct
23 Correct 2 ms 640 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 2 ms 640 KB Output is correct
26 Correct 2 ms 640 KB Output is correct
27 Correct 2 ms 640 KB Output is correct
28 Correct 1 ms 640 KB Output is correct
29 Correct 2 ms 640 KB Output is correct
30 Correct 1 ms 640 KB Output is correct
31 Correct 2 ms 640 KB Output is correct
32 Correct 1 ms 640 KB Output is correct
33 Correct 1 ms 640 KB Output is correct
34 Correct 266 ms 65656 KB Output is correct
35 Correct 286 ms 70248 KB Output is correct
36 Correct 285 ms 69112 KB Output is correct
37 Correct 307 ms 70612 KB Output is correct
38 Correct 276 ms 70376 KB Output is correct
39 Correct 269 ms 69864 KB Output is correct
40 Correct 297 ms 74964 KB Output is correct
41 Correct 273 ms 71172 KB Output is correct
42 Correct 296 ms 73172 KB Output is correct
43 Correct 311 ms 75604 KB Output is correct
44 Correct 310 ms 75652 KB Output is correct
45 Correct 312 ms 75604 KB Output is correct
46 Correct 296 ms 75604 KB Output is correct
47 Correct 315 ms 74852 KB Output is correct
48 Correct 304 ms 74616 KB Output is correct
49 Correct 298 ms 75316 KB Output is correct
50 Correct 304 ms 74832 KB Output is correct
51 Correct 310 ms 74808 KB Output is correct
52 Correct 229 ms 63964 KB Output is correct
53 Correct 227 ms 63940 KB Output is correct
54 Correct 213 ms 63956 KB Output is correct
55 Correct 220 ms 63580 KB Output is correct
56 Correct 297 ms 75988 KB Output is correct
57 Correct 262 ms 70484 KB Output is correct
58 Correct 281 ms 70868 KB Output is correct
59 Correct 261 ms 70864 KB Output is correct
60 Correct 253 ms 66976 KB Output is correct
61 Correct 263 ms 71380 KB Output is correct
62 Correct 275 ms 70208 KB Output is correct
63 Correct 279 ms 71524 KB Output is correct
64 Correct 262 ms 68944 KB Output is correct
65 Correct 267 ms 71388 KB Output is correct