제출 #444221

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
444221	2021-07-13 11:29:25	hiliy	Distributing Candies (IOI21_candies)	C++17	8 / 100	1408 ms	47684 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 <bits/stdc++.h>
using namespace std;
#define ll long long
struct segtree{
    int sz;
    vector<ll> sum, mins, maxs, sumpush;
    segtree(int maxn)
    {
        sz = maxn*4 + 4;
        sum.resize(sz);
        mins = maxs = sumpush = sum;
    }
    void push(int v, int l, int r)
    {
        mins[v] += sumpush[v];
        maxs[v] += sumpush[v];
        sum[v] += (ll)(r - l + 1)*sumpush[v];
        if(l != r)
            sumpush[v*2] += sumpush[v], sumpush[v*2 + 1] += sumpush[v];
        sumpush[v] = 0;
    }
    void add(int v, int l, int r, int l1, int r1, int val)
    {
        push(v, l, r);
        if(l > r1 || l1 > r)
            return;
        if(l1 <= l && r <= r1)
        {
            sumpush[v] += val;
            push(v, l, r);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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