# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
173511 | AllMight | Bootfall (IZhO17_bootfall) | C++14 | 1077 ms | 736 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 <set>
#include <queue>
using namespace std;
const int N = 502;
int n;
int a[N];
int cnt[N * N];
vector <int> v;
void check(int ind)
{
vector <bool> knp(N * N, false);
knp[0] = true;
priority_queue <int> pq[2];
pq[0].push(0);
for (int i = 0, f = 0; i < n; i++, f = 1 - f) {
if (i == ind) {
f = 1 - f;
continue;
}
while (!pq[f].empty()) {
int tp = pq[f].top();
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |