# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
55120 | ainta | Sushi (JOI16_sushi) | C++17 | 9720 ms | 50972 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<queue>
#define BB 10
using namespace std;
int n, Q;
struct point {
int P[1 << BB], SZ;
vector<int>U;
priority_queue<int>PQ;
void Make() {
int i;
while (!PQ.empty())PQ.pop();
for (i = 0; i < SZ; i++) {
PQ.push(P[i]);
}
}
void init() {
priority_queue<int>PP;
for (auto &t : U) {
PP.push(-t);
}
int i;
for (i = 0; i < SZ; i++) {
PP.push(-P[i]);
P[i] = -PP.top();
PP.pop();
}
U.clear();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |