Submission #992661

#	Time	Username	Problem	Language	Result	Execution time	Memory
992661		goats_9	Toll (BOI17_toll)	C++17	0 / 100	227 ms	524288 KiB

toll

/* Author: goats_9 */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
const int N = 500001;
const int K = 5;
int k, n, m, o;

int spt[N][17][K][K], ans[K][K], tmp[K][K];

void merge(int res[5][5], int a[5][5], int b[5][5]) {
	for (int x = 0; x < k; x++) {
		for (int y = 0; y < k; y++) {
			for (int z = 0; z < k; z++) {
				res[x][y] = min(res[x][y], a[x][z] + b[z][y]);
			}
		}
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> k >> n >> m >> o;
	memset(spt, 0x3f, sizeof(spt));
	for (int i = 0; i < m; i++) {
		int a, b, t;
		cin >> a >> b >> t;
		spt[a/k][0][a%k][b%k] = t;
	}
	for (int j = 1; j < 17; j++) {
		int bm = 1<<j;
		for (int i = 0; i + bm < (n + k - 1) / k; i++) {
			merge(spt[i][j], spt[i][j - 1], spt[i + bm/2][j - 1]);
		}
	}
	while (o--) {
		int a, b;
		cin >> a >> b;
		memset(ans, 0x3f, sizeof(ans));
		for (int i = 0; i < 5; i++) ans[i][i] = 0;
		for (int a1 = a / k, b1 = b / k, i = 16; i >= 0; i--) {
			if (a1 + (1<<i) <= b1) {
				memset(tmp, 0x3f, sizeof(tmp));
				merge(tmp, ans, spt[a1][i]);
				memcpy(ans, tmp, sizeof(ans));
				a1 += (1<<i);
			}
		}
		cout << (ans[a%k][b%k] == 0x3f3f3f3f ? -1 : ans[a%k][b%k]) << '\n';
	}
	return 0;
}

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