# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
392209 | JerryLiu06 | Toll (BOI17_toll) | C++11 | 323 ms | 101476 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#define pb push_back
#define f first
#define s second
int K, N, M, O; int DP[50010][20][5][5], CUR[5][5];
void comb(int res[5][5], int A[5][5], int B[5][5]) {
for (int i = 0; i < 5; i++) for (int j = 0; j < 5; j++) {
for (int k = 0; k < 5; k++) res[i][j] = min(res[i][j], A[i][k] + B[k][j]);
}
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> K >> N >> M >> O; memset(DP, 0x3f, sizeof DP);
for (int i = 0; i < M; i++) {
int A, B, T; cin >> A >> B >> T; DP[A / K][0][A % K][B % K] = T;
}
for (int j = 1; j < 20; j++) for (int i = 0; i + (1 << (j - 1)) <= N / K; i++) {
comb(DP[i][j], DP[i][j - 1], DP[i + (1 << (j - 1))][j - 1]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |