oj.uz

Submission #557558

# Submission time Handle Problem Language Result Execution time Memory
557558 2022-05-05T13:07:13 Z fatemetmhr Toll (BOI17_toll) C++17
56 / 100
 3000 ms 18908 KB 
// `Be name khoda` //

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb     push_back
#define all(x) x.begin(), x.end()
#define fi     first
#define se     second


const int maxn5 = 2e5 + 10;
const int inf   = 1e9;

int dis[maxn5], prec[maxn5], no = 0, cmp[maxn5], h[maxn5];
vector <pair<int, int>> jda[maxn5], adj[maxn5];
bool mark[maxn5];

inline void dfs(int v){
    mark[v] = true;
    cmp[v] = no;
    for(auto [u, t] : adj[v]){
        h[u] = h[v] + t;
        dfs(u);
    }
    return;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    int k, n, m, q; cin >> k >> n >> m >> q;
    for(int i = 0; i < m; i++){
        int a, b, t; cin >> a >> b >> t;
        jda[b].pb({a, t});
        adj[a].pb({b, t});
    }
    fill(prec, prec + n + 5, inf);
    prec[0] = 0;
    for(int i = 0; i < n; i++) for(auto [u, t] : adj[i])
        prec[u] = min(prec[u], prec[i] + t);
    for(int i = 0; i < n; i++) if(prec[i] == inf)
        prec[i] = -1;

    for(int i = 0; i < n; i++) if(!mark[i] && k == 1){
        dfs(i);
        no++;
    }
    for(int i = 0; i < q; i++){
        int a, b; cin >> a >> b;
        if(a == 0){
            cout << prec[b] << '\n';
            continue;
        }
        if(k == 1){
            if(cmp[a] == cmp[b])
                cout << h[b] - h[a] << '\n';
            else
                cout << -1 << '\n';
            continue;
        }
        fill(dis, dis + n + 4, inf);
        dis[b] = 0;
        for(int i = b; i > a; i--){
            for(auto [u, t] : jda[i])
                dis[u] = min(dis[u], dis[i] + t);
        }
        if(dis[a] == inf)
            dis[a] = -1;
        cout << dis[a] << '\n';
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 14840 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9812 KB Output is correct
6 Correct 6 ms 9812 KB Output is correct
7 Correct 6 ms 9812 KB Output is correct
8 Correct 36 ms 13552 KB Output is correct
9 Correct 28 ms 13268 KB Output is correct
10 Correct 8 ms 10196 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 12992 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 7 ms 9756 KB Output is correct
8 Correct 8 ms 9812 KB Output is correct
9 Correct 30 ms 13604 KB Output is correct
10 Correct 69 ms 14900 KB Output is correct
11 Correct 47 ms 13004 KB Output is correct
12 Correct 39 ms 12884 KB Output is correct
13 Correct 74 ms 15172 KB Output is correct
14 Correct 45 ms 13112 KB Output is correct
15 Correct 34 ms 12448 KB Output is correct
16 Correct 33 ms 12372 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9620 KB Output is correct
6 Correct 5 ms 9812 KB Output is correct
7 Correct 6 ms 9812 KB Output is correct
8 Correct 8 ms 9940 KB Output is correct
9 Correct 7 ms 9812 KB Output is correct
10 Correct 29 ms 13544 KB Output is correct
11 Correct 81 ms 13132 KB Output is correct
12 Correct 110 ms 15000 KB Output is correct
13 Correct 122 ms 15392 KB Output is correct
14 Correct 94 ms 14188 KB Output is correct
15 Correct 59 ms 12492 KB Output is correct
16 Correct 53 ms 12564 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9620 KB Output is correct
6 Correct 5 ms 9812 KB Output is correct
7 Correct 6 ms 9812 KB Output is correct
8 Correct 8 ms 9940 KB Output is correct
9 Correct 7 ms 9812 KB Output is correct
10 Correct 29 ms 13544 KB Output is correct
11 Correct 81 ms 13132 KB Output is correct
12 Correct 110 ms 15000 KB Output is correct
13 Correct 122 ms 15392 KB Output is correct
14 Correct 94 ms 14188 KB Output is correct
15 Correct 59 ms 12492 KB Output is correct
16 Correct 53 ms 12564 KB Output is correct
17 Correct 1154 ms 13248 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 5 ms 9712 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 8 ms 9812 KB Output is correct
24 Correct 16 ms 9812 KB Output is correct
25 Correct 25 ms 9812 KB Output is correct
26 Correct 22 ms 9852 KB Output is correct
27 Correct 28 ms 13564 KB Output is correct
28 Correct 1359 ms 15048 KB Output is correct
29 Correct 1573 ms 15648 KB Output is correct
30 Correct 1249 ms 14308 KB Output is correct

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 14840 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9812 KB Output is correct
6 Correct 6 ms 9812 KB Output is correct
7 Correct 6 ms 9812 KB Output is correct
8 Correct 36 ms 13552 KB Output is correct
9 Correct 28 ms 13268 KB Output is correct
10 Correct 8 ms 10196 KB Output is correct
11 Correct 45 ms 12992 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 6 ms 9684 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 7 ms 9756 KB Output is correct
18 Correct 8 ms 9812 KB Output is correct
19 Correct 30 ms 13604 KB Output is correct
20 Correct 69 ms 14900 KB Output is correct
21 Correct 47 ms 13004 KB Output is correct
22 Correct 39 ms 12884 KB Output is correct
23 Correct 74 ms 15172 KB Output is correct
24 Correct 45 ms 13112 KB Output is correct
25 Correct 34 ms 12448 KB Output is correct
26 Correct 33 ms 12372 KB Output is correct
27 Correct 5 ms 9684 KB Output is correct
28 Correct 5 ms 9684 KB Output is correct
29 Correct 4 ms 9684 KB Output is correct
30 Correct 5 ms 9684 KB Output is correct
31 Correct 5 ms 9620 KB Output is correct
32 Correct 5 ms 9812 KB Output is correct
33 Correct 6 ms 9812 KB Output is correct
34 Correct 8 ms 9940 KB Output is correct
35 Correct 7 ms 9812 KB Output is correct
36 Correct 29 ms 13544 KB Output is correct
37 Correct 81 ms 13132 KB Output is correct
38 Correct 110 ms 15000 KB Output is correct
39 Correct 122 ms 15392 KB Output is correct
40 Correct 94 ms 14188 KB Output is correct
41 Correct 59 ms 12492 KB Output is correct
42 Correct 53 ms 12564 KB Output is correct
43 Correct 1154 ms 13248 KB Output is correct
44 Correct 5 ms 9684 KB Output is correct
45 Correct 5 ms 9684 KB Output is correct
46 Correct 6 ms 9684 KB Output is correct
47 Correct 5 ms 9712 KB Output is correct
48 Correct 5 ms 9684 KB Output is correct
49 Correct 8 ms 9812 KB Output is correct
50 Correct 16 ms 9812 KB Output is correct
51 Correct 25 ms 9812 KB Output is correct
52 Correct 22 ms 9852 KB Output is correct
53 Correct 28 ms 13564 KB Output is correct
54 Correct 1359 ms 15048 KB Output is correct
55 Correct 1573 ms 15648 KB Output is correct
56 Correct 1249 ms 14308 KB Output is correct
57 Execution timed out 3082 ms 18908 KB Time limit exceeded
58 Halted 0 ms 0 KB -