oj.uz

Submission #629592

# Submission time Handle Problem Language Result Execution time Memory
629592 2022-08-14T17:17:07 Z Duy_e Toll (BOI17_toll) C++14
100 / 100
 1479 ms 14596 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<ll, ll>
#define st first
#define nd second
#define file "test"
using namespace std;
const long long INF = 1e18;
const long long N = 5e4 + 5;
const long long block = 200;

#define data array<array<ll, 5>, 5>

int n, m, k, q, id[N];

vector <pii> d[N];

struct seg {
    data f;
    int l, r;

    void set(ll val) {
        for (int u = 0; u < 5; u ++) for (int v = 0; v < 5; v ++) f[u][v] = val;
    }  

    void init(int i) {
        set(INF);
        for (int j = 0; j < 5; j ++) f[j][j] = 0;
        l = r = i;
    }

};

seg combine(seg a, seg b) {
    seg ans;
    ans.l = a.l; ans.r = b.r;
    ans.set(INF);
    for (int u = 0; u < k; u ++) for (int v = 0; v < k; v ++) {
        int cur = a.r * k + v;
        for (pii nxt: d[cur]) {
            ll w = nxt.nd, node = nxt.st % k;
            for (int x = 0; x < k; x ++) {
                ans.f[u][x] = min(ans.f[u][x], a.f[u][v] + b.f[node][x] + w);
            }
        }
    }

    return ans;
}

seg sec[N], ind[N];
int L[N], R[N];

ll query(int u, int v) {
    int l = u / k, r = v / k;
    if (l >= r) return -1;

    seg ans = ind[l];


    int idL = l / block, idR = r / block;
    if (idL == idR) {
        for (int i = l + 1; i <= r; i ++)
            ans = combine(ans, ind[i]);

        return ans.f[u % k][v % k];
    }

    for (int i = l + 1; i <= R[idL]; i ++) 
        ans = combine(ans, ind[i]);
    for (int i = idL + 1; i < idR; i ++)
        ans = combine(ans, sec[i]);
    for (int i = L[idR]; i <= r; i ++)
        ans = combine(ans, ind[i]);
    
    return ans.f[u % k][v % k];
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen(file".inp", "r", stdin); freopen(file".out", "w", stdout);
    // #endif
    
    cin >> k >> n >> m >> q;

    for (int i = 1, u, v, t; i <= m; i ++) {
        cin >> u >> v >> t;
        d[u].push_back({v, t});
    }

    memset(L, -1, sizeof L);
    memset(R, -1, sizeof R);

    for (int i = 0; i <= n / k; i ++) {
        ind[i].init(i);
        R[i / block] = i;
        if (L[i / block] == -1) L[i / block] = i;
    }

    int m = n / k;
    for (int i = 0; i <= m / block; i ++) 
        sec[i] = ind[L[i]];
    
    for (int i = 0; i <= m; i ++) {
        if (i != L[i / block]) 
            sec[i / block] = combine(sec[i / block], ind[i]);
    }

    int u, v;

    auto fix = [&] (ll x) {
        if (x >= 1e15) return -1ll;
        return x;
    };
 
    while (q --) {
        cin >> u >> v;
        cout << fix(query(u, v)) << '\n';
    }

    return 0;
}    
/**  /\_/\
*   (= ._.)
*   / >🍵 \>🍮
**/

Compilation message

