제출 #371186

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
371186		evn	Journey (NOI18_journey)	C++14	0 / 100	1 ms	620 KiB

journey

#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>;

ll dp[10005][405];
vector<pair<int,long>> 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];
					dp[it.f][j+it.s]=min(dp[it.f][j+it.s], 500000001LL);
				}
			}
			if(i != 0 && j != m){
				dp[i][j+1] += dp[i][j];
				dp[i][j+1] = min(dp[i][j+1], 500000001LL);
			}
		}
	}
	cout << dp[n-1][0] << " ";
	for(int i = 1; i < m; i++){
		cout << min(500000001LL, dp[n-1][i] - dp[n-1][i-1]) << " ";
	}
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 23
• Subtask 3: 0 / 26
• Subtask 4: 0 / 31