# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
583544 | Markomafko972 | KOVANICE (COI15_kovanice) | C++14 | 232 ms | 30524 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;
int n, m, q;
int a[300005];
int b[300005];
char w[300005];
int prt[300005];
vector<int> v[300005];
int dub[300005];
int sol[300005];
int find(int x) {
if (prt[x] == x) return x;
return prt[x] = find(prt[x]);
}
void unija(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
prt[y] = x;
}
int dfs(int x) {
if (dub[x] > 0) return dub[x];
for (int i = 0; i < v[x].size(); i++) {
dub[x] = max(dub[x], dfs(v[x][i]));
}
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... |