# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
27819 | tlwpdus | Port Facility (JOI17_port_facility) | C++11 | 1443 ms | 103448 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.
// N^2
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
map<int,int> ma;
vector<int> lis[1000100];
int n;
ll MOD = 1000000007, res = 1;
pii arr[1000100];
int par[2000100], chk[2000100];
int fin(int a) {return par[a] = ((par[a]==a)?a:fin(par[a]));}
void uni(int a, int b) {par[fin(a)]=fin(b);}
void good(int a, int b) {uni(a,b);uni(a+n,b+n);}
void bad(int a, int b) {uni(a,b+n);uni(a+n,b);}
int main() {
int i;
scanf("%d",&n);
for (i=0;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... |