oj.uz

Submission #133438

# Submission time Handle Problem Language Result Execution time Memory
133438 2019-07-20T16:51:05 Z miguel Journey (NOI18_journey) C++14
100 / 100
 252 ms 38776 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-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

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.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 2 ms 632 KB Output is correct
5 Correct 4 ms 888 KB Output is correct
6 Correct 4 ms 888 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 2 ms 632 KB Output is correct
5 Correct 4 ms 888 KB Output is correct
6 Correct 4 ms 888 KB Output is correct
7 Correct 146 ms 38776 KB Output is correct
8 Correct 252 ms 23800 KB Output is correct
9 Correct 63 ms 3676 KB Output is correct
10 Correct 198 ms 5284 KB Output is correct