Submission #1039801

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1039801	2024-07-31 09:26:36	pera	Building 4 (JOI20_building4)	C++17	100 / 100	174 ms	28888 KiB

building4

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 1 , oo = 1e9;
int n;
int A[N][2] , mn[N][2] , mx[N][2];
char t[2] = {'A' , 'B'};
int main(){
   ios_base::sync_with_stdio(false);
   cin.tie(0);
   cout.tie(0);
   cin >> n;
   n *= 2;
   for(int x = 0;x < 2;x ++){
      for(int i = 1;i <= n;i ++){
         cin >> A[i][x];
      }
   }
   for(int i = 1;i <= n;i ++){
      for(int x = 0;x < 2;x ++){
         mn[i][x] = oo;
         mx[i][x] = 0;
         for(int y = 0;y < 2;y ++){
            if(A[i][x] >= A[i - 1][y]){
               mn[i][x] = min(mn[i][x] , mn[i - 1][y] + !x);
               mx[i][x] = max(mx[i][x] , mx[i - 1][y] + !x);
            }
         }
      }
   }
   for(int x = 0;x < 2;x ++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 89 / 89