# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1076999 | bleahbleah | Tortoise (CEOI21_tortoise) | C++17 | 3065 ms | 23332 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>
using namespace std;
#define _ << " " <<
const int MAXN = 5e5 + 5;
const int off = 1 << 19;
const int inf = 1e9;
#define int long long
int a[MAXN];
int l[MAXN];
int r[MAXN];
int before[MAXN];
unordered_map<int, int> specialChair;
typedef pair<int, int> pii;
int n;
bool possible(multiset<int> s)
{
vector<int> SS;
for(int i = 0; i < n; i++) {
if(a[i] == -1) continue;
int p = -1;
for(int j = i + 1; j < min(n, r[i]); j++) if(a[j] > 0 && (p == -1 || j > p)) { p = j; }
if(p == -1) { i = r[i]; continue; }
a[p]--;
s.emplace(p);
# | 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... |