# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
535255 | LucaDantas | 007 (CEOI14_007) | C++17 | 139 ms | 13184 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;
constexpr int maxn = 2e5+10;
vector<int> g[maxn];
int dist[2][maxn];
void bfs(int k, int s) {
dist[k][s] = 0;
queue<int> q;
q.push(s);
while(q.size()) {
int u = q.front(); q.pop();
for(int v : g[u])
if(dist[k][v] > dist[k][u]+1)
dist[k][v] = dist[k][u]+1, q.push(v);
}
}
bool mark[maxn];
void dfs(int u, int& mn) {
mark[u] = 1;
mn = min(mn, dist[0][u]);
for(int v : g[u])
if(!mark[v] && dist[0][v] == dist[1][v]) dfs(v, mn);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |