제출 #310847

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
310847	2020-10-08 07:02:31	mosiashvililuka	Interval Collection (CCO20_day2problem2)	C++14	25 / 25	4266 ms	335516 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;
const int N=2200009;
int a,b,c,d,e,i,j,ii,jj,zx,xc,tes,t,za,seg[N],seg2[N],seg3[N];
char ch;
multiset <int> lf[N],rg[N],mn,mx;
void up(int q){
  if(q==0) return;
  if(seg[q*2]==-1||seg[q*2+1]==-1){
    seg[q]=max(seg[q*2],seg[q*2+1]);
  }else{
    seg[q]=min(seg[q*2],seg[q*2+1]);
  }
  seg2[q]=max(seg2[q*2],seg2[q*2+1]);
  if(seg3[q*2]==-1||seg3[q*2+1]==-1){
    seg3[q]=max(seg3[q*2],seg3[q*2+1]);
  }else{
    seg3[q]=min(seg3[q*2],seg3[q*2+1]);
  }
  int qw=seg3[q*2+1]-seg2[q*2];
  if(seg3[q*2+1]!=-1&&seg2[q*2]!=-1){
    if(seg[q]>qw||seg[q]==-1) seg[q]=qw;
  }
  up(q/2);
}
void upd(int q){
  multiset <int>::iterator it,tt,zit,ztt;
  if(lf[q].size()==0||rg[q].size()==0){
    seg[q+za-1]=-1;
  }else{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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