# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
409834 | Ruxandra985 | The short shank; Redemption (BOI21_prison) | C++14 | 1369 ms | 313192 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>
#define DIMN 2000010
using namespace std;
int v[DIMN] , w[DIMN] , f[DIMN] , out[DIMN] , mark[DIMN] , tt[DIMN];
pair <int , int> ev[2 * DIMN] , now[DIMN] , cnt[DIMN];
vector <int> g[DIMN];
priority_queue <int> h;
priority_queue <pair <int , pair <int , int> > > h2;
priority_queue <pair <int , int > > h3;
struct interval{
int poz , tip , idx;
} interv[2 * DIMN];
int cmp (interval x , interval y){
if (x.poz != y.poz)
return x.poz < y.poz;
if (x.tip != y.tip)
return x.tip < y.tip;
return now[x.idx].second - now[x.idx].first < now[y.idx].second - now[y.idx].first;
}
void dfs (int nod){
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... |