제출 #334316

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
334316	2020-12-09 02:35:51	nandonathaniel	돌 무게 재기 (IZhO11_stones)	C++14	100 / 100	74 ms	5612 KiB

stones

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=100005;
int tree[2][4*MAXN],lazy[2][4*MAXN];
void updatenode(int no,int now,int L,int R,int val){
  tree[no][now]+=val;
  lazy[no][now]+=val;
}
void pushdown(int no,int now,int L,int R){
  int mid=(L+R)/2;
  updatenode(no,2*now,L,mid,lazy[no][now]);
  updatenode(no,2*now+1,mid+1,R,lazy[no][now]);
  lazy[no][now]=0;
}
int query(int no,int now,int L,int R,int x,int y){
  if(L>=x && R<=y)return tree[no][now];
  if(L>y || R<x)return 0;
  pushdown(no,now,L,R);
  int mid=(L+R)/2;
  return max(query(no,2*now,L,mid,x,y),query(no,2*now+1,mid+1,R,x,y));
}
void update(int now,int L,int R,int x,int y,int val){
  if(L>=x && R<=y){
    updatenode(0,now,L,R,val);
    updatenode(1,now,L,R,val);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100