제출 #777342

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
777342	2023-07-09 06:18:18	Trisanu_Das	사탕 분배 (IOI21_candies)	C++17	100 / 100	354 ms	37028 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;
using ll = long long;
 
const int MX = 1<<19;
 
vector<ll> smx(MX), smn(MX), st(MX);
 
void upd(int i, int s, int e, int t, ll v) {
  if (s==e) {
    smx[i]=max(0ll, v);
    smn[i]=min(0ll, v);
    st[i]=v;
    return ;
  }
 
  int m=(s+e)/2;
  if (t<=m) upd(i*2, s, m, t, v);
  else upd(i*2+1, m+1, e, t, v);
  
  st[i]=st[i*2]+st[i*2+1];
  smx[i]=max(smx[i*2], st[i*2]+smx[i*2+1]);
  smn[i]=min(smn[i*2], st[i*2]+smn[i*2+1]);
}
 
ll get(int i, int s, int e, ll c) {
  if (s==e) return min(max(st[i], 0ll), c);
 
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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