oj.uz

Submission #1093569

# Submission time Handle Problem Language Result Execution time Memory
1093569 2024-09-27T03:56:40 Z Thanhs Toll (BOI17_toll) C++14
100 / 100
 88 ms 82004 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
// #define int long long
#define endl '\n'
#define setmin(x, y) x = ((x) < (y) ? (x) : (y))
#define setmax(x, y) x = ((x) > (y) ? (x) : (y))

mt19937 hdp(chrono::high_resolution_clock::now().time_since_epoch().count());
int rand(int l, int r){return l + ((hdp() % (r - l + 1)) + r - l + 1) % (r - l + 1);}

const int NM = 5e4 + 5;
const int LG = 16;
const int inf = 1e9;

int n, m, q, k;

struct node
{
    int dt[5][5];
    node() {for (int i = 0; i < 5; i++) for (int j = 0; j < 5; j++) dt[i][j] = inf;}
    node operator*(const node& o)
    {
        node res;
        for (int i = 0; i < k; i++)
            for (int j = 0; j < k; j++)
                for (int t = 0; t < k; t++)
                    setmin(res.dt[i][j], dt[i][t] + o.dt[t][j]);
        return res;
    }
}st[NM][LG];

void solve()    
{
    cin >> k >> n >> m >> q;
    for (int i = 1; i <= m; i++)
    {
        int u, v, w;
        cin >> u >> v >> w;
        setmin(st[u / k][0].dt[u % k][v % k], w);
    }
    for (int lg = 1; lg <= __lg(n / k + 1); lg++)
        for (int i = 0; i + (1 << lg) - 1 < n / k; i++)
            st[i][lg] = st[i][lg - 1] * st[i + (1 << lg - 1)][lg - 1];
    while (q--)
    {
        int u, v;
        cin >> u >> v;
        if (u == v)
            cout << 0 << endl;
        else if (u / k < v / k)
        {
            int x = v / k - u / k;
            node res = st[u / k][__lg(x)];
            int t = x - (1 << __lg(x)), cur = u / k + (1 << __lg(x));
            for (int i = t ? __lg(t) : -1; i >= 0; i--)
                if (t & (1 << i))
                {
                    res = res * st[cur][i];
                    cur += 1 << i;
                }
            cout << (res.dt[u % k][v % k] == inf ? -1 : res.dt[u % k][v % k]) << endl;
        }
        else
            cout << -1 << endl;
    }
}

signed main()
{
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    if (fopen("in.txt", "r")) 
    {
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    }
    // freopen("storagebox.inp", "r", stdin);
    // freopen("storagebox.out", "w", stdout);
    int tc = 1; 
    // cin >> tc;
    while (tc--)
        solve();
}

Compilation message

toll.cpp: In function 'void solve()':
toll.cpp:46:57: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   46 |             st[i][lg] = st[i][lg - 1] * st[i + (1 << lg - 1)][lg - 1];
      |                                                      ~~~^~~
