# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
713985 | Alex_tz307 | Uzastopni (COCI15_uzastopni) | C++17 | 24 ms | 8620 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 kN = 1e4;
const int kK = 100;
int a[1 + kN];
vector<int> g[1 + kN], st[1 + kK], dr[1 + kK];
vector<pair<int, int>> intervals[1 + kN];
bitset<1 + kK + 1> reach;
void dfs(int u) {
for (const int &v : g[u]) {
dfs(v);
}
for (int i = 1; i <= kK; ++i) {
st[i].clear();
dr[i].clear();
}
for (const int &v : g[u]) {
for (const auto &range : intervals[v]) {
if (a[u] < range.first) {
dr[range.second].emplace_back(range.first - 1);
} else if (range.second < a[u]) {
st[range.first].emplace_back(range.second + 1);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |