Submission #924723

# Submission time Handle Problem Language Result Execution time Memory
924723 2024-02-09T14:55:18 Z a_l_i_r_e_z_a Toll (BOI17_toll) C++17
100 / 100
154 ms 269268 KB
// In the name of God
// Hope is last to die

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define int long long    
#define S second
#define F first
#define mp make_pair
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) (x).begin(), (x).end()
#define len(x) ((int)(x).size())

const int maxn = 4e5, lg = 17;
const int inf = 1e9 + 7, mod = 1e9 + 7;
int k, n, m, q;

struct D{
    int node[5];
    D(){
        for(int i = 0; i < 5; i++) node[i] = inf;
    }
} dp[maxn][lg];

D merge(D a, int u, int b){
    int aa[5];
    for(int i = 0; i < k; i++){
        int x = inf;
        for(int j = 0; j < k; j++) smin(x, a.node[j] + dp[u * k + j][b].node[i]);
        aa[i] = x;
    }
    for(int i = 0; i < k; i++) a.node[i] = aa[i];
    return a;
}

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> k >> n >> m >> q;
    for(int i = 0; i < m; i++){
        int u, v, w; cin >> u >> v >> w;
        dp[u][0].node[v % k] = w;
    }
    for(int i = n - 1; i >= 0; i--){
        for(int j = 1; j < lg; j++){
            dp[i][j] = merge(dp[i][j - 1], (i / k) + (1ll << (j - 1)), j - 1);
        }
    }
    while(q--){
        int u, v; cin >> u >> v;
        if(u / k >= v / k){
            cout << -1 << '\n';
            continue;
        }
        int x = u / k + 1, y = v / k;
        D ans = dp[u][0];
        for(int i = 0; i < lg; i++){
            if((y - x) & (1ll << i)){
                ans = merge(ans, x, i);
                x += 1ll << i;
            }
        }
        if(ans.node[v % k] >= inf) cout << -1 << '\n';
        else cout << ans.node[v % k] << '\n';
    }

    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 109 ms 266580 KB Output is correct