toll.cpp: In function 'int main()':
toll.cpp:76:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |         freopen("in.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
toll.cpp:77:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |         freopen("out.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 78744 KB Output is correct
2 Correct 32 ms 78572 KB Output is correct
3 Correct 32 ms 78684 KB Output is correct
4 Correct 34 ms 78684 KB Output is correct
5 Correct 34 ms 78676 KB Output is correct
6 Correct 34 ms 78672 KB Output is correct
7 Correct 35 ms 78676 KB Output is correct
8 Correct 66 ms 79440 KB Output is correct
9 Correct 65 ms 79600 KB Output is correct
10 Correct 51 ms 78680 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 78680 KB Output is correct
2 Correct 35 ms 78584 KB Output is correct
3 Correct 34 ms 78684 KB Output is correct
4 Correct 42 ms 78676 KB Output is correct
5 Correct 33 ms 78676 KB Output is correct
6 Correct 33 ms 78684 KB Output is correct
7 Correct 41 ms 78676 KB Output is correct
8 Correct 39 ms 78668 KB Output is correct
9 Correct 78 ms 79492 KB Output is correct
10 Correct 74 ms 80888 KB Output is correct
11 Correct 65 ms 80468 KB Output is correct
12 Correct 61 ms 79928 KB Output is correct
13 Correct 71 ms 80980 KB Output is correct
14 Correct 63 ms 79956 KB Output is correct
15 Correct 57 ms 79788 KB Output is correct
16 Correct 57 ms 79732 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 78684 KB Output is correct
2 Correct 34 ms 78676 KB Output is correct
3 Correct 32 ms 78620 KB Output is correct
4 Correct 34 ms 78676 KB Output is correct
5 Correct 33 ms 78684 KB Output is correct
6 Correct 34 ms 78540 KB Output is correct
7 Correct 34 ms 78680 KB Output is correct
8 Correct 34 ms 78672 KB Output is correct
9 Correct 35 ms 78684 KB Output is correct
10 Correct 63 ms 79352 KB Output is correct
11 Correct 59 ms 80212 KB Output is correct
12 Correct 66 ms 80720 KB Output is correct
13 Correct 70 ms 80976 KB Output is correct
14 Correct 70 ms 80464 KB Output is correct
15 Correct 62 ms 79908 KB Output is correct
16 Correct 63 ms 79700 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 78684 KB Output is correct
2 Correct 34 ms 78676 KB Output is correct
3 Correct 32 ms 78620 KB Output is correct
4 Correct 34 ms 78676 KB Output is correct
5 Correct 33 ms 78684 KB Output is correct
6 Correct 34 ms 78540 KB Output is correct
7 Correct 34 ms 78680 KB Output is correct
8 Correct 34 ms 78672 KB Output is correct
9 Correct 35 ms 78684 KB Output is correct
10 Correct 63 ms 79352 KB Output is correct
11 Correct 59 ms 80212 KB Output is correct
12 Correct 66 ms 80720 KB Output is correct
13 Correct 70 ms 80976 KB Output is correct
14 Correct 70 ms 80464 KB Output is correct
15 Correct 62 ms 79908 KB Output is correct
16 Correct 63 ms 79700 KB Output is correct
17 Correct 64 ms 80076 KB Output is correct
18 Correct 34 ms 78684 KB Output is correct
19 Correct 33 ms 78684 KB Output is correct
20 Correct 35 ms 78592 KB Output is correct
21 Correct 36 ms 78680 KB Output is correct
22 Correct 33 ms 78684 KB Output is correct
23 Correct 34 ms 78684 KB Output is correct
24 Correct 34 ms 78800 KB Output is correct
25 Correct 35 ms 78608 KB Output is correct
26 Correct 36 ms 78768 KB Output is correct
27 Correct 71 ms 79444 KB Output is correct
28 Correct 71 ms 80720 KB Output is correct
29 Correct 80 ms 81116 KB Output is correct
30 Correct 67 ms 80464 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 78744 KB Output is correct
2 Correct 32 ms 78572 KB Output is correct
3 Correct 32 ms 78684 KB Output is correct
4 Correct 34 ms 78684 KB Output is correct
5 Correct 34 ms 78676 KB Output is correct
6 Correct 34 ms 78672 KB Output is correct
7 Correct 35 ms 78676 KB Output is correct
8 Correct 66 ms 79440 KB Output is correct
9 Correct 65 ms 79600 KB Output is correct
10 Correct 51 ms 78680 KB Output is correct
11 Correct 69 ms 78680 KB Output is correct
12 Correct 35 ms 78584 KB Output is correct
13 Correct 34 ms 78684 KB Output is correct
14 Correct 42 ms 78676 KB Output is correct
15 Correct 33 ms 78676 KB Output is correct
16 Correct 33 ms 78684 KB Output is correct
17 Correct 41 ms 78676 KB Output is correct
18 Correct 39 ms 78668 KB Output is correct
19 Correct 78 ms 79492 KB Output is correct
20 Correct 74 ms 80888 KB Output is correct
21 Correct 65 ms 80468 KB Output is correct
22 Correct 61 ms 79928 KB Output is correct
23 Correct 71 ms 80980 KB Output is correct
24 Correct 63 ms 79956 KB Output is correct
25 Correct 57 ms 79788 KB Output is correct
26 Correct 57 ms 79732 KB Output is correct
27 Correct 33 ms 78684 KB Output is correct
28 Correct 34 ms 78676 KB Output is correct
29 Correct 32 ms 78620 KB Output is correct
30 Correct 34 ms 78676 KB Output is correct
31 Correct 33 ms 78684 KB Output is correct
32 Correct 34 ms 78540 KB Output is correct
33 Correct 34 ms 78680 KB Output is correct
34 Correct 34 ms 78672 KB Output is correct
35 Correct 35 ms 78684 KB Output is correct
36 Correct 63 ms 79352 KB Output is correct
37 Correct 59 ms 80212 KB Output is correct
38 Correct 66 ms 80720 KB Output is correct
39 Correct 70 ms 80976 KB Output is correct
40 Correct 70 ms 80464 KB Output is correct
41 Correct 62 ms 79908 KB Output is correct
42 Correct 63 ms 79700 KB Output is correct
43 Correct 64 ms 80076 KB Output is correct
44 Correct 34 ms 78684 KB Output is correct
45 Correct 33 ms 78684 KB Output is correct
46 Correct 35 ms 78592 KB Output is correct
47 Correct 36 ms 78680 KB Output is correct
48 Correct 33 ms 78684 KB Output is correct
49 Correct 34 ms 78684 KB Output is correct
50 Correct 34 ms 78800 KB Output is correct
51 Correct 35 ms 78608 KB Output is correct
52 Correct 36 ms 78768 KB Output is correct
53 Correct 71 ms 79444 KB Output is correct
54 Correct 71 ms 80720 KB Output is correct
55 Correct 80 ms 81116 KB Output is correct
56 Correct 67 ms 80464 KB Output is correct
57 Correct 88 ms 82004 KB Output is correct
58 Correct 71 ms 79608 KB Output is correct
59 Correct 69 ms 80464 KB Output is correct