oj.uz

Submission #133273

# Submission time Handle Problem Language Result Execution time Memory
133273 2019-07-20T10:27:36 Z miguel Journey (NOI18_journey) C++14
20 / 100
 2 ms 636 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});
        }
    }
    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;}
}

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
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
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 Incorrect 2 ms 636 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
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 Incorrect 2 ms 636 KB Output isn't correct
4 Halted 0 ms 0 KB -