oj.uz

답안 #217004

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
217004 2020-03-28T17:02:57 Z mhy908 건물 4 (JOI20_building4) C++14
100 / 100
 409 ms 25976 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int inf=2000000000;
int n, a[1000010], b[1000010];
int dpsa[1000010], dpea[1000010], dpsb[1000010], dpeb[1000010];
char ans[1000010];
int main(){
    scanf("%d", &n);
    for(int i=1; i<=n*2; i++)scanf("%d", &a[i]);
    for(int i=1; i<=n*2; i++)scanf("%d", &b[i]);
    for(int i=1; i<=n*2; i++){
        dpsa[i]=dpsb[i]=inf;
        dpea[i]=dpeb[i]=-inf;
        if(a[i-1]<=a[i]){
            dpsa[i]=min(dpsa[i], dpsa[i-1]+1);
            dpea[i]=max(dpea[i], dpea[i-1]+1);
        }
        if(b[i-1]<=a[i]){
            dpsa[i]=min(dpsa[i], dpsb[i-1]+1);
            dpea[i]=max(dpea[i], dpeb[i-1]+1);
        }
        if(a[i-1]<=b[i]){
            dpsb[i]=min(dpsb[i], dpsa[i-1]);
            dpeb[i]=max(dpeb[i], dpea[i-1]);
        }
        if(b[i-1]<=b[i]){
            dpsb[i]=min(dpsb[i], dpsb[i-1]);
            dpeb[i]=max(dpeb[i], dpeb[i-1]);
        }
    }
    if((dpsa[2*n]>n||dpea[2*n]<n)&&(dpsb[2*n]>n||dpeb[2*n]<n))return !printf("-1");
    int anum=n, bnum=n;
    for(int i=2*n; i>=1; i--){
        if(anum&&dpsa[i]<=anum&&dpea[i]>=anum&&((ans[i+1]=='A'&&a[i]<=a[i+1])||(ans[i+1]=='B'&&a[i]<=b[i+1])||i==2*n)){
            anum--;
            ans[i]='A';
        }
        else{
            bnum--;
            ans[i]='B';
        }
    }
    printf("%s", ans+1);
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
building4.cpp:10:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1; i<=n*2; i++)scanf("%d", &a[i]);
                              ~~~~~^~~~~~~~~~~~~
building4.cpp:11:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1; i<=n*2; i++)scanf("%d", &b[i]);
                              ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 8 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 7 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 7 ms 512 KB Output is correct
25 Correct 8 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 6 ms 564 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 399 ms 23520 KB Output is correct
35 Correct 346 ms 24048 KB Output is correct
36 Correct 365 ms 23648 KB Output is correct
37 Correct 355 ms 24068 KB Output is correct
38 Correct 315 ms 24056 KB Output is correct
39 Correct 333 ms 24160 KB Output is correct
40 Correct 349 ms 25660 KB Output is correct
41 Correct 299 ms 24568 KB Output is correct
42 Correct 365 ms 25084 KB Output is correct
43 Correct 409 ms 25976 KB Output is correct
44 Correct 392 ms 25780 KB Output is correct
45 Correct 398 ms 25848 KB Output is correct
46 Correct 390 ms 25832 KB Output is correct
47 Correct 362 ms 25976 KB Output is correct
48 Correct 324 ms 25764 KB Output is correct
49 Correct 341 ms 25824 KB Output is correct
50 Correct 380 ms 25720 KB Output is correct
51 Correct 361 ms 25848 KB Output is correct
52 Correct 256 ms 25848 KB Output is correct
53 Correct 253 ms 25720 KB Output is correct
54 Correct 235 ms 25720 KB Output is correct
55 Correct 238 ms 25720 KB Output is correct
56 Correct 335 ms 25800 KB Output is correct
57 Correct 280 ms 25848 KB Output is correct
58 Correct 272 ms 25720 KB Output is correct
59 Correct 265 ms 25720 KB Output is correct
60 Correct 253 ms 24312 KB Output is correct
61 Correct 275 ms 25720 KB Output is correct
62 Correct 289 ms 25484 KB Output is correct
63 Correct 272 ms 25720 KB Output is correct
64 Correct 269 ms 24952 KB Output is correct
65 Correct 269 ms 25720 KB Output is correct