oj.uz

답안 #336609

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
336609 2020-12-16T01:29:01 Z VROOM_VARUN Ceste (COCI17_ceste) C++14
160 / 160
 2214 ms 41864 KB 
/*
ID: varunra2
LANG: C++
TASK: ceste
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define int long long

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e17
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

int32_t main() {
  // #ifndef ONLINE_JUDGE
  // freopen("ceste.in", "r", stdin);
  // freopen("ceste.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  int n, m;
  cin >> n >> m;

  VI dist(n, INF);
  VI bst(n, INF);
  vector<vector<pair<int, PII>>> adj(n);

  for (int i = 0; i < m; i++) {
    int u, v, c, t;
    cin >> u >> v >> c >> t;
    u--, v--;
    adj[u].PB(MP(v, MP(c, t)));
    adj[v].PB(MP(u, MP(c, t)));
  }

  priority_queue<VI, VVI, greater<VI>> pq;

  pq.push({0, 0, 0});

  while (!pq.empty()) {
    auto x = pq.top();
    pq.pop();
    int node, cost, time;
    cost = x[0];
    node = x[1];
    time = x[2];
    if (time >= bst[node]) continue;
    bst[node] = time;
    dist[node] = min(dist[node], cost * time);
    for (auto& x : adj[node]) {
      pq.push({cost + x.y.x, x.x, time + x.y.y});
    }
  }

  for (int i = 1; i < n; i++) {
    if (dist[i] >= INF)
      cout << "-1\n";
    else
      cout << dist[i] << '\n';
  }

  return 0;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 620 KB Output is correct
2 Correct 9 ms 768 KB Output is correct
3 Correct 9 ms 1132 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 2980 KB Output is correct
2 Correct 130 ms 3868 KB Output is correct
3 Correct 165 ms 3972 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 436 ms 5664 KB Output is correct
2 Correct 2214 ms 41864 KB Output is correct
3 Correct 12 ms 1132 KB Output is correct

Subtask #8
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 1448 KB Output is correct
2 Correct 1183 ms 14424 KB Output is correct
3 Correct 23 ms 748 KB Output is correct

Subtask #9
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 525 ms 1832 KB Output is correct
2 Correct 670 ms 7452 KB Output is correct
3 Correct 578 ms 6940 KB Output is correct

Subtask #10
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 560 ms 6360 KB Output is correct
2 Correct 549 ms 6812 KB Output is correct
3 Correct 757 ms 6812 KB Output is correct