Submission #1162027

#	Time	Username	Problem	Language	Result	Execution time	Memory
1162027		Nonoze	Toll (BOI17_toll)	C++20	100 / 100	147 ms	74252 KiB

toll

/*
*	Author: Nonoze
*	Created: Wednesday 05/03/2025
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef IN_LOCAL
	#define dbg(...)
#endif

// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=16;



void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}


struct block{
	vector<vector<int>> ways;
	block(int k) {
		ways.resize(k, vector<int>(k, inf));
	}
};

int k;

block merge(block a, block b) {
	block res(k);
	for (int i=0; i<k; i++) {
		for (int j=0; j<k; j++) {
			for (int l=0; l<k; l++) {
				cmin(res.ways[i][j], a.ways[i][l] + b.ways[l][j]);
			}
		}
	}
	return res;
}


int n, m, q;
vector<vector<pair<int, int>>> adj;
vector<vector<block>> up;



void solve() {
	read(k, n, m, q);
	int nb = (n+k-1)/k; n=nb*k;
	adj.clear(), adj.resize(n);
	for (int i=0; i<m; i++) {
		int u, v, w; read(u, v, w);
		adj[u].pb({v, w});
	}
	up.clear(), up.resize(nb, vector<block>(LOG, block(k)));
	for (int i=0; i<nb; i++) {
		for (int u=i*k; u<(i+1)*k; u++) {
			for (auto [v, w]: adj[u]) {
				up[i][0].ways[u%k][v%k]=w;
			}
		}
	}
	
	for (int bit=1; bit<LOG; bit++) {
		for (int i=0; i+(1<<bit)<nb; i++) {
			for (int a=0; a<k; a++) {
				for (int b=0; b<k; b++) {
					for (int c=0; c<k; c++) {
						cmin(up[i][bit].ways[a][c], up[i][bit-1].ways[a][b] + up[i+(1<<(bit-1))][bit-1].ways[b][c]);
					}
				}
			}
		}
	}


	while (q--) {
		int X, Y; read(X, Y);
		int a=X/k, b=Y/k;
		block res(k); for (int i=0; i<k; i++) res.ways[i][i]=0;
		for (int bit=LOG-1; bit>=0; bit--) {
			if (a+(1<<bit)<=b) {
				res=merge(res, up[a][bit]);
				a+=1<<bit;
			}
		}
		if (res.ways[X%k][Y%k]==inf) cout << -1 << endl;
		else cout << res.ways[X%k][Y%k] << endl;
	}
}

• Subtask 1: 7 / 7
• Subtask 2: 10 / 10
• Subtask 3: 8 / 8
• Subtask 4: 31 / 31
• Subtask 5: 44 / 44