Submission #380356

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
380356	2021-03-21 06:28:36	ritul_kr_singh	Deda (COCI17_deda)	C++17	140 / 140	137 ms	8940 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;
#define int long long
#define sp << ' ' <<
#define nl << '\n'
struct segtree{
  int sz = 1, lim; const int ID = 1e10;
  vector<int> a;
  segtree(int n){
    while(sz < n) sz *= 2;
    lim = n;
    a.assign(2*sz, ID);
  }
  void update(int i, int val, int x, int lx, int rx){
    if(rx-lx==1) return void(a[x] = val);
    int mx = (lx+rx)/2;
    if(i<mx) update(i, val, 2*x+1, lx, mx);
    else update(i, val, 2*x+2, mx, rx);
    a[x] = min(a[2*x+1], a[2*x+2]);
  }
  void update(int i, int val){ update(i, val, 0, 0, sz); }
  int get(int l, int val, int x, int lx, int rx){
    if(rx<=l) return ID;
    if(rx-lx==1) return (lx>=l ? lx : ID);
    int mx = (lx+rx)/2;
    int res = ID;
    if(a[2*x+1]<=val) res = get(l, val, 2*x+1, lx, mx);
    if(res==ID and a[2*x+2]<=val) res = get(l, val, 2*x+2, mx, rx);
    return res;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 140 / 140