Submission #133271

#TimeUsernameProblemLanguageResultExecution timeMemory
133271miguelJourney (NOI18_journey)C++14
20 / 100
3 ms632 KiB
#include<bits/stdc++.h> using namespace std; #define rc(x) return cout<<x<<endl,0 #define pb push_back #define dbg(x) cout << #x << '=' << x << '\n'; #define ll long long #define int ll #define sz size() #define x first #define y second #define pi pair <int, int> #define pii pair <int, pi> #define vi vector <int> const ll mod = 998244353; int n, m, h, dp[10001][401]; vector <pi> g[10001]; int32_t main(){ ios_base :: sync_with_stdio(0); cin.tie(); cout.tie(); cin>>n>>m>>h; for(int i=0; i<n-1; i++){ for(int j=1; j<=h; j++){ int x, y; cin>>x>>y; g[i].pb({x, y}); } } dp[0][0]=1; for(int i=0; i<n; i++){ for(int j=0; j<=m; j++){ for(pi xd : g[i]){ for(int lol=j+xd.y; lol<m; lol++){ if(dp[i][j]==(ll)5e8+1) dp[xd.x][lol]=(ll)5e8+1; else dp[xd.x][lol]+=dp[i][j]; } } } } // for(int i=0; i<n; i++){ // cout<<i<<": "; for(int j=0; j<m; j++) cout<<min((ll)5e8+1, dp[n-1][j])<<" "; //cout<<endl;} }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...