제출 #714966

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
714966		Charizard2021	Toll (BOI17_toll)	C++17	100 / 100	246 ms	85632 KiB

toll

#include <bits/stdc++.h>
using namespace std;
int k, n, m, o;
int dp[50000][17][5][5], ans[5][5], tmp[5][5];
int main() {
	cin >> k >> n >> m >> o;
    for(int i = 0; i < 50000; i++){
        for(int j = 0; j < 17; j++){
            for(int k1 = 0; k1 < 5; k1++){
                for(int l = 0; l < 5; l++){
                    dp[i][j][k1][l] = 1000000000;
                }
            }
        }
    }
	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++) {
            for (int x = 0; x < k; x++) {
                for (int y = 0; y < k; y++) {
                    for (int z = 0; z < k; z++) {
                        dp[i][j][x][y] = min(dp[i][j][x][y], dp[i][j - 1][x][z] + dp[i + (1 << j - 1)][j - 1][z][y]);
                    }
                }
            }
		}
	}
	while (o--) {
		int a, b;
		cin >> a >> b;
        for(int k1 = 0; k1 < 5; k1++){
            for(int l = 0; l < 5; l++){
                ans[k1][l] = 1000000000;
            }
        }
		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) {
				for(int k1 = 0; k1 < 5; k1++){
                    for(int l = 0; l < 5; l++){
                        tmp[k1][l] = 1000000000;
                    }
                }
                for (int x = 0; x < k; x++) {
                    for (int y = 0; y < k; y++) {
                        for (int z = 0; z < k; z++) {
                            tmp[x][y] = min(tmp[x][y], ans[x][z] + dp[curr][i][z][y]);
                        }
                    }
                }
				memcpy(ans, tmp, sizeof ans);
				curr += (1 << i);
			}
		}
		cout << (ans[a % k][b % k] == 1000000000 ? -1 : ans[a % k][b % k]) << '\n';
	}
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

toll.cpp: In function 'int main()':
toll.cpp:26:98: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   26 |                         dp[i][j][x][y] = min(dp[i][j][x][y], dp[i][j - 1][x][z] + dp[i + (1 << j - 1)][j - 1][z][y]);
      |                                                                                                ~~^~~

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