# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
928523 | vjudge1 | Uzastopni (COCI15_uzastopni) | C++17 | 77 ms | 24756 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;
#define N 10005
#define M 105
#define se second
#define fi first
#define ii pair<int, int>
int n, v[N];
vector<int> adj[N], rr[N];
vector<ii> cn[N];
bitset<M> gt[N][M];
bool in (int l, int r, int v){
return (v >= l && v <= r);
}
void dfs(int u){
for (auto x : adj[u]){
dfs(x);
}
for (int i = 1; i <= 100; i++){
rr[i].clear();
}
for (auto x : adj[u]){
for (auto pi : cn[x]){
int l = pi.fi;
int r = pi.se;
rr[l].push_back(r);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |