제출 #787064

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
787064	2023-07-18 17:58:50	allin27x	쌀 창고 (IOI11_ricehub)	C++17	100 / 100	217 ms	13032 KiB

ricehub

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 int long long
 
int val[(int) 1e5+4];
unordered_map<int, int> key;
 
vector<int> a;
int n;
struct SGT{
  vector<int> t;
  int n;
  int ofs;
  SGT(vector<int> ar, bool indexed = false){
    n = ar.size();
    ofs = indexed?(1ll<<(int)(ceil(log2(n+1)))) : n;
    t.resize(2*ofs, 0);
    for (int i=0; i<n; i++) t[ofs+i] = ar[i];
    for (int i=ofs-1; i>0; i--) t[i] = t[i<<1] + t[i<<1|1];
 
  }
  void update(int p, int inc){
    for (t[p+=ofs]+=inc; p>1; p>>=1) t[p>>1] = t[p] + t[p^1];
  }
  int query(int l, int r){
    int res = 0;
    for (l+=ofs,r+=ofs+1; l<r; l>>=1, r>>=1){
      if (l&1) res += t[l++];
      if (r&1) res += t[--r];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 32 / 32