Submission #314124

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
314124	2020-10-18 14:52:50	demetre	Interval Collection (CCO20_day2problem2)	C++14	25 / 25	4271 ms	292236 KiB

Main

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;
pair <pair <long long, long long> , long long>  tree[4000035];
long long  x,le,ri,l1,r1,ans,q,mnr,mxl;
long long mx=1000005;
char ch;
multiset<long long>::iterator it;
multiset<long long> l,r,ms1[1000005],ms2[1000005];
void update(long long n, long long l, long long r, long long ind, long long val, int ty){
    
    if (l>ind || r<ind) return;
    if (l==r){
        if (ty==0)
            tree[n].first.second=val;
            
        else 
      tree[n].first.first=val;
      
        tree[n].second=tree[n].first.second-tree[n].first.first;
        return;
    }
    long long mid=(l+r)/2;
    
    update(2*n, l, mid, ind, val, ty);
    update(2*n+1, mid+1, r, ind, val, ty);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3 / 3
• Subtask 2: 8 / 8
• Subtask 3: 7 / 7
• Subtask 4: 4 / 4
• Subtask 5: 3 / 3