# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113349 | Mahdi_Jfri | Park (BOI16_park) | C++14 | 564 ms | 117324 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>
using namespace std;
#define ll long long
#define pb push_back
#define ld long double
const int maxn = 2e3 + 20;
const int maxm = maxn * maxn / 2 + 20;
const int maxq = 1e5 + 20;
int x[maxn] , y[maxn] , r[maxn] , e[maxq] , par[maxn] , n;
vector<int> query[maxm];
string res[maxq];
int root(int v)
{
return (par[v] < 0? v : par[v] = root(par[v]));
}
bool cn(int a , int b)
{
a %= 4 , b %= 4;
a += n , b += n;
a = root(a) , b = root(b);
return (a == b);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |