# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
586431 | M_W | Journey (NOI18_journey) | C++17 | 1 ms | 340 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>
#define ii pair<int, int>
using namespace std;
const int md = 500000001;
vector<ii> adj[505];
int dp[505][505];
int main(){
int N, M, H;
scanf("%d %d %d", &N, &M, &H);
for(int i = 1; i < N; i++){
for(int j = 1, u, w; j <= H; j++){
scanf("%d %d", &u, &w);
adj[i].push_back({u + 1, w});
}
}
dp[1][0] = 1;
for(int i = 1; i <= N; i++){
for(int j = 0; j < M; j++){
if(j > 0) dp[i][j] = min(dp[i][j] + dp[i][j - 1], md);
for(auto [x, w] : adj[i]){
dp[x][min(501, j + w)] += dp[i][j];
dp[x][min(501, j + w)] = min(dp[x][min(501, j + w)], md);
}
}
}
for(int i = 0; i < M; i++) printf("%d ", dp[N][i] - (i == 0 ? 0 : dp[N][i - 1]));
}
Compilation message (stderr)
# | 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... |