답안 #1003881

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1003881 2024-06-20T19:33:36 Z tien_07 Toll (BOI17_toll) C++17
컴파일 오류
0 ms 0 KB
#include <bits/stdc++.h>
using namespace std;

int k,n,m,q;
int dp[50000][17][6][6], ans[6][6], tmp[6][6];

void combine(int target[6][6], int a[6][6], int b[6][6]) {
	for (int x = 0; x < k; x++) {
		for (int y = 0; y < k; y++) {
			for (int z = 0; z < k; z++) {
				target[x][y] = min(target[x][y], a[x][z] + b[z][y]);
			}
		}
	}
}

void solve() {
    cin >> k >> n >> m >> q;
	memset(dp, 0x3f, sizeof dp);
	while (m--) {
		int a, b, t;
		cin >> a >> b >> t;
		dp[a / k][0][a % k][b % k] = t;
	}

	for (int j = 1; j < 17; j++) {
		for (int i = 0; i + (1 << j) < (n + k - 1) / k; i++) {
			combine(dp[i][j], dp[i][j - 1], dp[i + (1 << j - 1)][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 curr = a / k, dest = b / k, i = 16; ~i; i--) {
			if (curr + (1 << i) <= dest) {
				memset(tmp, 0x3f, sizeof tmp);
				combine(tmp, ans, dp[curr][i]);
				memcpy(ans, tmp, sizeof ans);
				curr += (1 << i);
			}
		}
		cout << (ans[a % k][b % k] == 0x3f3f3f3f ? -1 : ans[a % k][b % k])
		     << '\n';
	}
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    //freopen(TASK ".inp", "r", stdin);
    //freopen(TASK ".out", "w", stdout);
    int tc = 1; //cin >> tc;
    while (tc--) solve();
    return 0;
}

Compilation message

toll.cpp: In function 'void solve()':
toll.cpp:28:51: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   28 |    combine(dp[i][j], dp[i][j - 1], dp[i + (1 << j - 1)][j - 1]);
      |                                                 ~~^~~
toll.cpp:32:9: error: 'o' was not declared in this scope
   32 |  while (o--) {
      |         ^