# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
960091 |
2024-04-09T16:02:56 Z |
sheldon |
Toll (BOI17_toll) |
C++14 |
|
213 ms |
78952 KB |
#include <bits/stdc++.h>
using namespace std;
const int nax = 5e4 + 5;
int dp[nax][16][5][5];
void combine (int first[5][5], int second[5][5], int third[5][5]) {
for (int i = 0; i < 5; ++i) {
for (int j = 0; j < 5; ++j) {
for (int k = 0; k < 5; ++k) {
third[i][k] = min (third[i][k], first[i][j] + second[j][k]);
}
}
}
}
void solve() {
int k, n, m, q;
cin >> k >> n >> m >> q;
memset (dp, 0x3f, sizeof (dp));
for (int i = 0; i < m; ++i) {
int a, b, t;
cin >> a >> b >> t;
int loca = a / k, locb = b / k;
dp[loca][0][a % k][b % k] = min (dp[loca][0][a % k][b % k], t);
}
for (int bit = 1; bit < 16; ++bit) {
for (int i = (n - 1) / k; i >= 0; --i) {
if (i + (1 << bit) > (n - 1) / k) continue;
combine (dp[i][bit - 1], dp[i + (1 << (bit - 1))][bit - 1], dp[i][bit]);
}
}
while (q--) {
int a, b;
cin >> a >> b;
int dist = b / k - a / k;
int loca = a % k, locb = b % k;
int at[5];
memset (at, 0x3f, sizeof (at));
bool found = 0;
int node = a / k;
for (int bit = 0; bit < 15; ++bit) {
int new_dp[5];
memset (new_dp, 0x3f, sizeof (new_dp));
if (dist & (1 << bit)) {
if (!found) {
for (int i = 0; i < k; ++i) {
at[i] = dp[a / k][bit][loca][i];
}
found = 1;
} else {
for (int i = 0; i < k; ++i) {
for (int j = 0; j < k; ++j) {
new_dp[i] = min (new_dp[i], at[j] + dp[node][bit][j][i]);
}
}
for (int i = 0; i < k; ++i) {
at[i] = new_dp[i];
}
}
node += (1 << bit);
}
}
cout << (at[locb] >= 1e9 ? -1 : at[locb]) << '\n';
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
}
Compilation message
toll.cpp: In function 'void solve()':
toll.cpp:26:27: warning: unused variable 'locb' [-Wunused-variable]
26 | int loca = a / k, locb = b / k;
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
213 ms |
78684 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
108 ms |
78932 KB |
Output is correct |
2 |
Correct |
26 ms |
78672 KB |
Output is correct |
3 |
Correct |
25 ms |
78684 KB |
Output is correct |
4 |
Correct |
25 ms |
78684 KB |
Output is correct |
5 |
Correct |
25 ms |
78684 KB |
Output is correct |
6 |
Correct |
25 ms |
78632 KB |
Output is correct |
7 |
Correct |
29 ms |
78684 KB |
Output is correct |
8 |
Correct |
28 ms |
78752 KB |
Output is correct |
9 |
Incorrect |
194 ms |
78716 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
78680 KB |
Output is correct |
2 |
Correct |
31 ms |
78684 KB |
Output is correct |
3 |
Correct |
25 ms |
78676 KB |
Output is correct |
4 |
Correct |
28 ms |
78676 KB |
Output is correct |
5 |
Correct |
24 ms |
78628 KB |
Output is correct |
6 |
Correct |
26 ms |
78684 KB |
Output is correct |
7 |
Correct |
26 ms |
78952 KB |
Output is correct |
8 |
Correct |
25 ms |
78680 KB |
Output is correct |
9 |
Correct |
26 ms |
78468 KB |
Output is correct |
10 |
Incorrect |
205 ms |
78924 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
78680 KB |
Output is correct |
2 |
Correct |
31 ms |
78684 KB |
Output is correct |
3 |
Correct |
25 ms |
78676 KB |
Output is correct |
4 |
Correct |
28 ms |
78676 KB |
Output is correct |
5 |
Correct |
24 ms |
78628 KB |
Output is correct |
6 |
Correct |
26 ms |
78684 KB |
Output is correct |
7 |
Correct |
26 ms |
78952 KB |
Output is correct |
8 |
Correct |
25 ms |
78680 KB |
Output is correct |
9 |
Correct |
26 ms |
78468 KB |
Output is correct |
10 |
Incorrect |
205 ms |
78924 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
213 ms |
78684 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |