oj.uz

답안 #705399

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705399 2023-03-04T09:59:54 Z aedmhsn Journey (NOI18_journey) C++17
69 / 100
 2000 ms 37116 KB 
#include <bits/stdc++.h>
using namespace std;
 
 
#define A first
#define B second
#define MP make_pair
#define ms(a, x) memset(a, x, sizeof(a)) 
 
 
#define boost() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long double, long double> pld;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);

const int mxN=1e4+5;

ll n, m, h, dp[mxN][405];
vector <vector<pii>> adj(mxN);

ll solve(int node, int date){
    if(date < 0)
        return 0;
    if(node == 0 && date == 0)
        return 1;
    if(dp[node][date] != -1)
        return dp[node][date];
    ll sum=0;
    bool over=false;
    for(auto [x, y]:adj[node]){
        if(x < node){
            for(int i=0; i<m; i++){
                sum += solve(x, date-y-i);
                if(sum >= 5e8+1){
                    sum = 5e8+1;
                    over=true;
                    break;
                }
            }
            if(over)
                break;
        }
    }
    return dp[node][date]=sum;
}


int main(){
    ms(dp, -1);
    cin >> n >> m >> h;
    for(int i=0; i<n-1; i++){
        for(int j=0; j<h; j++){
            int x, y;
            cin >> x >> y;
            adj[x].push_back({i, y});
        }
    }
    for(int i=0; i<=m-1; i++)
        cout << solve(n-1, i) << " ";
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 32212 KB Output is correct
2 Correct 15 ms 32264 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 32340 KB Output is correct
2 Correct 14 ms 32268 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 32212 KB Output is correct
2 Correct 15 ms 32264 KB Output is correct
3 Correct 13 ms 32340 KB Output is correct
4 Correct 14 ms 32268 KB Output is correct
5 Correct 32 ms 32268 KB Output is correct
6 Correct 30 ms 32212 KB Output is correct

Subtask #4
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 32212 KB Output is correct
2 Correct 15 ms 32264 KB Output is correct
3 Correct 13 ms 32340 KB Output is correct
4 Correct 14 ms 32268 KB Output is correct
5 Correct 32 ms 32268 KB Output is correct
6 Correct 30 ms 32212 KB Output is correct
7 Correct 520 ms 37116 KB Output is correct
8 Execution timed out 2071 ms 35376 KB Time limit exceeded
9 Halted 0 ms 0 KB -