제출 #1135810

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1135810	2025-01-14 01:46:56	adaawf	건물 4 (JOI20_building4)	C++17	100 / 100	165 ms	28800 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 <iostream>
using namespace std;
pair<int, int> f[1000005][2];
int a[1000005][2], res[1000005];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n * 2; i++) {
        cin >> a[i][0];
    }
    for (int i = 1; i <= n * 2; i++) {
        cin >> a[i][1];
        f[i][0] = f[i][1] = {-1e9, 1e9};
    }
    f[1][0] = {0, 0};
    f[1][1] = {1, 1};
    for (int i = 2; i <= n * 2; i++) {
        if (a[i][0] >= a[i - 1][0]) {
            f[i][0].first = max(f[i][0].first, f[i - 1][0].first);
            f[i][0].second = min(f[i][0].second, f[i - 1][0].second);
        }
        if (a[i][0] >= a[i - 1][1]) {
            f[i][0].first = max(f[i][0].first, f[i - 1][1].first);
            f[i][0].second = min(f[i][0].second, f[i - 1][1].second);
        }
        if (a[i][1] >= a[i - 1][0]) {
            f[i][1].first = max(f[i][1].first, f[i - 1][0].first + 1);
            f[i][1].second = min(f[i][1].second, f[i - 1][0].second + 1);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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