2 Correct 51 ms 266340 KB Output is correct
3 Correct 51 ms 266324 KB Output is correct
4 Correct 51 ms 266324 KB Output is correct
5 Correct 52 ms 266368 KB Output is correct
6 Correct 54 ms 266428 KB Output is correct
7 Correct 52 ms 266400 KB Output is correct
8 Correct 100 ms 266580 KB Output is correct
9 Correct 98 ms 266508 KB Output is correct
10 Correct 84 ms 266576 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 111 ms 266572 KB Output is correct
2 Correct 57 ms 266828 KB Output is correct
3 Correct 50 ms 266480 KB Output is correct
4 Correct 52 ms 266504 KB Output is correct
5 Correct 56 ms 266524 KB Output is correct
6 Correct 50 ms 266588 KB Output is correct
7 Correct 54 ms 266580 KB Output is correct
8 Correct 56 ms 266584 KB Output is correct
9 Correct 95 ms 267456 KB Output is correct
10 Correct 121 ms 268624 KB Output is correct
11 Correct 120 ms 268112 KB Output is correct
12 Correct 121 ms 267884 KB Output is correct
13 Correct 121 ms 268864 KB Output is correct
14 Correct 96 ms 268020 KB Output is correct
15 Correct 105 ms 267932 KB Output is correct
16 Correct 97 ms 267648 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 51 ms 266396 KB Output is correct
2 Correct 51 ms 266432 KB Output is correct
3 Correct 52 ms 266448 KB Output is correct
4 Correct 54 ms 266444 KB Output is correct
5 Correct 51 ms 266512 KB Output is correct
6 Correct 61 ms 266584 KB Output is correct
7 Correct 52 ms 266576 KB Output is correct
8 Correct 53 ms 266580 KB Output is correct
9 Correct 52 ms 266396 KB Output is correct
10 Correct 97 ms 267212 KB Output is correct
11 Correct 108 ms 267860 KB Output is correct
12 Correct 123 ms 268624 KB Output is correct
13 Correct 128 ms 268808 KB Output is correct
14 Correct 123 ms 268372 KB Output is correct
15 Correct 97 ms 267612 KB Output is correct
16 Correct 95 ms 267600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 51 ms 266396 KB Output is correct
2 Correct 51 ms 266432 KB Output is correct
3 Correct 52 ms 266448 KB Output is correct
4 Correct 54 ms 266444 KB Output is correct
5 Correct 51 ms 266512 KB Output is correct
6 Correct 61 ms 266584 KB Output is correct
7 Correct 52 ms 266576 KB Output is correct
8 Correct 53 ms 266580 KB Output is correct
9 Correct 52 ms 266396 KB Output is correct
10 Correct 97 ms 267212 KB Output is correct
11 Correct 108 ms 267860 KB Output is correct
12 Correct 123 ms 268624 KB Output is correct
13 Correct 128 ms 268808 KB Output is correct
14 Correct 123 ms 268372 KB Output is correct
15 Correct 97 ms 267612 KB Output is correct
16 Correct 95 ms 267600 KB Output is correct
17 Correct 110 ms 268116 KB Output is correct
18 Correct 53 ms 266576 KB Output is correct
19 Correct 51 ms 266576 KB Output is correct
20 Correct 51 ms 266384 KB Output is correct
21 Correct 51 ms 266576 KB Output is correct
22 Correct 51 ms 266576 KB Output is correct
23 Correct 55 ms 266580 KB Output is correct
24 Correct 54 ms 266432 KB Output is correct
25 Correct 54 ms 266580 KB Output is correct
26 Correct 53 ms 266580 KB Output is correct
27 Correct 105 ms 267352 KB Output is correct
28 Correct 124 ms 268628 KB Output is correct
29 Correct 127 ms 269132 KB Output is correct
30 Correct 119 ms 268372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 109 ms 266580 KB Output is correct
2 Correct 51 ms 266340 KB Output is correct
3 Correct 51 ms 266324 KB Output is correct
4 Correct 51 ms 266324 KB Output is correct
5 Correct 52 ms 266368 KB Output is correct
6 Correct 54 ms 266428 KB Output is correct
7 Correct 52 ms 266400 KB Output is correct
8 Correct 100 ms 266580 KB Output is correct
9 Correct 98 ms 266508 KB Output is correct
10 Correct 84 ms 266576 KB Output is correct
11 Correct 111 ms 266572 KB Output is correct
12 Correct 57 ms 266828 KB Output is correct
13 Correct 50 ms 266480 KB Output is correct
14 Correct 52 ms 266504 KB Output is correct
15 Correct 56 ms 266524 KB Output is correct
16 Correct 50 ms 266588 KB Output is correct
17 Correct 54 ms 266580 KB Output is correct
18 Correct 56 ms 266584 KB Output is correct
19 Correct 95 ms 267456 KB Output is correct
20 Correct 121 ms 268624 KB Output is correct
21 Correct 120 ms 268112 KB Output is correct
22 Correct 121 ms 267884 KB Output is correct
23 Correct 121 ms 268864 KB Output is correct
24 Correct 96 ms 268020 KB Output is correct
25 Correct 105 ms 267932 KB Output is correct
26 Correct 97 ms 267648 KB Output is correct
27 Correct 51 ms 266396 KB Output is correct
28 Correct 51 ms 266432 KB Output is correct
29 Correct 52 ms 266448 KB Output is correct
30 Correct 54 ms 266444 KB Output is correct
31 Correct 51 ms 266512 KB Output is correct
32 Correct 61 ms 266584 KB Output is correct
33 Correct 52 ms 266576 KB Output is correct
34 Correct 53 ms 266580 KB Output is correct
35 Correct 52 ms 266396 KB Output is correct
36 Correct 97 ms 267212 KB Output is correct
37 Correct 108 ms 267860 KB Output is correct
38 Correct 123 ms 268624 KB Output is correct
39 Correct 128 ms 268808 KB Output is correct
40 Correct 123 ms 268372 KB Output is correct
41 Correct 97 ms 267612 KB Output is correct
42 Correct 95 ms 267600 KB Output is correct
43 Correct 110 ms 268116 KB Output is correct
44 Correct 53 ms 266576 KB Output is correct
45 Correct 51 ms 266576 KB Output is correct
46 Correct 51 ms 266384 KB Output is correct
47 Correct 51 ms 266576 KB Output is correct
48 Correct 51 ms 266576 KB Output is correct
49 Correct 55 ms 266580 KB Output is correct
50 Correct 54 ms 266432 KB Output is correct
51 Correct 54 ms 266580 KB Output is correct
52 Correct 53 ms 266580 KB Output is correct
53 Correct 105 ms 267352 KB Output is correct
54 Correct 124 ms 268628 KB Output is correct
55 Correct 127 ms 269132 KB Output is correct
56 Correct 119 ms 268372 KB Output is correct
57 Correct 154 ms 269268 KB Output is correct
58 Correct 103 ms 267344 KB Output is correct
59 Correct 114 ms 268116 KB Output is correct