# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
212351 | jk89 | Arranging Shoes (IOI19_shoes) | C++14 | 215 ms | 139896 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 <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define f first
#define s second
const int MAXN = 1e5 + 3;
const int MAXM = 512 * 1024 + 3;
int tree[MAXM];
deque<int> q[MAXN];
deque<int> q2[MAXN];
long long ret;
long long suma(int v) {
ret = 0;
while (v) {
ret += tree[v];
v /= 2;
}
return ret;
}
void dodaj(int v, int x, int y, int a, int b) {
if (y < a || x > b)
return;
# | 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... |