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;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
const int mxn = 1e4+10;
const int mxm = 410;
const ll inf = 5e8+1;
ll cnt[mxn][mxm];
ll dist[mxn];
vector<pii> paths[mxn],rg[mxn];
int n,m,h;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>m>>h;
for(int i = 0;i<n-1;i++){
for(int j = 0;j<h;j++){
int a,b;
cin>>a>>b;
paths[i].push_back({a,b});
rg[i].push_back({a,b});
}
}
cnt[0][0] = 1;
for(int i = 0;i<n;i++){
for(auto nxt:paths[i]){
if(nxt.fs<=i)continue;
ll pre = 0;
for(int j = 0;j+nxt.sc<m;j++){
pre = min(pre+cnt[i][j],inf);
cnt[nxt.fs][j+nxt.sc] = min(cnt[nxt.fs][j+nxt.sc]+pre,inf);
}
}
}
for(int i = 0;i<m;i++)cout<<cnt[n-1][i]<<' ';
}
# | 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... |