toll.cpp:125:9: warning: "/*" within comment [-Wcomment]
  125 | /**  /\_/\
      |

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 13844 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 12 ms 2132 KB Output is correct
6 Correct 13 ms 2136 KB Output is correct
7 Correct 14 ms 2132 KB Output is correct
8 Correct 238 ms 14060 KB Output is correct
9 Correct 234 ms 13724 KB Output is correct
10 Correct 134 ms 12116 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 9744 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 2 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 160 ms 2212 KB Output is correct
8 Correct 210 ms 2364 KB Output is correct
9 Correct 286 ms 14548 KB Output is correct
10 Correct 888 ms 11676 KB Output is correct
11 Correct 471 ms 11372 KB Output is correct
12 Correct 566 ms 8628 KB Output is correct
13 Correct 1142 ms 10248 KB Output is correct
14 Correct 320 ms 8008 KB Output is correct
15 Correct 714 ms 6468 KB Output is correct
16 Correct 707 ms 6348 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 3 ms 1876 KB Output is correct
4 Correct 2 ms 1876 KB Output is correct
5 Correct 2 ms 1876 KB Output is correct
6 Correct 3 ms 2132 KB Output is correct
7 Correct 3 ms 2004 KB Output is correct
8 Correct 10 ms 2132 KB Output is correct
9 Correct 7 ms 2080 KB Output is correct
10 Correct 28 ms 14408 KB Output is correct
11 Correct 45 ms 10964 KB Output is correct
12 Correct 57 ms 11436 KB Output is correct
13 Correct 64 ms 12072 KB Output is correct
14 Correct 56 ms 10168 KB Output is correct
15 Correct 57 ms 6304 KB Output is correct
16 Correct 45 ms 6180 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 3 ms 1876 KB Output is correct
4 Correct 2 ms 1876 KB Output is correct
5 Correct 2 ms 1876 KB Output is correct
6 Correct 3 ms 2132 KB Output is correct
7 Correct 3 ms 2004 KB Output is correct
8 Correct 10 ms 2132 KB Output is correct
9 Correct 7 ms 2080 KB Output is correct
10 Correct 28 ms 14408 KB Output is correct
11 Correct 45 ms 10964 KB Output is correct
12 Correct 57 ms 11436 KB Output is correct
13 Correct 64 ms 12072 KB Output is correct
14 Correct 56 ms 10168 KB Output is correct
15 Correct 57 ms 6304 KB Output is correct
16 Correct 45 ms 6180 KB Output is correct
17 Correct 131 ms 11080 KB Output is correct
18 Correct 1 ms 1876 KB Output is correct
19 Correct 1 ms 1876 KB Output is correct
20 Correct 1 ms 1876 KB Output is correct
21 Correct 1 ms 1876 KB Output is correct
22 Correct 1 ms 1888 KB Output is correct
23 Correct 31 ms 2172 KB Output is correct
24 Correct 42 ms 2108 KB Output is correct
25 Correct 191 ms 2124 KB Output is correct
26 Correct 116 ms 2112 KB Output is correct
27 Correct 87 ms 14512 KB Output is correct
28 Correct 229 ms 11444 KB Output is correct
29 Correct 273 ms 12180 KB Output is correct
30 Correct 200 ms 10312 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 13844 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 12 ms 2132 KB Output is correct
6 Correct 13 ms 2136 KB Output is correct
7 Correct 14 ms 2132 KB Output is correct
8 Correct 238 ms 14060 KB Output is correct
9 Correct 234 ms 13724 KB Output is correct
10 Correct 134 ms 12116 KB Output is correct
11 Correct 446 ms 9744 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 1 ms 1876 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 1 ms 1876 KB Output is correct
16 Correct 1 ms 1876 KB Output is correct
17 Correct 160 ms 2212 KB Output is correct
18 Correct 210 ms 2364 KB Output is correct
19 Correct 286 ms 14548 KB Output is correct
20 Correct 888 ms 11676 KB Output is correct
21 Correct 471 ms 11372 KB Output is correct
22 Correct 566 ms 8628 KB Output is correct
23 Correct 1142 ms 10248 KB Output is correct
24 Correct 320 ms 8008 KB Output is correct
25 Correct 714 ms 6468 KB Output is correct
26 Correct 707 ms 6348 KB Output is correct
27 Correct 1 ms 1876 KB Output is correct
28 Correct 1 ms 1876 KB Output is correct
29 Correct 3 ms 1876 KB Output is correct
30 Correct 2 ms 1876 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 3 ms 2132 KB Output is correct
33 Correct 3 ms 2004 KB Output is correct
34 Correct 10 ms 2132 KB Output is correct
35 Correct 7 ms 2080 KB Output is correct
36 Correct 28 ms 14408 KB Output is correct
37 Correct 45 ms 10964 KB Output is correct
38 Correct 57 ms 11436 KB Output is correct
39 Correct 64 ms 12072 KB Output is correct
40 Correct 56 ms 10168 KB Output is correct
41 Correct 57 ms 6304 KB Output is correct
42 Correct 45 ms 6180 KB Output is correct
43 Correct 131 ms 11080 KB Output is correct
44 Correct 1 ms 1876 KB Output is correct
45 Correct 1 ms 1876 KB Output is correct
46 Correct 1 ms 1876 KB Output is correct
47 Correct 1 ms 1876 KB Output is correct
48 Correct 1 ms 1888 KB Output is correct
49 Correct 31 ms 2172 KB Output is correct
50 Correct 42 ms 2108 KB Output is correct
51 Correct 191 ms 2124 KB Output is correct
52 Correct 116 ms 2112 KB Output is correct
53 Correct 87 ms 14512 KB Output is correct
54 Correct 229 ms 11444 KB Output is correct
55 Correct 273 ms 12180 KB Output is correct
56 Correct 200 ms 10312 KB Output is correct
57 Correct 1479 ms 12316 KB Output is correct
58 Correct 255 ms 14596 KB Output is correct
59 Correct 321 ms 11408 KB Output is correct