# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
399260 | LucaDantas | The short shank; Redemption (BOI21_prison) | C++17 | 670 ms | 141236 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;
constexpr int maxn = 2e6+10;
vector<int> g[maxn];
int a[maxn], add[maxn], rmv[maxn], dp[maxn], ans;
vector<int> roots, b, st;
vector<int> bfs() {
queue<int> q;
vector<int> ord;
for(int x : roots)
q.push(x);
while(q.size()) {
int u = q.front(); q.pop();
ord.push_back(u);
for(int v : g[u])
q.push(v);
}
reverse(ord.begin(), ord.end());
return ord;
}
int main() {
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... |