oj.uz

Submission #716006

# Submission time Handle Problem Language Result Execution time Memory
716006 2023-03-28T18:30:43 Z sandry24 Toll (BOI17_toll) C++17
100 / 100
 129 ms 83532 KB 
#include <bits/stdc++.h>
using namespace std;
 
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second

int k, n, m, o;
int ans[5][5], temp[5][5], dp[50000][17][5][5];
 
void combine(int t[5][5], int a[5][5], int b[5][5]){
    for(int i = 0; i < k; i++){
        for(int j = 0; j < k; j++){
            for(int l = 0; l < k; l++){
                t[i][j] = min(t[i][j], a[i][l] + b[l][j]);
            }
        }
    }
}
 
void solve(){
    cin >> k >> n >> m >> o;
    int INF = 1e9+7;
    memset(dp, 0x3f, sizeof dp);
    for(int i = 0; i < m; i++){
        int a, b, w;
        cin >> a >> b >> w;
        dp[a/k][0][a % k][b % k] = w;
    }
    //dp[i][y][j][l] cel mai scurt drum de la k*i + j de la k*(i + 2^y - 1) + l;
    //dp[i][y][j][l] = dp[i][y-1][j][temp] + dp[i + 2^(y-1)[y-1][temp][l];
    for(int y = 1; y < 17; y++){
        for(int i = 0; i + (1 << y) < (n + k - 1) / k; i++){
            combine(dp[i][y], dp[i][y-1], dp[i + (1 << (y-1))][y-1]);
        }
    }
    for(int u = 0; u < o; u++){
        int a, b;
        cin >> a >> b;
        memset(ans, 0x3f, sizeof ans);
        for (int i = 0; i < 5; i++) 
            ans[i][i] = 0;
        ll ord1 = a/k, ord2 = b/k, mod1 = a % k, mod2 = b % k;
        for (int i = 16; i >= 0; i--) {
            if (ord1 + (1 << i) <= ord2) {
                memset(temp, 0x3f, sizeof temp);
                combine(temp, ans, dp[ord1][i]);
                memcpy(ans, temp, sizeof ans);
                ord1 += (1 << i);
            }
        }
        if(ans[mod1][mod2] == 0x3f3f3f3f)
            cout << -1 << '\n';
        else
            cout << ans[mod1][mod2] << '\n';
    }
}    

