oj.uz

Submission #378312

# Submission time Handle Problem Language Result Execution time Memory
378312 2021-03-16T12:56:55 Z couplefire Toll (BOI17_toll) C++17
100 / 100
 181 ms 14808 KB 
#include <bits/stdc++.h>
using namespace std;
#define MAXN 50005
#define INF 1000000009

int ckmin(int &a, int b){return (b<a)?a=b:a;}
int ckmax(int &a, int b){return (b>a)?a=b:b;}

vector<pair<pair<int, int>, int>> adj[MAXN][5];
int p, n, m, q;
vector<pair<pair<int, int>, int>> queries;
int ans[MAXN];
int mxlvl;

void cdq(int l, int r, vector<pair<pair<int, int>, int>> &bruh){
    if(r < l) return;

    int mid = (l+r)/2;

    int dp[r-l+1][p][p];
    for(int i = l; i<=r; i++){
        for(int a = 0; a<p; a++) for(int b = 0; b<p; b++) dp[i-l][a][b] = INF;
    }
    for(int a = 0; a<p; a++) for(int b = 0; b<p; b++) dp[mid-l][a][b] = (a == b)?0:INF;
    for(int i = mid+1; i<=r; i++){
        for(int a = 0; a<p; a++){
            for(int b = 0; b<p; b++){
                for(auto x : adj[i-1][b]) ckmin(dp[i-l][a][x.first.second], dp[i-1-l][a][b]+x.second);
            }
        }
    }
    for(int i = mid-1; i>=l; i--){
        for(int a = 0; a<p; a++){
            for(int b = 0; b<p; b++){
                for(auto x : adj[i][a]) ckmin(dp[i-l][a][b], dp[i+1-l][x.first.second][b]+x.second);
            }
        }
    }
    vector<pair<pair<int, int>, int>> lqueries, rqueries;
    for(auto x : bruh){
        if(x.first.second/p < mid){
            lqueries.push_back(x);
            continue;
        }
        if(x.first.first/p > mid){
            rqueries.push_back(x);
            continue;
        }

        for(int y = 0; y<p; y++){
            ckmin(ans[x.second], dp[x.first.first/p-l][x.first.first%p][y]+dp[x.first.second/p-l][y][x.first.second%p]);
        }
    }
    cdq(l, mid-1, lqueries);
    cdq(mid+1, r, rqueries);
}

