제출 #341575

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
341575	2020-12-30 05:02:30	nandonathaniel	Money (IZhO17_money)	C++14	45 / 100	1553 ms	50668 KiB

money

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 MAXN=1e6+5;
int a[MAXN],mini,maxi,kel[MAXN],terakhir[MAXN],tree[2][4*MAXN],lazy[4*MAXN];
set<int> S;
bool valid(){
  if(mini==maxi)return true;
  auto it=S.upper_bound(mini);
  auto it2=S.lower_bound(maxi);
  return it==it2;
}
void build(int now,int L,int R){
  if(L==R){
    tree[0][now]=tree[1][now]=1e9;
    return;
  }
  int mid=(L+R)/2;
  build(2*now,L,mid);
  build(2*now+1,mid+1,R);
  tree[0][now]=min(tree[0][2*now],tree[0][2*now+1]);
  tree[1][now]=max(tree[1][2*now],tree[1][2*now+1]);
}
void updatetambah(int now,int val){
  tree[0][now]+=val;
  tree[1][now]+=val;
  lazy[now]+=val;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 20 / 20
• Subtask 4: 0 / 55