Submission #229655

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
229655	2020-05-05 17:50:10	vee_nits123	Deda (COCI17_deda)	C++14	140 / 140	136 ms	11204 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 <iostream>
#include <climits>
#include <cstring>
using namespace std;
#define int long long int
#define endl '\n'
const int N = 2e5 + 5;
const int M = 1e9 + 1;
int tree[4 * N];
void update(int ind, int val, int st, int end, int pos) {
  //if (st > end || ind > end || ind < st) return ;
  if (st == end && st == ind) {
    tree[pos] = val;
    return ;
  }
  int mid = (st + end) / 2;
  if(ind<=mid)
    update(ind, val, st, mid, 2 * pos);
  else
    update(ind, val, mid + 1, end, 2 * pos + 1);
  tree[pos] = min(tree[2 * pos], tree[2 * pos + 1]);
  return ;
}
int query(int l, int r, int val, int st, int end, int pos) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 140 / 140