Submission #20323068

---

Source Code Expand

//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_A&lang=ja
#include <bits/stdc++.h>
#define rep(i, N) for(int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
typedef vector<int> vi;
const ll INF = (1LL << 60); // > 10^9, int 2*INF

//ダイクストラ法
int main() {
    ll n,m,x,y;
    cin >> n >> m >> x >> y;
  
    vector<vector<T>> g(n+1); 
    ll u, v, t, k;
    rep(i, m) {
        scanf("%lld%lld%lld%lld", &u, &v, &t, &k);
        g[u].emplace_back(T(v, t, k)); //有向辺
        g[v].emplace_back(T(u, t, k)); //有向辺
    }

    priority_queue<P, vector<P>, greater<P>> pq;
    pq.push(P(0,x));
    vector<ll> res(n+1, INF);
    res[x] = 0;
    vector<bool> check(n+1, false);

    while (!pq.empty()) {
        P tmp = pq.top(); pq.pop();
        ll cv = tmp.second;
        if(check[cv]) continue;

        check[cv] = true;
        rep(i, g[cv].size()) {
            T ttt = g[cv][i];
            ll nv = get<0>(ttt), tt = get<1>(ttt), tk = get<2>(ttt);
            ll dtk = tk-res[cv]%tk;
            if(tk == dtk) dtk = 0;
            if(res[nv] > res[cv] + tt + dtk){
                res[nv] = res[cv] + tt + dtk;
                pq.push(P(res[nv], nv));
            }
        }

    }

    if(res[y] != INF) cout << res[y];
    else cout << -1;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:14: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   19 |         scanf("%lld%lld%lld%lld", &u, &v, &t, &k);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Judge Result