# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
680435 | qwerasdfzxcl | Wells (CEOI21_wells) | C++17 | 65 ms | 72556 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>
typedef long long ll;
using namespace std;
int dist[10010][10010], vcnt, n, k;
vector<int> adj[1501500], G[1501500], st;
vector<vector<int>> path;
void dfs(int s, int pa = -1){
st.push_back(s);
if ((int)st.size()==k) path.push_back(st);
dist[st[0]][s] = (int)st.size() - 1;
for (auto &v:adj[s]) if (v!=pa){
dfs(v, s);
}
st.pop_back();
}
int col[1501500];
bool simulate(int s){
vector<int> q = {s};
fill(col+1, col+n+1, 0);
col[s] = 1;
while(!q.empty()){
int v = q.back(); q.pop_back();
for (int i=1;i<=n;i++) if (dist[v][i]==k && !col[i]){
col[i] = 1;
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... |