# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
208981 | faremy | Editor (BOI15_edi) | C++14 | 113 ms | 30716 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 <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
struct Op
{
Op(int i, int r) : id(i), rank(r) {}
int id, rank;
bool operator <(const Op &other) const
{
return (rank < other.rank);
}
};
const int MAXN = 3e5 + 1;
int type[MAXN];
int rank[MAXN];
std::stack<int> alone;
std::priority_queue<Op> keep[MAXN];
std::priority_queue<Op> prison[MAXN];
int parent[MAXN];
int lastZero[MAXN];
std::stack<int> state;
# | 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... |