# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
545440 | pokmui9909 | 철도 요금 (JOI16_ho_t3) | C++17 | 145 ms | 21600 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;
using ll = long long;
#define x first
#define y second
ll N, M, K;
pair<ll, ll> E[200005];
vector<pair<ll, ll>> G[100005];
ll dist[100005];
const ll INF = 1e18;
ll deg[100005];
ll chk[200005];
int main(){
cin.tie(0) -> sync_with_stdio(false);
cin >> N >> M >> K;
for(int i = 1; i <= M; i++){
cin >> E[i].x >> E[i].y;
G[E[i].x].push_back({E[i].y, i});
G[E[i].y].push_back({E[i].x, i});
}
queue<ll> Q;
fill(dist, dist + N + 1, INF);
Q.push(1); dist[1] = 0;
while(!Q.empty()){
ll u = Q.front(); Q.pop();
for(auto i : G[u]){
if(dist[i.x] <= dist[u] + 1) continue;
# | 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... |