Submission #304635

#TimeUsernameProblemLanguageResultExecution timeMemory
304635FalconToll (BOI17_toll)C++17
0 / 100
131 ms86264 KiB
#pragma GCC optimize("O2") #include <bits/stdc++.h> #ifdef DEBUG #include "debug.hpp" #endif using namespace std; #define all(c) (c).begin(), (c).end() #define traverse(c, it) for(auto it = (c).begin(); it != (c).end(); it++) #define rep(i, N) for(int i = 0; i < (N); i++) #define rep1(i, N) for(int i = 1; i <= (N); i++) #define rep2(i, s, e) for(int i = (s); i <= (e); i++) #define rep3(i, s, e, d) for(int i = (s); (d) >= 0 ? i <= (e) : i >= (e); i += (d)) #define pb push_back #ifdef DEBUG #define debug(x...) { dbg::depth++; string dbg_vals = dbg::to_string(x); dbg::depth--; dbg::fprint(__func__, __LINE__, #x, dbg_vals); } #define light_debug(x) { dbg::light = 1; dbg::dout << __func__ << ":" << __LINE__ << " " << #x << " = " << x << endl; dbg::light = 0; } #else #define debug(x...) #define light_debug(x) #endif template<typename T> inline T& ckmin(T& a, T b) { return a = a > b ? b : a; } template<typename T> inline T& ckmax(T& a, T b) { return a = a < b ? b : a; } using ll = long long; using pii = pair<int, int>; using vi = vector<int>; constexpr int MAXN{50'000}; constexpr ll INF{1LL << 40}; int K, N, M, O; vector<vector<pii>> adj; ll dist[MAXN][20][5]{}; //dist[a][b][c] = distance between [a] and [K * (a/K + 2^b) + c] void precalc() { int max_k = __lg((N + K - 1) / K); rep(i, N) rep(j, 1 + max_k) rep(k, K) dist[i][j][k] = INF; rep(v, N) for(auto u : adj[v]) dist[v][0][u.first % K] = u.second; rep1(k, max_k) rep(v, N) rep(x, K) rep(y, K) { int u = K * (v / K + (1 << (k - 1))) + y; ckmin(dist[v][k][x], dist[v][k - 1][y] + dist[u][k - 1][x]); } } ll query(int a, int b) { if(a == b) return 0; else if(a / K >= b / K) return INF; int d = __lg(b / K - a / K); ll ans = INF; rep(i, K) { int u = K * (a / K + (1 << d)) + i; ckmin(ans, dist[a][d][i] + query(u, b)); } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0); #ifdef DEBUG freopen("debug", "w", stderr); #endif cin >> K >> N >> M >> O; adj.resize(N); rep(_, M) { int a, b, t; cin >> a >> b >> t; adj[a].pb({b, t}); } precalc(); rep(_, O) { int a, b; cin >> a >> b; ll d = query(a, b); if(d < INF) cout << d << '\n'; else cout << -1 << '\n'; } #ifdef DEBUG dbg::dout << "\nExecution time: " << clock() << "ms\n"; #endif return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...