# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
711909 | thimote75 | Arranging Shoes (IOI19_shoes) | C++14 | 116 ms | 7864 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"
using namespace std;
#define num long long
#define idata vector<int>
#define di pair<int, int>
struct PosM {
set<di> u;
void insert (int type, int pos) {
u.insert({ type, pos });
}
int find (int type) {
di data = *u.lower_bound({ type, -1 });
u.erase(data);
return data.second;
}
};
PosM pos_query;
struct SegTree {
vector<int> tree;
int size, start, height;
# | 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... |