Submission #133438

#	Time	Username	Problem	Language	Result	Execution time	Memory
133438		miguel	Journey (NOI18_journey)	C++14	100 / 100	252 ms	38776 KiB

journey

#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-1; 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];
                }*/
            }
            if(j<m-1) dp[i][j+1]+=dp[i][j];
            dp[i][j+1]=min(dp[i][j+1], (ll)5e8+1);
        }
    }
    //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];cout<<min((ll)5e8+1, dp[n-1][j])<<" ";} //cout<<endl;}
}

Compilation message (stderr)

journey.cpp: In function 'int32_t main()':
journey.cpp:46:59: warning: array subscript is below array bounds [-Warray-bounds]
     for(int j=0; j<m; j++){if(j<0) dp[n-1][j]+=dp[n-1][j-1];cout<<min((ll)5e8+1, dp[n-1][j])<<" ";} //cout<<endl;}
                                                ~~~~~~~~~~~^

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