Submission #1068984

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1068984	2024-08-21 14:04:54	_8_8_	Building 4 (JOI20_building4)	C++17	0 / 100	1 ms	604 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;
    
typedef long long ll;
const int  N = 100 + 12, MOD = (int)1e9 + 7;
int n,a[N][2];
int dp[N][2][N];
int mx[N][2],mn[N][2];
bool in(int l,int r,int x) {
    return (l <= x && x <= r);
}
void test() {
    cin >> n;
    for(int i = 1; i <= n + n; i++) {
        cin >> a[i][1];
    }
    for(int i = 1; i <= n + n; i++) {
        cin >> a[i][0];
    }
    for(int i = 1; i <= n + n; i++) {
        for(int k = 0;k < 2;k++) {
            mn[i][k] = 1e9;
            mx[i][k] = -1e9;
            for(int t = 0;t < 2;t++) {
                if(a[i][k] >= a[i - 1][t]) {
                    mx[i][k] = max(mx[i - 1][t] + k,mx[i][k]);
                    mn[i][k] = min(mn[i][k],k + mn[i - 1][t]);
                    // cout << i << ' ' << k << ' ' << t << ' ' <<mx[i - 1][t] + k << ' ' << mn[i - 1][t] + k << '\n';
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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