oj.uz

Submission #651501

# Submission time Handle Problem Language Result Execution time Memory
651501 2022-10-19T06:39:23 Z alvinpiter Toll (BOI17_toll) C++17
100 / 100
 284 ms 28620 KB 
/*
Picture the nodes are arranged in a 2D matrix with K rows
where each column contains nodes with the same floor(index/K).

dp[node][jump][k] = minimum cost to go from node "node" to the k-th node located in column node/K + 2^jump.
*/

#include<bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MAXN 50000
#define MAXLG 15
#define MAXK 5

int K, N, M, Q, dp[MAXN + 3][MAXLG + 3][MAXK + 3];

int bf(int a, int b) {
  int ans = 0;
  while (a != b) {
    if (dp[a][0][0] < INF) {
      ans += dp[a][0][0];
      a += 1;
    } else {
      return -1;
    }
  }

  return ans;
}

int main() {
  cin >> K >> N >> M >> Q;

  for (int i = 0; i < N; i++) {
    for (int jump = 0; jump <= MAXLG; jump++) {
      for (int k = 0; k <= K; k++) {
        dp[i][jump][k] = INF;
      }
    }
  }

  for (int i = 0; i < M; i++) {
    int a, b, t;
    cin >> a >> b >> t;

    dp[a][0][b%K] = t;
  }

  int numberOfColumns = N/K + (N%K == 0 ? 0 : 1);
  for (int jump = 1; jump <= MAXLG; jump++) {
    for (int i = 0; i < N; i++) {
      int currentColumn = i/K;
      int destinationColumn = currentColumn + (1 << jump);

      if (destinationColumn >= numberOfColumns) {
        continue;
      }

      for (int destinationK = 0; destinationK < K; destinationK++) {
        for (int transitK = 0; transitK < K; transitK++) {
          int transitColumn = currentColumn + (1 << (jump - 1));
          int transitNode = transitColumn * K + transitK;

          dp[i][jump][destinationK] = min(dp[i][jump][destinationK], dp[i][jump - 1][transitK] + dp[transitNode][jump - 1][destinationK]);
        }
      }
    }
  }

  for (int q = 0; q < Q; q++) {
    int a, b;
    cin >> a >> b;

    int currentColumn = a/K, destinationColumn = b/K;
    int columnDiff = destinationColumn - currentColumn;

    map<int, int> currentNodes;
    currentNodes[a] = 0;

    for (int jump = 0; jump <= MAXLG; jump++) {
      if (columnDiff & (1 << jump)) {
        map<int, int> newNodes;

        for (auto [currentNode, currentCost]: currentNodes) {
          for (int destinationK = 0; destinationK < K; destinationK++) {
            int destinationColumn = currentColumn + (1 << jump);
            int destinationNode = destinationColumn * K + destinationK;
            int newCost = min(INF, currentCost + dp[currentNode][jump][destinationK]);

            if (newNodes.find(destinationNode) == newNodes.end()) {
              newNodes[destinationNode] = newCost;
            } else {
              newNodes[destinationNode] = min(newNodes[destinationNode], newCost);
            }
          }
        }

        swap(currentNodes, newNodes);
        currentColumn += (1 << jump);
      }
    }

    if (currentNodes.find(b) != currentNodes.end() && currentNodes[b] < INF) {
      cout << currentNodes[b] << endl;
    } else {
      cout << -1 << endl;
    }
  }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 28564 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 4 ms 852 KB Output is correct
6 Correct 3 ms 852 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 104 ms 28620 KB Output is correct
9 Correct 100 ms 28492 KB Output is correct
10 Correct 52 ms 28488 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 28460 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 23 ms 852 KB Output is correct
8 Correct 24 ms 916 KB Output is correct
9 Correct 89 ms 28600 KB Output is correct
10 Correct 178 ms 28460 KB Output is correct
11 Correct 143 ms 28600 KB Output is correct
12 Correct 138 ms 28456 KB Output is correct
13 Correct 164 ms 17188 KB Output is correct
14 Correct 98 ms 17228 KB Output is correct
15 Correct 101 ms 17216 KB Output is correct
16 Correct 101 ms 17192 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 260 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 74 ms 28456 KB Output is correct
11 Correct 137 ms 28464 KB Output is correct
12 Correct 147 ms 28464 KB Output is correct
13 Correct 158 ms 28492 KB Output is correct
14 Correct 122 ms 28492 KB Output is correct
15 Correct 98 ms 17192 KB Output is correct
16 Correct 99 ms 17192 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 260 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 74 ms 28456 KB Output is correct
11 Correct 137 ms 28464 KB Output is correct
12 Correct 147 ms 28464 KB Output is correct
13 Correct 158 ms 28492 KB Output is correct
14 Correct 122 ms 28492 KB Output is correct
15 Correct 98 ms 17192 KB Output is correct
16 Correct 99 ms 17192 KB Output is correct
17 Correct 139 ms 28472 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 8 ms 852 KB Output is correct
24 Correct 10 ms 852 KB Output is correct
25 Correct 15 ms 868 KB Output is correct
26 Correct 13 ms 852 KB Output is correct
27 Correct 77 ms 28464 KB Output is correct
28 Correct 169 ms 28384 KB Output is correct
29 Correct 176 ms 28416 KB Output is correct
30 Correct 149 ms 28456 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 28564 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 4 ms 852 KB Output is correct
6 Correct 3 ms 852 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 104 ms 28620 KB Output is correct
9 Correct 100 ms 28492 KB Output is correct
10 Correct 52 ms 28488 KB Output is correct
11 Correct 135 ms 28460 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 23 ms 852 KB Output is correct
18 Correct 24 ms 916 KB Output is correct
19 Correct 89 ms 28600 KB Output is correct
20 Correct 178 ms 28460 KB Output is correct
21 Correct 143 ms 28600 KB Output is correct
22 Correct 138 ms 28456 KB Output is correct
23 Correct 164 ms 17188 KB Output is correct
24 Correct 98 ms 17228 KB Output is correct
25 Correct 101 ms 17216 KB Output is correct
26 Correct 101 ms 17192 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 260 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 2 ms 852 KB Output is correct
33 Correct 2 ms 852 KB Output is correct
34 Correct 4 ms 852 KB Output is correct
35 Correct 3 ms 852 KB Output is correct
36 Correct 74 ms 28456 KB Output is correct
37 Correct 137 ms 28464 KB Output is correct
38 Correct 147 ms 28464 KB Output is correct
39 Correct 158 ms 28492 KB Output is correct
40 Correct 122 ms 28492 KB Output is correct
41 Correct 98 ms 17192 KB Output is correct
42 Correct 99 ms 17192 KB Output is correct
43 Correct 139 ms 28472 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 8 ms 852 KB Output is correct
50 Correct 10 ms 852 KB Output is correct
51 Correct 15 ms 868 KB Output is correct
52 Correct 13 ms 852 KB Output is correct
53 Correct 77 ms 28464 KB Output is correct
54 Correct 169 ms 28384 KB Output is correct
55 Correct 176 ms 28416 KB Output is correct
56 Correct 149 ms 28456 KB Output is correct
57 Correct 284 ms 28592 KB Output is correct
58 Correct 99 ms 28480 KB Output is correct
59 Correct 156 ms 28468 KB Output is correct