제출 #436968

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
436968	2021-06-25 12:04:47	haojiandan	사탕 분배 (IOI21_candies)	C++17	100 / 100	1258 ms	32316 KiB

candies

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 "candies.h"
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
typedef long long ll;
const ll INF=1e18;
const int maxn=(2e5)+10;
int n,q,c[maxn];
vector<pair<int,int> > Q[maxn];
ll mn[maxn*4],mx[maxn*4],lazy[maxn*4];
void puttag(int root,ll delta) {
  lazy[root]+=delta,mn[root]+=delta,mx[root]+=delta;
}
void pushdown(int root) {
  if (lazy[root]) {
    puttag(root<<1,lazy[root]),puttag(root<<1|1,lazy[root]); lazy[root]=0;
  }
}
void update(int L,int R,int l,int r,int root,ll delta) {
  if (L<=l&&r<=R) { puttag(root,delta); return; }
  int mid=(l+r)>>1; pushdown(root);
  if (L<=mid) update(L,R,l,mid,root<<1,delta);
  if (mid<R) update(L,R,mid+1,r,root<<1|1,delta);
  mn[root]=min(mn[root<<1],mn[root<<1|1]);
  mx[root]=max(mx[root<<1],mx[root<<1|1]);
}
pair<ll,ll> operator + (pair<ll,ll> t1,pair<ll,ll> t2) { return MP(min(t1.first,t2.first),max(t1.second,t2.second)); }
pair<ll,ll> query(int L,int R,int l,int r,int root) {
  if (L<=l&&r<=R) return MP(mn[root],mx[root]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3 / 3
• Subtask 2: 8 / 8
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29
• Subtask 5: 33 / 33