Submission #527637

#TimeUsernameProblemLanguageResultExecution timeMemory
527637EvangToll (BOI17_toll)C++17
100 / 100
82 ms22444 KiB
#include <bits/extc++.h> using namespace std; using namespace __gnu_pbds; #ifdef _DEBUG #define dout(x) clog << "Line " << __LINE__ << ": " << #x << "=" << (x) << el #else #define dout(x) #endif mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); #define uid(a,b) uniform_int_distribution<int>(a,b)(rng) #define ins insert #define ssize(x) (int((x).size())) #define bs(args...) binary_search(args) #define lb(args...) lower_bound(args) #define ub(args...) upper_bound(args) #define all(x) (x).begin(),(x).end() #define mp(a, b) make_pair(a, b) #define mt(args...) make_tuple(args) #define pb(x) push_back(x) #define eb(args...) emplace_back(args) #define ff first #define ss second #define die exit(0) template<typename T> using vc = vector<T>; template<typename T> using uset = unordered_set<T>; template<typename A, typename B> using umap = unordered_map<A, B>; template<typename T, typename Comp> using pq = std::priority_queue<T, vc<T>, Comp>; template<typename T> using maxpq = pq<T, less<T>>; template<typename T> using minpq = pq<T, greater<T>>; template<typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; using db = double; using ld = long double; using ll = long long; using ull = unsigned long long; using pi = pair<int, int>; using pll = pair<ll, ll>; using vi = vc<int>; using vll = vc<ll>; using vpi = vc<pi>; using vpll = vc<pll>; using str = string; constexpr char el = '\n'; constexpr char sp = ' '; constexpr int inf = 0x3f3f3f3f; constexpr ll llinf = 0x3f3f3f3f3f3f3f3fLL; // --------------------------------------------------------------------- const int LG = 16; const int N = 5e4+5; const int K = 6; int n, m, k, o, up[LG][N][K], d[2][K]; int dis(int x, int y){ memset(d[0], 0x3f, sizeof d[0]); d[0][y%k] = 0; int s = y/k, u = y/k-x/k; for(int p = 0; u > 0; ++p, u /= 2){ if(u&1^1) continue; for(int i = 0; i < k; ++i){ d[1][i] = inf; for(int j = 0; j < k; ++j) d[1][i] = min(d[1][i], up[p][s*k+j][i] + d[0][j]); } s -= 1<<p; swap(d[0], d[1]); } return d[0][x%k]; } signed main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed; clog << fixed; clog << unitbuf; #ifdef _DEBUG freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); freopen("debug.txt", "w", stderr); #else //freopen(".in", "r", stdin); //freopen(".out", "w", stdout); #endif memset(up, 0x3f, sizeof up); cin >> k >> n >> m >> o; while(m--){ int x, y, w; cin >> x >> y >> w; up[0][y][x%k] = min(up[0][y][x%k], w); } for(int g = 1; g < LG; ++g) for(int v = 0; v < n; ++v) for(int i = 0; i < k; ++i) for(int j = 0; j < k; ++j) if((v/k-(1<<(g-1)))*k+j>=0) up[g][v][i] = min(up[g][v][i], up[g-1][(v/k-(1<<(g-1)))*k+j][i] + up[g-1][v][j]); #ifdef _DEBUG clog << "Line " << __LINE__ << ":\n"; for(int i = 0; i < n; ++i){ for(int j = 0; j < k; ++j) clog << up[2][i][j] << sp; clog << el; } clog << el; #endif while(o--){ int x, y; cin >> x >> y; if(x/k >= y/k){ dout(1); cout << -1 << el; continue; } int ans = dis(x, y); if(ans>=inf) cout << -1 << el; else cout << ans << el; } }

Compilation message (stderr)

toll.cpp: In function 'int dis(int, int)':
toll.cpp:73:13: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   73 |         if(u&1^1)
      |            ~^~
#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...