oj.uz

Submission #922219

# Submission time Handle Problem Language Result Execution time Memory
922219 2024-02-05T08:56:30 Z Whisper Ceste (COCI17_ceste) C++17
160 / 160
 102 ms 7884 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e3 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
struct Edge{
    int u, v, t, c;

    int other(int x){
        return (x ^ u ^ v);
    }
} edge[MAX];

int minCost[MAX], ans[MAX];
struct State{
    int t, c, u;
    State(int _t, int _c, int _u): t(_t), c(_c), u(_u){}
    bool operator < (const State& oth) const{
        return (t != oth.t) ? t > oth.t : c > oth.c;
    }
};

int N, M;
vector<int> adj[MAX];
void Whisper(){
    cin >> N >> M;
    for (int i = 1; i <= M; ++i){
        int u, v, t, c; cin >> u >> v >> t >> c;
        edge[i] = {u, v, t, c};
        adj[u].push_back(i);
        adj[v].push_back(i);
    }
    memset(minCost, 0x3f, sizeof minCost);
    memset(ans, 0x3f, sizeof ans);

    priority_queue<State> q;
    q.push({0, 0, 1});
    ans[1] = 0;
    while (!q.empty()){
        auto[dt, dc, u] = q.top(); q.pop();
        if (minCost[u] <= dc) continue;
        minCost[u] = dc;
        minimize(ans[u], dt * dc);
        for (auto&id : adj[u]){
            int v = edge[id].other(u);
            int t = edge[id].t;
            int c = edge[id].c;
            if (minCost[v] > dc + c){
                q.push({dt + t, dc + c, v});
            }
        }
    }
    for (int i = 2; i <= N; ++i){
        cout << (ans[i] > 1e15 ? -1 : ans[i]) << '\n';
    }
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1016 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1368 KB Output is correct
2 Correct 9 ms 1368 KB Output is correct
3 Correct 8 ms 1368 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 2360 KB Output is correct
2 Correct 102 ms 7884 KB Output is correct
3 Correct 2 ms 860 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 860 KB Output is correct
2 Correct 96 ms 3792 KB Output is correct
3 Correct 4 ms 604 KB Output is correct

Subtask #9
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 1208 KB Output is correct
2 Correct 90 ms 2260 KB Output is correct
3 Correct 77 ms 2460 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 2260 KB Output is correct
2 Correct 73 ms 2256 KB Output is correct
3 Correct 98 ms 2260 KB Output is correct