Submission #362231

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
362231	2021-02-02 08:54:21	lohacho	Krave (COI14_krave)	C++14	0 / 100	625 ms	53692 KiB

krave

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;
struct Seg{
  long long n;
  long long inf = (long long)1e9;
  vector<vector<long long>> tree;
  Seg(){}
  Seg(long long N):n(N){
    tree.resize(n * 4);
    for(long long i = 0; i < n * 4; ++i){
      tree[i] = {inf, -inf};
    }
  }
  void push(long long x, long long l, long long r, long long pl, long long pr, vector<long long> val){
    if(pr < l || pl > r) return;
    if(l >= pl && r <= pr){
      tree[x][0] = min(tree[x][0], val[0]);
      tree[x][1] = max(tree[x][1], val[1]);
      return;
    }
    long long mid = (l + r) >> 1;
    push(x * 2, l, mid, pl, pr, val), push(x * 2 + 1, mid + 1, r, pl, pr, val);
    tree[x][0] = min(tree[x * 2][0], tree[x * 2 + 1][0]);
    tree[x][1] = max(tree[x * 2][1], tree[x * 2 + 1][1]);
  }
  long long left(long long x, long long l, long long r, long long fl, long long fr, long long val){
    if(fr < l || fl > r) return inf;
    if(tree[x][0] > val || tree[x][1] < val) return inf;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 12
• Subtask 7: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12