제출 #1109353

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1109353	2024-11-06 14:06:00	mnbvcxz123	Building 4 (JOI20_building4)	C++17	100 / 100	294 ms	45384 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;
#define rMax(x, y) x = max(x, y)
#define rMin(x, y) x = min(x, y)
 
const int LIM = 1e6+1;
 
int n, a[2][LIM];
array<int, 2> dp[2][LIM];
 
signed main(){
  cin.tie(0)->sync_with_stdio(0);
  cin >> n; n *= 2;
  for(int j : {1, 0})
    for(int i=1; i<=n; ++i) cin >> a[j][i];
 
  for(int i=1; i<=n; ++i){
    for(int j : {0, 1}){
      dp[j][i] = {n+1, -1};
      for(int k : {0, 1})
        if(a[j][i] >= a[k][i-1])
          rMin(dp[j][i][0], dp[k][i-1][0]+j),
          rMax(dp[j][i][1], dp[k][i-1][1]+j);
    }
  }
 
  int u = -1, j = 0;
 
  for(int k : {0, 1})
    if(dp[k][n][0] <= n/2 && n/2 <= dp[k][n][1]) u = n, j = k;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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