# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23114 | sgc109 | Young Zebra (KRIII5_YZ) | C++11 | 196 ms | 15648 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;
const int MOD = 1e9+7;
const int INF = 0x3c3c3c3c;
const long long INFL = 0x3c3c3c3c3c3c3c3c;
int N,M;
char pane[403][403];
char pane2[1203][1203];
int parent[1440003];
int size[1440003];
int calcId(int i, int j){
return i*3*M + j;
}
int find(int p){
if(p==parent[p]) return p;
return parent[p] = find(parent[p]);
}
void merge(int a, int b){
a = find(a), b = find(b);
if(a==b) return;
parent[a] = b;
size[b] += size[a];
}
bool inRange(int i, int j){
return 0 <= i && i < 3*N && 0 <= j && j < 3*M;
}
int main() {
for(int i = 0 ; i < 1440003; i++) parent[i] = i, size[i] = 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |