# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
27812 | khsoo01 | Port Facility (JOI17_port_facility) | C++11 | 2379 ms | 114752 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 X first
#define Y second
using namespace std;
typedef pair<int, int> pii;
const int N = 1000005, mod = 1e9+7;
int n;
bool vis[N];
vector<int> st;
set<pii> s;
struct gugan {
int s, e;
bool operator < (const gugan &T) const {
return e > T.e;
}
} g[N];
vector<gugan> res[2];
int mgi (int A, int B) {
if(A == -1) return B;
if(B == -1) return A;
return g[A].s < g[B].s ? A : B;
}
struct disj {
int fr[N], op[N];
void init () {
for(int i=1;i<=n;i++) {
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... |