# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
256916 | Nightlight | Park (BOI16_park) | C++14 | 403 ms | 33400 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 P2(n) ((n) * (n))
#define LEFT 2001
#define RIGHT 2002
#define UP 2003
#define DOWN 2004
#define piii tuple<long long, int, int>
using namespace std;
int N, M;
long long H, W;
long long X[2005], Y[2005], R[2005];
int par[2010];
long long ans[10][10];
piii seg[10000005];
int p;
inline long long dist(int i, int j) {
long long A = P2(X[i] - X[j]) + P2(Y[i] - Y[j]), B = sqrt(A);
return B + 1;
}
int findpar(int u) {
return par[u] == u ? u : par[u] = findpar(par[u]);
}
void merge(int u, int v) {
u = findpar(u), v = findpar(v);
if(u == v) return;
par[v] = u;
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... |