제출 #451959

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
451959	2021-08-03 14:12:06	vector	사탕 분배 (IOI21_candies)	C++17	100 / 100	2960 ms	36292 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>
#define SIZE 200001
using namespace std;
typedef long long ll;
ll lazy[4*SIZE], max_tree[4*SIZE], min_tree[4*SIZE];
vector<pair<int, int> > query[SIZE];
void pro(int node)
{
    lazy[node*2]+=lazy[node];
    lazy[node*2+1]+=lazy[node];
    max_tree[node*2]+=lazy[node];
    max_tree[node*2+1]+=lazy[node];
    min_tree[node*2]+=lazy[node];
    min_tree[node*2+1]+=lazy[node];
    lazy[node]=0;
}
void upd(int s, int e, int w, int l, int r, int node)
{
    if (l>r) return;
    if (s<=l && r<=e) {
        lazy[node]+=w;
        max_tree[node]+=w;
        min_tree[node]+=w;
        return;
    }
    if (l>e || s>r) return;
    pro(node);
    int mid=(l+r)/2;
    upd(s, e, w, l, mid, node*2);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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