oj.uz

Submission #249893

# Submission time Handle Problem Language Result Execution time Memory
249893 2020-07-16T10:18:38 Z apfelsaft Building 4 (JOI20_building4) C++14
100 / 100
 398 ms 42988 KB 
#include <stdio.h>
#include <algorithm>
#include <string.h>

#define N 1000100
int sufA[N][2];
int sufB[N][2];
int seqA[N];
int seqB[N];
char erg[N];

int main(void){
  int n;  
  scanf("%d",&n);
  for(int i = 0;i<n*2;i++){
    scanf("%d",&seqA[i]);  
  };
  for(int i = 0;i<n*2;i++){
    scanf("%d",&seqB[i]);  
  };
  int pos = 1;
  memset(sufA,-1,sizeof(sufA));
  memset(sufB,-1,sizeof(sufB));
  sufA[0][0] = 1;
  sufA[0][1] = 1;
  sufB[0][0] = 0;
  sufB[0][1] = 0;
  int a = n;
  int b = n;
  for(int i = 1;i<n*2;i++){
    if(seqA[i] >= seqA[i-1] && sufA[i-1][0] != -1){
      sufA[i][0] = sufA[i-1][0]+1;
      sufA[i][1] = sufA[i-1][1]+1;
    };  
    if(seqA[i] >= seqB[i-1] && sufB[i-1][0] != -1){
      if(sufA[i][0] != -1){
	sufA[i][0] = std::min(sufA[i][0],sufB[i-1][0] + 1);  
	sufA[i][1] = std::max(sufA[i][1],sufB[i-1][1] + 1);  
      }else{
	sufA[i][0] = sufB[i-1][0]+1;
	sufA[i][1] = sufB[i-1][1]+1;
      };
    };
    if(seqB[i] >= seqA[i-1] && sufA[i-1][0] != -1){
      sufB[i][0] = sufA[i-1][0];  
      sufB[i][1] = sufA[i-1][1];  
    };
    if(seqB[i] >= seqB[i-1] && sufB[i-1][0] != -1){
      if(sufB[i][0] != -1){
	sufB[i][0] = std::min(sufB[i][0],sufB[i-1][0]);  
	sufB[i][1] = std::max(sufB[i][1],sufB[i-1][1]);  
      }else{
	sufB[i][0] = sufB[i-1][0];  
	sufB[i][1] = sufB[i-1][1];  
      };
    };
    //printf("%d %d %d %d %d\n",i,sufA[i][0],sufA[i][1],sufB[i][0],sufB[i][1]);
  };
  int prev = 2000000000;
  int posA,posB;
  for(int i = 2*n-1;i>=0&&pos;i--){
    posA = 0;
    posB = 0;
    if(sufA[i][0] <= a && sufA[i][1] >= a && seqA[i] <= prev){
      posA = 1;
    }else if(sufB[i][0] <= a && sufB[i][1] >= a && seqB[i] <= prev){
      posB = 1;
    }else{
      pos = 0;
    };  
    if(posA && posB){
      if(seqA[i] >= seqB[i])posB = 0;  
      else posA = 0;
    };
    if(posA){
      prev = seqA[i];
      erg[i] = 'A';  
      a--;
    }else{
      prev = seqB[i];
      erg[i] = 'B';  
    };
  };
  if(pos){
    printf("%s\n",erg);
  }
  else printf("-1\n");
  return 0;
};

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:29:7: warning: unused variable 'b' [-Wunused-variable]
   int b = n;
       ^
building4.cpp:14:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
   ~~~~~^~~~~~~~~
building4.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&seqA[i]);  
     ~~~~~^~~~~~~~~~~~~~~
building4.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&seqB[i]);  
     ~~~~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16000 KB Output is correct
