Submission #568456

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
568456	2022-05-25 13:27:02	Ahmadsm2005	Interval Collection (CCO20_day2problem2)	C++17	22 / 25	7037 ms	336156 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>
#define endl '\n'
using namespace std;
int N,L,R;
pair<int,int>seg[1<<21],seg2[1<<21];
set<int>SEG[1<<20],SEG2[1<<20];
map<pair<int,int>,int>COUNT;
map<pair<int,int>,set<pair<int,int>>>MP;
multiset<pair<int,int>>GLOBAL; ///{R-L,L}
char C;
pair<int,int>G1(pair<int,int>A,pair<int,int>B){
if(A.first==INT_MAX)
return B;
else if(B.first==INT_MAX)
return A;
if(A.second<B.second)
return A;
else if(A.second==B.second&&A.first>B.first)
return A;
return B;
}
pair<int,int>G2(pair<int,int>A,pair<int,int>B){
if(A.first==INT_MAX)
return B;
else if(B.first==INT_MAX)
return A;
if(A.first>B.first)
return A;
else if(A.first==B.first&&A.second<B.second)
return A;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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