oj.uz

Submission #631406

# Submission time Handle Problem Language Result Execution time Memory
631406 2022-08-18T05:44:23 Z Soul234 Ceste (COCI17_ceste) C++14
160 / 160
 88 ms 3696 KB 
#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;
const ll INF = 1e18;

struct Edge {
    int to, tt, cst;
};

struct Dat {
    int cst, tt, u;
    bool operator<(const Dat &rhs) const {
        return cst > rhs.cst;
    }
};

const int MX = 2e3+5;
V<Edge> adj[MX];
int N, M, mnT[MX];
ll ans[MX];

void solve() {
    cin >> N >> M;
    F0R(i, M) {
        int u, v, tt, cst;
        cin >> u >> v >> tt >> cst;
        adj[u].pb({v, tt, cst});
        adj[v].pb({u, tt, cst});
    }
    memset(mnT, 0x3f, sizeof mnT);
    memset(ans, 0x3f, sizeof ans);
    mnT[1] = 0;
    priority_queue<Dat> pq;
    pq.push({0, 0, 1});
    while(sz(pq)) {
        int u = pq.top().u;
        int cst = pq.top().cst;
        int tt = pq.top().tt;
        pq.pop();
        if(tt > mnT[u]) continue;
        ckmin(ans[u], 1LL * cst * tt);
        ckmin(mnT[u], tt);
        each(ed, adj[u]) {
            int cstv = cst + ed.cst;
            int v = ed.to;
            int ttv = tt + ed.tt;
            if(ttv < mnT[v]) {
                pq.push({cstv, ttv, v});
            }
        }
    }
    FOR(i,2,N+1) {
        cout << (ans[i] >= INF ? -1 : ans[i]) << nl;
    }
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

ceste.cpp: In function 'void setIO(std::string)':
ceste.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ceste.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 1 ms 512 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 660 KB Output is correct
2 Correct 11 ms 916 KB Output is correct
3 Correct 14 ms 960 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 1360 KB Output is correct
2 Correct 84 ms 3680 KB Output is correct
3 Correct 2 ms 596 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 728 KB Output is correct
2 Correct 88 ms 3696 KB Output is correct
3 Correct 4 ms 468 KB Output is correct

Subtask #9
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 556 KB Output is correct
2 Correct 77 ms 1360 KB Output is correct
3 Correct 71 ms 1376 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 1284 KB Output is correct
2 Correct 63 ms 1408 KB Output is correct
3 Correct 87 ms 1352 KB Output is correct