# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3680 | pl0892029 | Cactus? Not cactus? (kriii1_C) | C++98 | 0 ms | 1868 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 <cstdio>
int groupNumber[100001];
int groupCount[100001];
bool isSameSet(int a,int b) {
return groupNumber[a] == groupNumber[b];
}
void setUnion(int a,int b) {
if( groupCount[a] < groupCount[b] ) {
groupCount[b] += groupCount[a];
groupCount[a] = 0;
groupNumber[a] = b;
}
else {
groupCount[a] += groupCount[a];
groupCount[b] = 0;
groupNumber[b] = a;
}
}
int setFind(int n) {
if( groupCount[n] == 0 ) {
groupNumber[n] = setFind(groupNumber[n]);
}
return groupNumber[n];
}
int main() {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |