oj.uz

Submission #548791

# Submission time Handle Problem Language Result Execution time Memory
548791 2022-04-14T12:00:42 Z jack715 Journey (NOI18_journey) C++14
43 / 100
 1801 ms 262144 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define bb back
#define ff first
#define ss second
#define int long long

using namespace std;

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, m, h;
    cin >> n >> m >> h;
    vector<vector<pair<int, int> > > path(n, vector<pair<int, int> >(h));
    
    for (int i = 0; i < n-1; i++)
    for (int j = 0; j < h; j++) 
        cin >> path[i][j].ff >> path[i][j].ss;
    
    priority_queue<pair<int, int> > pq;
    pq.push({0, 0});
    vector<int> ans(m+5, 0);

    while (!pq.empty()) {
        int time = pq.top().ff, indx = pq.top().ss;
        pq.pop();
        if (-time >= m)
            continue;
        if (indx == n-1) {
            ans[-time]++;
            continue; 
        }

        for (int i = 0; i < h; i++) {
            if (path[indx][i].ff <= indx)
                continue;
            for (int j = path[indx][i].ss; j-time < m; j++)
                pq.push({time-j, path[indx][i].ff});
        }
    }

    for (int i = 0; i < m; i++)
        cout << ans[i] << ' ';
    cout << '\n';
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 4536 KB Output is correct
2 Correct 1801 ms 66112 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 71 ms 4536 KB Output is correct
4 Correct 1801 ms 66112 KB Output is correct
5 Runtime error 306 ms 262144 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 71 ms 4536 KB Output is correct
4 Correct 1801 ms 66112 KB Output is correct
5 Runtime error 306 ms 262144 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -