답안 #716003

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
716003 2023-03-28T18:26:55 Z sandry24 Toll (BOI17_toll) C++17
100 / 100
158 ms 85296 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;

    memset(dp, 0x3f, sizeof dp);

    while (m--) {

        int a, b, t;

        cin >> a >> b >> t;

        dp[a / k][0][a % k][b % k] = t;

    }

    for (int j = 1; j < 17; j++) {

        for (int i = 0; i + (1 << j) < (n + k - 1) / k; i++) {

            combine(dp[i][j], dp[i][j - 1], dp[i + (1 << j - 1)][j - 1]);

        }

    }


    while (o--) {

        int a, b;

        cin >> a >> b;

        memset(ans, 0x3f, sizeof ans);

        for (int i = 0; i < 5; i++) ans[i][i] = 0;

        for (int curr = a / k, dest = b / k, i = 16; ~i; i--) {

            if (curr + (1 << i) <= dest) {

                memset(temp, 0x3f, sizeof temp);

                combine(temp, ans, dp[curr][i]);

                memcpy(ans, temp, sizeof ans);

                curr += (1 << i);

            }

        }

        cout << (ans[a % k][b % k] == 0x3f3f3f3f ? -1 : ans[a % k][b % k])

             << '\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:46:60: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   46 |             combine(dp[i][j], dp[i][j - 1], dp[i + (1 << j - 1)][j - 1]);
      |                                                          ~~^~~
# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 83444 KB Output is correct
2 Correct 33 ms 83404 KB Output is correct
3 Correct 35 ms 83388 KB Output is correct
4 Correct 34 ms 83404 KB Output is correct
5 Correct 34 ms 83404 KB Output is correct
6 Correct 32 ms 83400 KB Output is correct
7 Correct 31 ms 83412 KB Output is correct
8 Correct 70 ms 84356 KB Output is correct
9 Correct 65 ms 84260 KB Output is correct
10 Correct 61 ms 83568 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 83492 KB Output is correct
2 Correct 30 ms 83436 KB Output is correct
3 Correct 30 ms 83408 KB Output is correct
4 Correct 32 ms 83412 KB Output is correct
5 Correct 32 ms 83436 KB Output is correct
6 Correct 31 ms 83456 KB Output is correct
7 Correct 42 ms 83472 KB Output is correct
8 Correct 37 ms 83508 KB Output is correct
9 Correct 66 ms 83468 KB Output is correct
10 Correct 102 ms 84864 KB Output is correct
11 Correct 84 ms 84860 KB Output is correct
12 Correct 98 ms 84748 KB Output is correct
13 Correct 107 ms 84904 KB Output is correct
14 Correct 65 ms 84836 KB Output is correct
15 Correct 68 ms 84648 KB Output is correct
16 Correct 84 ms 84668 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 83360 KB Output is correct
2 Correct 37 ms 83348 KB Output is correct
3 Correct 33 ms 83412 KB Output is correct
4 Correct 32 ms 83404 KB Output is correct
5 Correct 32 ms 83456 KB Output is correct
6 Correct 33 ms 83372 KB Output is correct
7 Correct 35 ms 83448 KB Output is correct
8 Correct 35 ms 83404 KB Output is correct
9 Correct 35 ms 83384 KB Output is correct
10 Correct 83 ms 83468 KB Output is correct
11 Correct 94 ms 84748 KB Output is correct
12 Correct 94 ms 84812 KB Output is correct
13 Correct 101 ms 84872 KB Output is correct
14 Correct 92 ms 84864 KB Output is correct
15 Correct 70 ms 84608 KB Output is correct
16 Correct 69 ms 84640 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 83360 KB Output is correct
2 Correct 37 ms 83348 KB Output is correct
3 Correct 33 ms 83412 KB Output is correct
4 Correct 32 ms 83404 KB Output is correct
5 Correct 32 ms 83456 KB Output is correct
6 Correct 33 ms 83372 KB Output is correct
7 Correct 35 ms 83448 KB Output is correct
8 Correct 35 ms 83404 KB Output is correct
9 Correct 35 ms 83384 KB Output is correct
10 Correct 83 ms 83468 KB Output is correct
11 Correct 94 ms 84748 KB Output is correct
12 Correct 94 ms 84812 KB Output is correct
13 Correct 101 ms 84872 KB Output is correct
14 Correct 92 ms 84864 KB Output is correct
15 Correct 70 ms 84608 KB Output is correct
16 Correct 69 ms 84640 KB Output is correct
17 Correct 92 ms 84832 KB Output is correct
18 Correct 32 ms 83404 KB Output is correct
19 Correct 38 ms 83460 KB Output is correct
20 Correct 32 ms 83400 KB Output is correct
21 Correct 34 ms 83404 KB Output is correct
22 Correct 33 ms 83468 KB Output is correct
23 Correct 44 ms 83456 KB Output is correct
24 Correct 43 ms 83532 KB Output is correct
25 Correct 35 ms 83548 KB Output is correct
26 Correct 35 ms 83528 KB Output is correct
27 Correct 68 ms 84312 KB Output is correct
28 Correct 110 ms 84808 KB Output is correct
29 Correct 127 ms 84908 KB Output is correct
30 Correct 109 ms 84868 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 83444 KB Output is correct
2 Correct 33 ms 83404 KB Output is correct
3 Correct 35 ms 83388 KB Output is correct
4 Correct 34 ms 83404 KB Output is correct
5 Correct 34 ms 83404 KB Output is correct
6 Correct 32 ms 83400 KB Output is correct
7 Correct 31 ms 83412 KB Output is correct
8 Correct 70 ms 84356 KB Output is correct
9 Correct 65 ms 84260 KB Output is correct
10 Correct 61 ms 83568 KB Output is correct
11 Correct 79 ms 83492 KB Output is correct
12 Correct 30 ms 83436 KB Output is correct
13 Correct 30 ms 83408 KB Output is correct
14 Correct 32 ms 83412 KB Output is correct
15 Correct 32 ms 83436 KB Output is correct
16 Correct 31 ms 83456 KB Output is correct
17 Correct 42 ms 83472 KB Output is correct
18 Correct 37 ms 83508 KB Output is correct
19 Correct 66 ms 83468 KB Output is correct
20 Correct 102 ms 84864 KB Output is correct
21 Correct 84 ms 84860 KB Output is correct
22 Correct 98 ms 84748 KB Output is correct
23 Correct 107 ms 84904 KB Output is correct
24 Correct 65 ms 84836 KB Output is correct
25 Correct 68 ms 84648 KB Output is correct
26 Correct 84 ms 84668 KB Output is correct
27 Correct 36 ms 83360 KB Output is correct
28 Correct 37 ms 83348 KB Output is correct
29 Correct 33 ms 83412 KB Output is correct
30 Correct 32 ms 83404 KB Output is correct
31 Correct 32 ms 83456 KB Output is correct
32 Correct 33 ms 83372 KB Output is correct
33 Correct 35 ms 83448 KB Output is correct
34 Correct 35 ms 83404 KB Output is correct
35 Correct 35 ms 83384 KB Output is correct
36 Correct 83 ms 83468 KB Output is correct
37 Correct 94 ms 84748 KB Output is correct
38 Correct 94 ms 84812 KB Output is correct
39 Correct 101 ms 84872 KB Output is correct
40 Correct 92 ms 84864 KB Output is correct
41 Correct 70 ms 84608 KB Output is correct
42 Correct 69 ms 84640 KB Output is correct
43 Correct 92 ms 84832 KB Output is correct
44 Correct 32 ms 83404 KB Output is correct
45 Correct 38 ms 83460 KB Output is correct
46 Correct 32 ms 83400 KB Output is correct
47 Correct 34 ms 83404 KB Output is correct
48 Correct 33 ms 83468 KB Output is correct
49 Correct 44 ms 83456 KB Output is correct
50 Correct 43 ms 83532 KB Output is correct
51 Correct 35 ms 83548 KB Output is correct
52 Correct 35 ms 83528 KB Output is correct
53 Correct 68 ms 84312 KB Output is correct
54 Correct 110 ms 84808 KB Output is correct
55 Correct 127 ms 84908 KB Output is correct
56 Correct 109 ms 84868 KB Output is correct
57 Correct 158 ms 85296 KB Output is correct
58 Correct 81 ms 84304 KB Output is correct
59 Correct 103 ms 84880 KB Output is correct