# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211311 | Kevin_Zhang_TW | Unique Cities (JOI19_ho_t5) | C++17 | 418 ms | 40812 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>
#define pb emplace_back
using namespace std;
using ll = long long;
const int maxn = 300010;
int n, m;
int c[maxn];
vector<int> edge[maxn];
int len[maxn], fp[maxn], dep[maxn], son[maxn];
namespace st{
int st[maxn], stl;
int cnt[maxn], _res;
void _add_in(int a, int d) {
if (cnt[a] == 0) ++_res;
if ((cnt[a]+=d) == 0) --_res;
}
void push(int id) {
_add_in(c[id], 1);
st[stl++] = id;
}
void pop() {
assert(--stl >= 0);
_add_in(c[st[stl]], -1);
}
int back() {
return st[stl-1];
}
void pop_dep(int d) {
while (stl && dep[back()] >= d) pop();
}
# | 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... |