int main(){
    //freopen("infasuratoare.in", "r", stdin);
    //freopen("infasuratoare.out", "w", stdout);
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

Compilation message

toll.cpp: In function 'void solve()':
toll.cpp:29:9: warning: unused variable 'INF' [-Wunused-variable]
   29 |     int INF = 1e9+7;
      |         ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 83532 KB Output is correct
2 Correct 38 ms 83400 KB Output is correct
3 Correct 33 ms 83464 KB Output is correct
4 Correct 35 ms 83368 KB Output is correct
5 Correct 32 ms 83412 KB Output is correct
6 Correct 33 ms 83404 KB Output is correct
7 Correct 33 ms 83392 KB Output is correct
8 Correct 75 ms 83472 KB Output is correct
9 Correct 82 ms 83472 KB Output is correct
10 Correct 61 ms 83420 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 83484 KB Output is correct
2 Correct 31 ms 83376 KB Output is correct
3 Correct 30 ms 83348 KB Output is correct
4 Correct 33 ms 83440 KB Output is correct
5 Correct 38 ms 83388 KB Output is correct
6 Correct 33 ms 83480 KB Output is correct
7 Correct 35 ms 83472 KB Output is correct
8 Correct 35 ms 83424 KB Output is correct
9 Correct 64 ms 83408 KB Output is correct
10 Correct 95 ms 83480 KB Output is correct
11 Correct 105 ms 83468 KB Output is correct
12 Correct 86 ms 83476 KB Output is correct
13 Correct 80 ms 83392 KB Output is correct
14 Correct 67 ms 83472 KB Output is correct
15 Correct 63 ms 83412 KB Output is correct
16 Correct 76 ms 83488 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 83404 KB Output is correct
2 Correct 33 ms 83476 KB Output is correct
3 Correct 32 ms 83428 KB Output is correct
4 Correct 31 ms 83420 KB Output is correct
5 Correct 31 ms 83480 KB Output is correct
6 Correct 33 ms 83356 KB Output is correct
7 Correct 34 ms 83416 KB Output is correct
8 Correct 44 ms 83352 KB Output is correct
9 Correct 36 ms 83412 KB Output is correct
10 Correct 68 ms 83356 KB Output is correct
11 Correct 78 ms 83412 KB Output is correct
12 Correct 91 ms 83472 KB Output is correct
13 Correct 103 ms 83456 KB Output is correct
14 Correct 89 ms 83344 KB Output is correct
15 Correct 63 ms 83468 KB Output is correct
16 Correct 60 ms 83432 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 83404 KB Output is correct
2 Correct 33 ms 83476 KB Output is correct
3 Correct 32 ms 83428 KB Output is correct
4 Correct 31 ms 83420 KB Output is correct
5 Correct 31 ms 83480 KB Output is correct
6 Correct 33 ms 83356 KB Output is correct
7 Correct 34 ms 83416 KB Output is correct
8 Correct 44 ms 83352 KB Output is correct
9 Correct 36 ms 83412 KB Output is correct
10 Correct 68 ms 83356 KB Output is correct
11 Correct 78 ms 83412 KB Output is correct
12 Correct 91 ms 83472 KB Output is correct
13 Correct 103 ms 83456 KB Output is correct
14 Correct 89 ms 83344 KB Output is correct
15 Correct 63 ms 83468 KB Output is correct
16 Correct 60 ms 83432 KB Output is correct
17 Correct 104 ms 83412 KB Output is correct
18 Correct 41 ms 83400 KB Output is correct
19 Correct 34 ms 83356 KB Output is correct
20 Correct 37 ms 83420 KB Output is correct
21 Correct 33 ms 83444 KB Output is correct
22 Correct 40 ms 83396 KB Output is correct
23 Correct 39 ms 83436 KB Output is correct
24 Correct 41 ms 83464 KB Output is correct
25 Correct 35 ms 83412 KB Output is correct
26 Correct 41 ms 83428 KB Output is correct
27 Correct 66 ms 83396 KB Output is correct
28 Correct 102 ms 83404 KB Output is correct
29 Correct 122 ms 83468 KB Output is correct
30 Correct 98 ms 83468 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 83532 KB Output is correct
2 Correct 38 ms 83400 KB Output is correct
3 Correct 33 ms 83464 KB Output is correct
4 Correct 35 ms 83368 KB Output is correct
5 Correct 32 ms 83412 KB Output is correct
6 Correct 33 ms 83404 KB Output is correct
7 Correct 33 ms 83392 KB Output is correct
8 Correct 75 ms 83472 KB Output is correct
9 Correct 82 ms 83472 KB Output is correct
10 Correct 61 ms 83420 KB Output is correct
11 Correct 83 ms 83484 KB Output is correct
12 Correct 31 ms 83376 KB Output is correct
13 Correct 30 ms 83348 KB Output is correct
14 Correct 33 ms 83440 KB Output is correct
15 Correct 38 ms 83388 KB Output is correct
16 Correct 33 ms 83480 KB Output is correct
17 Correct 35 ms 83472 KB Output is correct
18 Correct 35 ms 83424 KB Output is correct
19 Correct 64 ms 83408 KB Output is correct
20 Correct 95 ms 83480 KB Output is correct
21 Correct 105 ms 83468 KB Output is correct
22 Correct 86 ms 83476 KB Output is correct
23 Correct 80 ms 83392 KB Output is correct
24 Correct 67 ms 83472 KB Output is correct
25 Correct 63 ms 83412 KB Output is correct
26 Correct 76 ms 83488 KB Output is correct
27 Correct 34 ms 83404 KB Output is correct
28 Correct 33 ms 83476 KB Output is correct
29 Correct 32 ms 83428 KB Output is correct
30 Correct 31 ms 83420 KB Output is correct
31 Correct 31 ms 83480 KB Output is correct
32 Correct 33 ms 83356 KB Output is correct
33 Correct 34 ms 83416 KB Output is correct
34 Correct 44 ms 83352 KB Output is correct
35 Correct 36 ms 83412 KB Output is correct
36 Correct 68 ms 83356 KB Output is correct
37 Correct 78 ms 83412 KB Output is correct
38 Correct 91 ms 83472 KB Output is correct
39 Correct 103 ms 83456 KB Output is correct
40 Correct 89 ms 83344 KB Output is correct
41 Correct 63 ms 83468 KB Output is correct
42 Correct 60 ms 83432 KB Output is correct
43 Correct 104 ms 83412 KB Output is correct
44 Correct 41 ms 83400 KB Output is correct
45 Correct 34 ms 83356 KB Output is correct
46 Correct 37 ms 83420 KB Output is correct
47 Correct 33 ms 83444 KB Output is correct
48 Correct 40 ms 83396 KB Output is correct
49 Correct 39 ms 83436 KB Output is correct
50 Correct 41 ms 83464 KB Output is correct
51 Correct 35 ms 83412 KB Output is correct
52 Correct 41 ms 83428 KB Output is correct
53 Correct 66 ms 83396 KB Output is correct
54 Correct 102 ms 83404 KB Output is correct
55 Correct 122 ms 83468 KB Output is correct
56 Correct 98 ms 83468 KB Output is correct
57 Correct 129 ms 83472 KB Output is correct
58 Correct 73 ms 83440 KB Output is correct
59 Correct 111 ms 83468 KB Output is correct