int main(){
    // freopen("a.in", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> p >> n >> m >> q; mxlvl = n/p;
    for(int i = 0; i<m; i++){
        int a, b, w; cin >> a >> b >> w;
        adj[a/p][a%p].push_back({{b/p, b%p}, w});
    }
    for(int i = 0; i<q; i++){
        int a, b; cin >> a >> b;
        queries.push_back({{a, b}, i});
    }
    fill(ans, ans+q, INF);
    cdq(0, mxlvl, queries);
    for(int i = 0; i<q; i++) cout << ((ans[i] == INF)?-1:ans[i]) << endl;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 8604 KB Output is correct
2 Correct 4 ms 6252 KB Output is correct
3 Correct 5 ms 6252 KB Output is correct
4 Correct 4 ms 6252 KB Output is correct
5 Correct 7 ms 6252 KB Output is correct
6 Correct 7 ms 6252 KB Output is correct
7 Correct 7 ms 6252 KB Output is correct
8 Correct 73 ms 9392 KB Output is correct
9 Correct 64 ms 9260 KB Output is correct
10 Correct 37 ms 7084 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 8876 KB Output is correct
2 Correct 4 ms 6252 KB Output is correct
3 Correct 5 ms 6252 KB Output is correct
4 Correct 5 ms 6252 KB Output is correct
5 Correct 4 ms 6252 KB Output is correct
6 Correct 5 ms 6252 KB Output is correct
7 Correct 30 ms 6672 KB Output is correct
8 Correct 29 ms 6700 KB Output is correct
9 Correct 69 ms 9392 KB Output is correct
10 Correct 126 ms 13032 KB Output is correct
11 Correct 94 ms 10640 KB Output is correct
12 Correct 85 ms 10544 KB Output is correct
13 Correct 115 ms 13548 KB Output is correct
14 Correct 67 ms 10604 KB Output is correct
15 Correct 72 ms 10220 KB Output is correct
16 Correct 72 ms 10220 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6252 KB Output is correct
2 Correct 4 ms 6252 KB Output is correct
3 Correct 4 ms 6252 KB Output is correct
4 Correct 4 ms 6252 KB Output is correct
5 Correct 5 ms 6252 KB Output is correct
6 Correct 5 ms 6252 KB Output is correct
7 Correct 6 ms 6252 KB Output is correct
8 Correct 8 ms 6380 KB Output is correct
9 Correct 7 ms 6380 KB Output is correct
10 Correct 46 ms 8940 KB Output is correct
11 Correct 68 ms 10092 KB Output is correct
12 Correct 100 ms 12524 KB Output is correct
13 Correct 107 ms 13292 KB Output is correct
14 Correct 90 ms 11628 KB Output is correct
15 Correct 79 ms 10220 KB Output is correct
16 Correct 65 ms 10092 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6252 KB Output is correct
2 Correct 4 ms 6252 KB Output is correct
3 Correct 4 ms 6252 KB Output is correct
4 Correct 4 ms 6252 KB Output is correct
5 Correct 5 ms 6252 KB Output is correct
6 Correct 5 ms 6252 KB Output is correct
7 Correct 6 ms 6252 KB Output is correct
8 Correct 8 ms 6380 KB Output is correct
9 Correct 7 ms 6380 KB Output is correct
10 Correct 46 ms 8940 KB Output is correct
11 Correct 68 ms 10092 KB Output is correct
12 Correct 100 ms 12524 KB Output is correct
13 Correct 107 ms 13292 KB Output is correct
14 Correct 90 ms 11628 KB Output is correct
15 Correct 79 ms 10220 KB Output is correct
16 Correct 65 ms 10092 KB Output is correct
17 Correct 74 ms 10208 KB Output is correct
18 Correct 4 ms 6252 KB Output is correct
19 Correct 5 ms 6252 KB Output is correct
20 Correct 5 ms 6252 KB Output is correct
21 Correct 4 ms 6252 KB Output is correct
22 Correct 5 ms 6252 KB Output is correct
23 Correct 12 ms 6380 KB Output is correct
24 Correct 12 ms 6380 KB Output is correct
25 Correct 13 ms 6508 KB Output is correct
26 Correct 13 ms 6508 KB Output is correct
27 Correct 53 ms 9196 KB Output is correct
28 Correct 124 ms 12652 KB Output is correct
29 Correct 114 ms 13292 KB Output is correct
30 Correct 95 ms 11756 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 8604 KB Output is correct
2 Correct 4 ms 6252 KB Output is correct
3 Correct 5 ms 6252 KB Output is correct
4 Correct 4 ms 6252 KB Output is correct
5 Correct 7 ms 6252 KB Output is correct
6 Correct 7 ms 6252 KB Output is correct
7 Correct 7 ms 6252 KB Output is correct
8 Correct 73 ms 9392 KB Output is correct
9 Correct 64 ms 9260 KB Output is correct
10 Correct 37 ms 7084 KB Output is correct
11 Correct 89 ms 8876 KB Output is correct
12 Correct 4 ms 6252 KB Output is correct
13 Correct 5 ms 6252 KB Output is correct
14 Correct 5 ms 6252 KB Output is correct
15 Correct 4 ms 6252 KB Output is correct
16 Correct 5 ms 6252 KB Output is correct
17 Correct 30 ms 6672 KB Output is correct
18 Correct 29 ms 6700 KB Output is correct
19 Correct 69 ms 9392 KB Output is correct
20 Correct 126 ms 13032 KB Output is correct
21 Correct 94 ms 10640 KB Output is correct
22 Correct 85 ms 10544 KB Output is correct
23 Correct 115 ms 13548 KB Output is correct
24 Correct 67 ms 10604 KB Output is correct
25 Correct 72 ms 10220 KB Output is correct
26 Correct 72 ms 10220 KB Output is correct
27 Correct 4 ms 6252 KB Output is correct
28 Correct 4 ms 6252 KB Output is correct
29 Correct 4 ms 6252 KB Output is correct
30 Correct 4 ms 6252 KB Output is correct
31 Correct 5 ms 6252 KB Output is correct
32 Correct 5 ms 6252 KB Output is correct
33 Correct 6 ms 6252 KB Output is correct
34 Correct 8 ms 6380 KB Output is correct
35 Correct 7 ms 6380 KB Output is correct
36 Correct 46 ms 8940 KB Output is correct
37 Correct 68 ms 10092 KB Output is correct
38 Correct 100 ms 12524 KB Output is correct
39 Correct 107 ms 13292 KB Output is correct
40 Correct 90 ms 11628 KB Output is correct
41 Correct 79 ms 10220 KB Output is correct
42 Correct 65 ms 10092 KB Output is correct
43 Correct 74 ms 10208 KB Output is correct
44 Correct 4 ms 6252 KB Output is correct
45 Correct 5 ms 6252 KB Output is correct
46 Correct 5 ms 6252 KB Output is correct
47 Correct 4 ms 6252 KB Output is correct
48 Correct 5 ms 6252 KB Output is correct
49 Correct 12 ms 6380 KB Output is correct
50 Correct 12 ms 6380 KB Output is correct
51 Correct 13 ms 6508 KB Output is correct
52 Correct 13 ms 6508 KB Output is correct
53 Correct 53 ms 9196 KB Output is correct
54 Correct 124 ms 12652 KB Output is correct
55 Correct 114 ms 13292 KB Output is correct
56 Correct 95 ms 11756 KB Output is correct
57 Correct 181 ms 14808 KB Output is correct
58 Correct 69 ms 9392 KB Output is correct
59 Correct 92 ms 10640 KB Output is correct