# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50972 | model_code | 철도 요금 (JOI16_ho_t3) | C++17 | 288 ms | 17580 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<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
const int MAX_N = 100000;
const int MAX_M = 200000;
vector<int> G[MAX_N];
int dis[MAX_N];
int N;
int Q;
void bfs_all(int s){
for(int i = 0; i < N; i++){
dis[i] = -1;
}
dis[s] = 0;
queue<int> que;
que.push(s);
while(!que.empty()){
int v = que.front();
que.pop();
for(int i = 0; i < G[v].size(); ++i){
int u = G[v][i];
if(dis[u] != -1 && dis[u] <= dis[v] + 1) continue;
dis[u] = dis[v] + 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... |