2 Correct 8 ms 16000 KB Output is correct
3 Correct 8 ms 16000 KB Output is correct
4 Correct 8 ms 16000 KB Output is correct
5 Correct 10 ms 16128 KB Output is correct
6 Correct 9 ms 16128 KB Output is correct
7 Correct 13 ms 16128 KB Output is correct
8 Correct 9 ms 16128 KB Output is correct
9 Correct 9 ms 16128 KB Output is correct
10 Correct 10 ms 16000 KB Output is correct
11 Correct 10 ms 16128 KB Output is correct
12 Correct 10 ms 16128 KB Output is correct
13 Correct 9 ms 16128 KB Output is correct
14 Correct 10 ms 16128 KB Output is correct
15 Correct 13 ms 16128 KB Output is correct
16 Correct 9 ms 16128 KB Output is correct
17 Correct 9 ms 16128 KB Output is correct
18 Correct 10 ms 16128 KB Output is correct
19 Correct 13 ms 16128 KB Output is correct
20 Correct 9 ms 16000 KB Output is correct
21 Correct 9 ms 16000 KB Output is correct
22 Correct 9 ms 16000 KB Output is correct
23 Correct 9 ms 16000 KB Output is correct
24 Correct 9 ms 16128 KB Output is correct
25 Correct 9 ms 16000 KB Output is correct
26 Correct 9 ms 16000 KB Output is correct
27 Correct 9 ms 16000 KB Output is correct
28 Correct 9 ms 16000 KB Output is correct
29 Correct 9 ms 16000 KB Output is correct
30 Correct 9 ms 16000 KB Output is correct
31 Correct 9 ms 16000 KB Output is correct
32 Correct 9 ms 16000 KB Output is correct
33 Correct 9 ms 16000 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16000 KB Output is correct
2 Correct 8 ms 16000 KB Output is correct
3 Correct 8 ms 16000 KB Output is correct
4 Correct 8 ms 16000 KB Output is correct
5 Correct 10 ms 16128 KB Output is correct
6 Correct 9 ms 16128 KB Output is correct
7 Correct 13 ms 16128 KB Output is correct
8 Correct 9 ms 16128 KB Output is correct
9 Correct 9 ms 16128 KB Output is correct
10 Correct 10 ms 16000 KB Output is correct
11 Correct 10 ms 16128 KB Output is correct
12 Correct 10 ms 16128 KB Output is correct
13 Correct 9 ms 16128 KB Output is correct
14 Correct 10 ms 16128 KB Output is correct
15 Correct 13 ms 16128 KB Output is correct
16 Correct 9 ms 16128 KB Output is correct
17 Correct 9 ms 16128 KB Output is correct
18 Correct 10 ms 16128 KB Output is correct
19 Correct 13 ms 16128 KB Output is correct
20 Correct 9 ms 16000 KB Output is correct
21 Correct 9 ms 16000 KB Output is correct
22 Correct 9 ms 16000 KB Output is correct
23 Correct 9 ms 16000 KB Output is correct
24 Correct 9 ms 16128 KB Output is correct
25 Correct 9 ms 16000 KB Output is correct
26 Correct 9 ms 16000 KB Output is correct
27 Correct 9 ms 16000 KB Output is correct
28 Correct 9 ms 16000 KB Output is correct
29 Correct 9 ms 16000 KB Output is correct
30 Correct 9 ms 16000 KB Output is correct
31 Correct 9 ms 16000 KB Output is correct
32 Correct 9 ms 16000 KB Output is correct
33 Correct 9 ms 16000 KB Output is correct
34 Correct 394 ms 25664 KB Output is correct
35 Correct 378 ms 39160 KB Output is correct
36 Correct 371 ms 42744 KB Output is correct
37 Correct 369 ms 35836 KB Output is correct
38 Correct 333 ms 35960 KB Output is correct
39 Correct 337 ms 42236 KB Output is correct
40 Correct 343 ms 27640 KB Output is correct
41 Correct 351 ms 42988 KB Output is correct
42 Correct 371 ms 27320 KB Output is correct
43 Correct 385 ms 27640 KB Output is correct
44 Correct 398 ms 27640 KB Output is correct
45 Correct 388 ms 27640 KB Output is correct
46 Correct 356 ms 27596 KB Output is correct
47 Correct 348 ms 27640 KB Output is correct
48 Correct 352 ms 28128 KB Output is correct
49 Correct 347 ms 27640 KB Output is correct
50 Correct 386 ms 27628 KB Output is correct
51 Correct 381 ms 27640 KB Output is correct
52 Correct 277 ms 33428 KB Output is correct
53 Correct 279 ms 33400 KB Output is correct
54 Correct 250 ms 33384 KB Output is correct
55 Correct 253 ms 33272 KB Output is correct
56 Correct 350 ms 27640 KB Output is correct
57 Correct 318 ms 40168 KB Output is correct
58 Correct 304 ms 40248 KB Output is correct
59 Correct 303 ms 40368 KB Output is correct
60 Correct 280 ms 39228 KB Output is correct
61 Correct 298 ms 40740 KB Output is correct
62 Correct 293 ms 40360 KB Output is correct
63 Correct 298 ms 40796 KB Output is correct
64 Correct 289 ms 39952 KB Output is correct
65 Correct 296 ms 40824 KB Output is correct