# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1057291 | Nickpapadak | Game (eJOI20_game) | C++14 | 0 ms | 348 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 X first
#define Y second
const unsigned int MAXN = (int)2e+1 + 5;
const unsigned int MAXMN = 410;
int grid[MAXN][MAXN];
int N, M;
int cnt;
int p[MAXMN];
int sz[MAXMN];
int CI(int x, int y) {return (y-1)*M + x;}
pair<int,int> IC(int id) {return {(id-1)%M +1, ((id-1)/M)+1};}
int findp(int u){
if(p[u] == u) return u;
return p[u] = findp(p[u]);
}
void Union(int u, int v){
if(findp(v) == findp(u)) return;
if(sz[findp(v)] > sz[findp(u)]) swap(u,v);
sz[findp(u)] += sz[findp(v)];
// int x = findp(u), y = findp(v);
// printf("%d\n", findp(v));
// p[2]= 1;
p[findp(v)] = findp(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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |