제출 #518580

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
518580	2022-01-24 07:40:00	akshit	Sterilizing Spray (JOI15_sterilizing)	C++14	15 / 100	5034 ms	4980 KiB

sterilizing

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
// https://oj.uz/problem/view/JOI15_sterilizing
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll seg[4000003];
ll arr[1000003];
int n,q;ll k;
inline void build(int l,int r,int node){
  
  if(l==r){seg[node]=arr[l];return;}
  int mid=(l+r)>>1;
  int L=node<<1;int R=L|1;
  build(l,mid,L);build(mid+1,r,R);
  seg[node]=seg[L]+seg[R];
  // cout<<l<<" "<<r<<" "<<node<<" "<<seg[node]<<endl;
  
}
inline void fix(int l,int r,int node,int p,ll val){
  if(l==r){seg[node]=arr[l]=val;return;}
  int mid=(l+r)>>1;
  int L=node<<1;int R=L|1;
  if(p<=mid)fix(l,mid,L,p,val);
  else fix(mid+1,r,R,p,val);
  seg[node]=seg[L]+seg[R];
}
inline void upd(int l,int r,int node,int i,int j){
  // cout<<i<<" "<<j<<endl;
  if(l==r){
    arr[l]/=k;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 75