oj.uz

답안 #519387

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
519387 2022-01-26T09:53:05 Z new_acc 건물 4 (JOI20_building4) C++14
100 / 100
 220 ms 45324 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define rep(a, b) for(int a = 0; a < (b); a++)
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<ll> vl;
const int N=1e6+10;
pair<int,int> dp[N][2];
int t1[N],t2[N];
void solve(){
	int n;
	cin>>n;
	n*=2;
	rep(i,n) cin>>t1[i];
	rep(i,n) cin>>t2[i];
	dp[0][0]={1,1};
	dp[0][1]={0,0};
	for(int i=1;i<n;i++){
		dp[i][0]={-1,-1},dp[i][1]={-1,-1};
		pair<int,int> p1={1000*1000+10,0};
		if(t1[i]>=t1[i-1] and dp[i-1][0].fi!=-1) p1=dp[i-1][0];
		if(t1[i]>=t2[i-1] and dp[i-1][1].fi!=-1) p1.fi=min(p1.fi,dp[i-1][1].fi),p1.se=max(p1.se,dp[i-1][1].se);
		if(p1.fi!=1000*1000+10) dp[i][0]={p1.fi+1,p1.se+1};
		p1={1000*1000+10,0};
		if(t2[i]>=t1[i-1] and dp[i-1][0].fi!=-1) p1=dp[i-1][0];
		if(t2[i]>=t2[i-1] and dp[i-1][1].fi!=-1) p1.fi=min(p1.fi,dp[i-1][1].fi),p1.se=max(p1.se,dp[i-1][1].se);
		if(p1.fi!=1000*1000+10) dp[i][1]=p1;
	}
	if((dp[n-1][0].fi>n/2 or dp[n-1][0].se<n/2) and (dp[n-1][1].fi>n/2 or dp[n-1][1].se<n/2)){cout<<-1<<"\n";return;}
	int curr=n/2,j=n-1,pop=1000*1000*1000+10;
	string s="";
	while(j>=0){
		if(pop>=t1[j] and dp[j][0].se>=curr and dp[j][0].fi<=curr){
			pop=t1[j],curr--;
			s+='A';
		}else{
			s+='B';
			pop=t2[j];
		}
		j--;
	}
	reverse(s.begin(),s.end());
	cout<<s<<"\n";
}
int main(){
	ios_base::sync_with_stdio(0),cin.tie(0);
	solve();
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 2 ms 464 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 380 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 412 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 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 460 KB Output is correct
27 Correct 1 ms 376 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 388 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 384 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 2 ms 464 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 380 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 412 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 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 460 KB Output is correct
27 Correct 1 ms 376 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 388 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 204 ms 42416 KB Output is correct
35 Correct 199 ms 41976 KB Output is correct
36 Correct 194 ms 41340 KB Output is correct
37 Correct 215 ms 42120 KB Output is correct
38 Correct 199 ms 42100 KB Output is correct
39 Correct 211 ms 41364 KB Output is correct
40 Correct 205 ms 44704 KB Output is correct
41 Correct 180 ms 42356 KB Output is correct
42 Correct 214 ms 43776 KB Output is correct
43 Correct 208 ms 45248 KB Output is correct
44 Correct 217 ms 45244 KB Output is correct
45 Correct 208 ms 45216 KB Output is correct
46 Correct 201 ms 45152 KB Output is correct
47 Correct 220 ms 44280 KB Output is correct
48 Correct 211 ms 44096 KB Output is correct
49 Correct 201 ms 44788 KB Output is correct
50 Correct 213 ms 44544 KB Output is correct
51 Correct 209 ms 44400 KB Output is correct
52 Correct 151 ms 33460 KB Output is correct
53 Correct 148 ms 33468 KB Output is correct
54 Correct 128 ms 33536 KB Output is correct
55 Correct 132 ms 33244 KB Output is correct
56 Correct 219 ms 45324 KB Output is correct
57 Correct 173 ms 40284 KB Output is correct
58 Correct 177 ms 40600 KB Output is correct
59 Correct 178 ms 40444 KB Output is correct
60 Correct 170 ms 38400 KB Output is correct
61 Correct 192 ms 40996 KB Output is correct
62 Correct 170 ms 40356 KB Output is correct
63 Correct 175 ms 41080 KB Output is correct
64 Correct 179 ms 39508 KB Output is correct
65 Correct 180 ms 40864 KB Output is correct