# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
143553 | muradeyn | Arranging Shoes (IOI19_shoes) | C++14 | 786 ms | 146936 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 "shoes.h"
#include <bits/stdc++.h>
using namespace std;
const int maxx = 200001;
int fen[maxx];
void update(int idx) {
idx++;
while (idx < maxx)fen[idx]++ , idx += (idx & -idx);
}
int get(int idx) {
int ret = 0;
while (idx > 0) {
ret += fen[idx];
idx -= (idx & -idx);
}
return ret;
}
int query(int l , int r) {
l++; r++;
if (l > r)return 0;
return get(r) - get(l - 1);
}
map< int , queue<int> >mp;
# | 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... |