# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
703204 | Doncho_Bonboncho | Arranging Shoes (IOI19_shoes) | C++14 | 29 ms | 5428 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "shoes.h"
typedef long long ll;
const int MAX_N = 1e6 + 42;
int p[MAX_N];
int last[MAX_N];
int tree[MAX_N];
void add( int x, int v ){
// std::cerr<<" ! "<<x<<"\n";
while( x < MAX_N ){
tree[x] += v;
x += x&(-x);
}
}
int query( int x ){
int nas = 0;
while( x ){
nas += tree[x];
x -= x&(-x);
}
return nas;
}
bool oke[MAX_N];
# | 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... |