Submission #304951

# Submission time Handle Problem Language Result Execution time Memory
304951 2020-09-22T09:11:18 Z LifeHappen__ Building 4 (JOI20_building4) C++14
100 / 100
393 ms 115824 KB
#include<bits/stdc++.h>

using namespace std;

#define forinc(a,b,c) for(int a=b, __c=c; a<=__c; ++a)
#define fordec(a,b,c) for(int a=b, __c=c; a>=__c; --a)
#define forv(a,b) for(auto &a:b)

#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(a) begin(a),end(a)
#define reset(f,x) memset(f,x,sizeof(f))
#define fasty ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)

const int N=1e6+5;
int n,a[N][2],dd[N][2];
ii f[N][2];

void dfs(int i,int j){
   if(dd[i][j]) return;
   dd[i][j]=1;
   int mi=1e9, ma=-1e9;
   if(a[i][j]<=a[i+1][0]){
      dfs(i+1,0);
      mi=min(mi,f[i+1][0].fi+1); ma=max(ma, f[i+1][0].se+1);
   }
   if(a[i][j]<=a[i+1][1]){
      dfs(i+1,1);
      mi=min(mi,f[i+1][1].fi); ma=max(ma, f[i+1][1].se);
   }
   f[i][j]={mi,ma};
}

int32_t main(){
   fasty;

   #define task "build"
   if(fopen(task".in","r")) freopen(task".in","r",stdin);

   cin>>n; n*=2;
   forinc(_,0,1) forinc(i,1,n) cin>>a[i][_];
   dd[n][0]=dd[n][1]=1;
   dfs(0,0);
   if(f[0][0].fi>n/2 || f[0][0].fi>f[0][0].se) return cout<<-1,0;

   int pre=0, re=n/2;
   forinc(i,1,n){
      if(a[i][0]>=a[i-1][pre] && f[i][0].fi<=re-1 && re-1<=f[i][0].se){
         pre=0;
         re--;
         cout<<"A";
      }else{
         pre=1;
         cout<<"B";
      }
   }
}

Compilation message

building4.cpp: In function 'int32_t main()':
building4.cpp:41:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   41 |    if(fopen(task".in","r")) freopen(task".in","r",stdin);
      |                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 2 ms 768 KB Output is correct
12 Correct 2 ms 768 KB Output is correct
13 Correct 2 ms 768 KB Output is correct
14 Correct 2 ms 768 KB Output is correct
15 Correct 2 ms 768 KB Output is correct
16 Correct 2 ms 768 KB Output is correct
17 Correct 2 ms 768 KB Output is correct
18 Correct 2 ms 768 KB Output is correct
19 Correct 2 ms 768 KB Output is correct
20 Correct 2 ms 768 KB Output is correct
21 Correct 2 ms 800 KB Output is correct
22 Correct 2 ms 768 KB Output is correct
23 Correct 2 ms 768 KB Output is correct
24 Correct 2 ms 768 KB Output is correct
25 Correct 2 ms 768 KB Output is correct
26 Correct 2 ms 768 KB Output is correct
27 Correct 2 ms 768 KB Output is correct
28 Correct 2 ms 768 KB Output is correct
29 Correct 2 ms 768 KB Output is correct
30 Correct 2 ms 768 KB Output is correct
31 Correct 2 ms 768 KB Output is correct
32 Correct 1 ms 768 KB Output is correct
33 Correct 2 ms 768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 2 ms 768 KB Output is correct
12 Correct 2 ms 768 KB Output is correct
13 Correct 2 ms 768 KB Output is correct
14 Correct 2 ms 768 KB Output is correct
15 Correct 2 ms 768 KB Output is correct
16 Correct 2 ms 768 KB Output is correct
17 Correct 2 ms 768 KB Output is correct
18 Correct 2 ms 768 KB Output is correct
19 Correct 2 ms 768 KB Output is correct
20 Correct 2 ms 768 KB Output is correct
21 Correct 2 ms 800 KB Output is correct
22 Correct 2 ms 768 KB Output is correct
23 Correct 2 ms 768 KB Output is correct
24 Correct 2 ms 768 KB Output is correct
25 Correct 2 ms 768 KB Output is correct
26 Correct 2 ms 768 KB Output is correct
27 Correct 2 ms 768 KB Output is correct
28 Correct 2 ms 768 KB Output is correct
29 Correct 2 ms 768 KB Output is correct
30 Correct 2 ms 768 KB Output is correct
31 Correct 2 ms 768 KB Output is correct
32 Correct 1 ms 768 KB Output is correct
33 Correct 2 ms 768 KB Output is correct
34 Correct 227 ms 8176 KB Output is correct
35 Correct 334 ms 103032 KB Output is correct
36 Correct 326 ms 101368 KB Output is correct
37 Correct 332 ms 103544 KB Output is correct
38 Correct 330 ms 103416 KB Output is correct
39 Correct 330 ms 103928 KB Output is correct
40 Correct 360 ms 110584 KB Output is correct
41 Correct 361 ms 105720 KB Output is correct
42 Correct 351 ms 107768 KB Output is correct
43 Correct 379 ms 111176 KB Output is correct
44 Correct 362 ms 111096 KB Output is correct
45 Correct 360 ms 111100 KB Output is correct
46 Correct 382 ms 111108 KB Output is correct
47 Correct 355 ms 111188 KB Output is correct
48 Correct 363 ms 111224 KB Output is correct
49 Correct 371 ms 111224 KB Output is correct
50 Correct 367 ms 111224 KB Output is correct
51 Correct 375 ms 111072 KB Output is correct
52 Correct 351 ms 115724 KB Output is correct
53 Correct 291 ms 115704 KB Output is correct
54 Correct 284 ms 115704 KB Output is correct
55 Correct 306 ms 115824 KB Output is correct
56 Correct 393 ms 111096 KB Output is correct
57 Correct 357 ms 114296 KB Output is correct
58 Correct 353 ms 114816 KB Output is correct
59 Correct 330 ms 114884 KB Output is correct
60 Correct 316 ms 108152 KB Output is correct
61 Correct 339 ms 114808 KB Output is correct
62 Correct 337 ms 113272 KB Output is correct
63 Correct 342 ms 114808 KB Output is correct
64 Correct 328 ms 111124 KB Output is correct
65 Correct 342 ms 114808 KB Output is correct