# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146968 | gs14004 | Journey (NOI18_journey) | C++17 | 76 ms | 3952 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 sz(v) ((int)(v).size())
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
const int MAXN = 10005;
const int mod = 5e8 + 1;
int n, m, h;
vector<pi> nxt[MAXN];
int dp[MAXN][405];
int add[MAXN][405];
int main(){
scanf("%d %d %d",&n,&m,&h);
for(int i=0; i<n-1; i++){
for(int j=0; j<h; j++){
int x, y; scanf("%d %d",&x,&y);
if(x > i){
nxt[i].emplace_back(x, y);
}
}
}
dp[0][0] = 1;
for(int i=0; i<m; i++){
for(int j=0; j<n; j++){
add[i+1][j] = min(add[i+1][j] + add[i][j], mod);
dp[i][j] = min(dp[i][j] + add[i][j], mod);
for(auto &k : nxt[j]){
if(i + k.second < m){
add[i + k.second][k.first] =
min(add[i + k.second][k.first] + dp[i][j], mod);
}
}
}
cout << dp[i][n-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... |