Submission #526690

#TimeUsernameProblemLanguageResultExecution timeMemory
526690chicken337Autobus (COCI22_autobus)C++14
70 / 70
406 ms4684 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define ii pair<int, int> #define iii pair<int, ii> #define ff first #define ss second const int INF = 1e18; signed main(){ ios::sync_with_stdio(0); cin.tie(0); int v, e; cin >> v >> e; int mat[v][v]; for(int i = 0; i < v; i ++) for(int k = 0; k < v; k ++) mat[i][k] = INF; for(int i = 0; i < v; i ++) mat[i][i] = 0; for(int i = 0; i < e; i ++){ int a, b, w; cin >> a >> b >> w; mat[a-1][b-1] = min(mat[a-1][b-1], w); } vector<ii> adj[v]; for(int i = 0; i < v; i ++) for(int j = 0; j < v; j ++) if(mat[i][j] != INF) adj[i].emplace_back(j, mat[i][j]); int dist[v][v][v+1]; memset(dist, -1, sizeof dist); for(int i = 0; i < v; i ++){ priority_queue<iii, vector<iii>, greater<iii>> pq; pq.push({0, {i, 0}}); dist[i][i][0] = 0; while(!pq.empty()){ auto tp = pq.top(); pq.pop(); if(dist[i][tp.ss.ff][tp.ss.ss] != tp.ff || tp.ss.ss == v) continue; for(auto& [nxt, wt] : adj[tp.ss.ff]){ if(dist[i][nxt][tp.ss.ss+1] == -1 || dist[i][nxt][tp.ss.ss+1] > wt + tp.ff){ dist[i][nxt][tp.ss.ss+1] = wt + tp.ff; pq.push({dist[i][nxt][tp.ss.ss+1], {nxt, tp.ss.ss+1}}); } } } for(int j = 0; j < v; j ++) for(int k = 1; k <= v; k ++) if(dist[i][j][k-1] != -1) dist[i][j][k] = min(dist[i][j][k-1], dist[i][j][k]); } int K, q; cin >> K >> q; K = min(K, v); while(q --){ int ci, di; cin >> ci >> di; cout << dist[ci-1][di-1][K] << '\n'; } } /* 4 7 1 2 1 1 4 10 2 3 1 2 4 5 3 2 2 3 4 1 4 3 2 1 3 1 4 4 2 3 3 */

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:39:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   39 |             for(auto& [nxt, wt] : adj[tp.ss.ff]){
      |                       ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...