# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
27945 | suhgyuho_william | Port Facility (JOI17_port_facility) | C++14 | 1403 ms | 80012 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 lld long long
#define pii pair<int,int>
#define pll pair<lld,lld>
#define pb push_back
#define next nextt
#define left leftt
#define right rightt
#define Inf 1000000000
#define Linf 1000000000000000000LL
#define Mod 1000000007LL
using namespace std;
int N; lld ans,inv;
struct data{
int x,y;
bool operator < (const data &cmp) const{
if(x != cmp.x) return x < cmp.x;
return y < cmp.y;
}
}a[1000002];
int par[2000002];
map<int,int> Map;
void impossible(){puts("0");exit(0);}
int getpar(int x){return (x == par[x])?x:(par[x]=getpar(par[x]));};
void merge(int x,int y){
x = getpar(x); y = getpar(y);
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... |