| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 133435 |
2019-07-20T16:43:47 Z |
miguel |
Journey (NOI18_journey) |
C++14 |
|
3 ms |
632 KB |
#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});
}
}
for(int j=0; j<m; j++) dp[0][j]=1;
dp[0][0]=1;
for(int i=0; i<n; i++){
for(int j=0; j<=m; j++){
for(pi xd : g[i]){
bool ctrl=(xd.x>i && j+xd.y<m);
if(ctrl) dp[xd.x][j+xd.y]+=dp[i][j];
dp[xd.x][j+xd.y]=min((ll)5e8+1, dp[xd.x][j+xd.y]);
/*for(int lol=j+xd.y; lol<m && ctrl; 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[i][j])<<" "; cout<<endl;}
for(int j=0; j<m; j++){if(j>0) dp[n-1][j]+=dp[n-1][j-1]-1;cout<<min((ll)5e8+1, dp[n-1][j])<<" ";} //cout<<endl;}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
632 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
632 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
632 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
632 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
632 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
632 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
632 KB |
Output isn't correct |
