Submission #736550

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
736550	2023-05-05 23:00:23	bane	Deda (COCI17_deda)	C++17	140 / 140	822 ms	7104 KiB

deda

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 maxN = (int)1e5 * 2;
int n, q, x, y;
class SegmentTree{
  public:
  int Seg[maxN * 3];
  void init(int l = 1, int r = n,int k = 1){
    if (l == r){
      Seg[k] = (int)1e9 + 9;
      return;
    }
    init(l,(l+r)/2,k*2);
    init((l+r)/2+1,r,k*2+1);
    Seg[k] = (int)1e9 + 9;
  }
  void upd(int pos, int val, int l = 1, int r = n, int k = 1){
    if (l == r){
      Seg[k] = val;
      return;
    }
    int md = (l + r) >> 1;
    if (pos <= md){
      upd(pos,val,l,md,k * 2);
    }else{
      upd(pos,val,md+1,r,k*2+1);
    }
    Seg[k] = min(Seg[k * 2], Seg[k * 2 + 1]);
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 140 / 140