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 f first
#define s second
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
typedef long long ll;
typedef pair<int, int> pii;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int dp[10005][405];
vector<pii> adj[10005];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, h;
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;
if(a <= i)continue;
adj[i].pb({a,b});
}
}
dp[0][0] = 1;
for(int i = 0; i < n;i ++){
for(int j = 0;j <= m; j++){
for(auto it : adj[i]){
if(it.s + j <= m){
dp[it.f][j+it.s] += dp[i][j];
}
}
if(j != m){
dp[i][j+1] += dp[i][j];
}
}
}
for(int i = 0; i < m; i++){
cout << min(500000001,dp[n-1][i]-(i == 0 ? 0 : dp[n-1][i-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... |