Submission #886172

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
886172	2023-12-11 14:20:31	vjudge1	Curtains (NOI23_curtains)	C++17	20 / 100	968 ms	18084 KiB

curtains

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 = 2e6 + 7;
const int inf = 1e9 + 7;
struct SEGT{
  pair < int , int > tree[N];
  SEGT(){
    for(int i = 0;i<N;i++){
      tree[i] = {-inf , inf};
    }
  }
  void update(int ind , int l , int r , int ql , int qr){
    if(l >= ql and r <= qr){
      tree[ind].first = max(tree[ind].first , ql);
      tree[ind].second = min(tree[ind].second , qr);
      return;
    }
    else if(l > qr or r < ql){
      return;
    }
    else{
      int mid = (l+r)/2;
      update(ind*2,l,mid,ql,qr);
      update(ind*2+1,mid+1,r,ql,qr);
      tree[ind].first = max(tree[ind].first , min(tree[ind*2].first , tree[ind*2+1].first));
      tree[ind].second = min(tree[ind].second , max(tree[ind*2].second , tree[ind*2+1].second));
    }
  }
  bool query(int ind , int l , int r , int ql , int qr){
    if(l >= ql and r <= qr){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 15
• Subtask 4: 20 / 20
• Subtask 5: 0 / 36
• Subtask 6: 0 / 20