Submission #311816

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
311816	2020-10-11 19:54:31	lukameladze	Interval Collection (CCO20_day2problem2)	C++14	25 / 25	4239 ms	286512 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;
# define mnri first.second
#define mxle  first.first
pair <pair <long long, long long> , long long>  tree[4000035];
long long  x,l,r,le1,ri1,ans,q,mnr,mxl,mx=1000005;
char ch;
multiset<long long>::iterator it;
multiset< long long> le,ri,ms1[1000005],ms2[1000005];
void update(long long node, long long le, long long ri, long long idx, long long val, int ty)
{
    
    if (le>idx || ri<idx) return;
    if (le==ri)
    {
        if (ty==0)
        {
            tree[node].mnri=val;
        }
        else tree[node].mxle=val;
        tree[node].second=tree[node].mnri-tree[node].mxle;
        return;
    }
    long long mid=(le+ri)/2;
    update(2*node,le,mid,idx,val, ty);
    update(2*node+1, mid+1, ri, idx, val, ty);
    tree[node].mnri=min(tree[2*node].mnri, tree[2*node+1].mnri);
    tree[node].mxle=max(tree[2*node].mxle, tree[2*node+1].mxle);
    x=min(tree[2*node].second, tree[2*node+1].second);
    tree[node].second=min(x,tree[2*node+1].mnri-tree[2*node].mxle);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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