# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22759 | 퍼플달고싶다 (#40) | Young Zebra (KRIII5_YZ) | C++14 | 59 ms | 27512 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 <iostream>
#include <cstdio>
#include <string>
#include <sstream>
#include <algorithm>
#include <set>
#include <numeric>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <queue>
#include <numeric>
#include <iomanip>
#define ll long long
using namespace std;
const int MAXN=2000001;
int parent[2000000],sz[2000000];
int m,n;
int ccn[2000001]={0,};
string board[1500];
int find(int u){
return u==parent[u] ? u : parent[u]=find(parent[u]);
}
int getId(int r,int c){
return r*3*m+c;
}
void mrg(int u,int v){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |