Submission #1000600

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1000600	2024-06-17 23:13:01	biximo	Building 4 (JOI20_building4)	C++17	0 / 100	1 ms	6492 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>
#define N 1000005
using namespace std;
int A[N], B[N], LIS[N], n, minv[N], maxv[N], bt[N];
string ans;
int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    n <<= 1;
    priority_queue<array<int,2>> miv, mav;
    for(int i = 1; i <= n; i ++) {
      cin >> A[i];
    }
    for(int i = 1; i <= n; i ++) {
      cin >> B[i];
    }
    for(int i = 1; i <= n;) {
      int j = i+1;
      while(j <= n && B[j] >= B[j-1]) j ++;
      for(int k = i; k < j; k ++) {
        LIS[k] = j-1;
      }
      i = j;
    }
    for(int i = 1; i <= n; i ++) {
      while(miv.size() && LIS[miv.top()[1]+1] != LIS[i-1]) miv.pop();
      while(mav.size() && LIS[mav.top()[1]+1] != LIS[i-1]) mav.pop();
      if(A[i-1] <= A[i]) {
        minv[i] = minv[i-1]+1;
        maxv[i] = maxv[i-1]+1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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