Submission #1168938

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1168938	2025-03-18 08:14:20	PieArmy	Harbingers (CEOI09_harbingers)	C++20	0 / 100	145 ms	33580 KiB

harbingers

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>
typedef long long ll;
using namespace std;
struct Seg{
  int n;
  vector<int>tree;
  void init(int N){
    n=N;
    tree.resize(n<<2,1e9+1);
  }
  int l,r;
  void up(int node=1,int left=0,int right=-1){
    if(right==-1)right=n-1;
    if(left==right){
      tree[node]=r;
      return;
    }
    int mid=(left+right)/2;
    if(l>mid)up(node*2+1,mid+1,right);
    else up(node*2,left,mid);
    tree[node]=min(tree[node*2],tree[node*2+1]);
  }
  void update(int tar,int x){
    l=tar;r=x;
    up();
  }
  int qu(int node=1,int left=0,int right=-1){
    if(right==-1)right=n-1;
    if(tree[node]>r)return -1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 100