Submission #557551

# Submission time Handle Problem Language Result Execution time Memory
557551 2022-05-05T13:01:40 Z fatemetmhr Toll (BOI17_toll) C++17
49 / 100
3000 ms 17612 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];
vector <pair<int, int>> jda[maxn5], adj[maxn5];

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 < q; i++){
        int a, b; cin >> a >> b;
        if(a == 0){
            cout << prec[b] << '\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';
    }
}
# Verdict Execution time Memory Grader output
1 Execution timed out 3024 ms 13544 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 63 ms 13028 KB Output is correct
2 Correct 6 ms 9732 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9728 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 9 ms 9896 KB Output is correct
8 Correct 8 ms 9868 KB Output is correct
9 Correct 32 ms 13856 KB Output is correct
10 Correct 89 ms 17128 KB Output is correct
11 Correct 57 ms 14820 KB Output is correct
12 Correct 39 ms 14104 KB Output is correct
13 Correct 83 ms 17612 KB Output is correct
14 Correct 51 ms 14564 KB Output is correct
15 Correct 43 ms 13652 KB Output is correct
16 Correct 46 ms 13660 KB Output is correct
# 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 5 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 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 8 ms 9940 KB Output is correct
9 Correct 7 ms 9812 KB Output is correct
10 Correct 76 ms 13232 KB Output is correct
11 Correct 96 ms 13184 KB Output is correct
12 Correct 110 ms 15148 KB Output is correct
13 Correct 163 ms 15436 KB Output is correct
14 Correct 107 ms 14284 KB Output is correct
15 Correct 66 ms 12492 KB Output is correct
16 Correct 51 ms 12552 KB Output is correct
# 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 5 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 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 8 ms 9940 KB Output is correct
9 Correct 7 ms 9812 KB Output is correct
10 Correct 76 ms 13232 KB Output is correct
11 Correct 96 ms 13184 KB Output is correct
12 Correct 110 ms 15148 KB Output is correct
13 Correct 163 ms 15436 KB Output is correct
14 Correct 107 ms 14284 KB Output is correct
15 Correct 66 ms 12492 KB Output is correct
16 Correct 51 ms 12552 KB Output is correct
17 Correct 1182 ms 13252 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 6 ms 9684 KB Output is correct
20 Correct 6 ms 9712 KB Output is correct
21 Correct 7 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 17 ms 9812 KB Output is correct
24 Correct 17 ms 9812 KB Output is correct
25 Correct 25 ms 9812 KB Output is correct
26 Correct 23 ms 9856 KB Output is correct
27 Correct 1092 ms 13364 KB Output is correct
28 Correct 1658 ms 15056 KB Output is correct
29 Correct 2090 ms 15764 KB Output is correct
30 Correct 1373 ms 14420 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 3024 ms 13544 KB Time limit exceeded
2 Halted 0 ms 0 KB -