# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1135911 | nikolashami | Arranging Shoes (IOI19_shoes) | C++20 | 62 ms | 22120 KiB |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=1e5+2;
set<int>ps[N],ng[N];
int b[N<<1],bit[N<<1],n;
int get(int k){
int s=0;++k;
while(k>0){
s+=bit[k];
k-=k&-k;
}
return s;
}
void add(int k,int x){
++k;
while(k<=n){
bit[k]+=x;
k+=k&-k;
}
}
void reset(){
for(int i=0;i<=n;++i){
if(i<N)ps[i].clear();
if(i<N)ng[i].clear();
bit[i]=0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |