oj.uz

Submission #1118515

# Submission time Handle Problem Language Result Execution time Memory
1118515 2024-11-25T15:31:12 Z gdragon Toll (BOI17_toll) C++17
56 / 100
 3000 ms 22704 KB 
#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 1e5 + 5;
const int M = 1e6 + 5;
const int inf = 1e9 + 7;
const long long INF = (long long)1e18 + 7;
const int mod = 1e9 + 7;
struct DSU {
    int n;
    vector<int> par;
    DSU(int _n = 0) {
        n = _n;
        par.assign(n + 2, -1);
    }
    int root(int v) {
        return par[v] < 0 ? v : (par[v] = root(par[v]));
    } 
    bool join(int x, int y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (par[y] < par[x]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        return true;
    }
} dsu;
struct Edge {
    int u, v, c;
    Edge(int _u = 0, int _v = 0, int _c = 0) {
        u = _u; v = _v; c = _c;
    }
} e[M];
vector<ii> adj[N];
int n, K, m, q;
void read() {
    cin >> K >> n >> m >> q;
    dsu = DSU(n);
    for(int i = 1; i <= m; i++) {
        int u, v, c; cin >> u >> v >> c;
        assert(v - u < 2 * K);
        adj[u].push_back({v, c});
        dsu.join(u, v);
        if (K == 1) assert(v == u + 1);
        e[i] = Edge(u, v, c);  
    }
}
long long dfs(int s, int t) {
    vector<long long> d(n + 1, INF);
    d[s] = 0;
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> heap;
    heap.push({0, s});
    while(!heap.empty()) {
        auto tmp = heap.top(); heap.pop();
        long long du = tmp.fi;
        int u = tmp.se;
        if (du != d[u]) continue;
        if (u == t) break;
        for(auto [v, c]: adj[u]) if (minimize(d[v], du + c)) {
            heap.push({d[v], v});
        }
    }
    return d[t] == INF ? -1 : d[t];
}
long long dp[N];
long long backtrack(int u, int t) {
    if (u == t) return 0;
    if (u / K >= t / K) return INF;
    long long &res = dp[u];
    if (res != -1) return res;
    res = INF;
    for(auto [v, c]: adj[u]) {
        minimize(res, backtrack(v, t) + c);
    } 
    return res;
}
void solve() {
    vector<long long> d(n + 2, 0);
    if (K == 1) {
        for(int i = 1; i <= m; i++) d[e[i].v] = e[i].c;
        for(int i = 1; i <= n; i++) d[i] += d[i - 1];
    }
    vector<long long> d0(n + 1, INF);
    d0[0] = 0;
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> heap;
    heap.push({0, 0});
    while(!heap.empty()) {
        auto tmp = heap.top(); heap.pop();
        long long du = tmp.fi;
        int u = tmp.se;
        if (du != d0[u]) continue;
        for(auto [v, c]: adj[u]) if (minimize(d0[v], du + c)) {
            heap.push({d0[v], v});
        }
    }
    while(q--) {
        int u, v; cin >> u >> v;
        if (u == v) {
            cout << 0 << endl;
            continue;
        }
        if (u > v || u/K == v/K || dsu.root(u) != dsu.root(v)) {
            cout << -1 << endl;
            continue;
        }
        if (K == 1) {
            cout << d[v] - d[u] << endl;
            continue;
        }
        if (u == 0) {
            cout << (d0[v] == INF ? -1 : d0[v]) << endl;
            continue;
        }
        for(int i = 0; i < n; i++) dp[i] = -1;
        long long ans = backtrack(u, v);
        cout << (ans == INF ? -1 : ans) << endl;
        // cout << dfs(u, v) << endl;
    }
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
    int test = 1;
    // cin >> test;
    while(test--) {
        read();
        solve();
    }
    return 0;
}

// rmq - rmq2d
// hash
// fw - fw2d
// segtree

Compilation message

toll.cpp: In function 'int main()':
toll.cpp:137:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  137 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
toll.cpp:138:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  138 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 18012 KB Output is correct
2 Correct 13 ms 14428 KB Output is correct
3 Correct 14 ms 14784 KB Output is correct
4 Correct 15 ms 14428 KB Output is correct
5 Correct 13 ms 14428 KB Output is correct
6 Correct 13 ms 14432 KB Output is correct
7 Correct 14 ms 14432 KB Output is correct
8 Correct 43 ms 18052 KB Output is correct
9 Correct 39 ms 18340 KB Output is correct
10 Correct 24 ms 15684 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 18712 KB Output is correct
2 Correct 5 ms 14416 KB Output is correct
3 Correct 10 ms 14416 KB Output is correct
4 Correct 5 ms 14416 KB Output is correct
5 Correct 8 ms 14416 KB Output is correct
6 Correct 12 ms 14416 KB Output is correct
7 Correct 25 ms 14708 KB Output is correct
8 Correct 26 ms 14740 KB Output is correct
9 Correct 41 ms 17992 KB Output is correct
10 Correct 66 ms 20304 KB Output is correct
11 Correct 69 ms 18628 KB Output is correct
12 Correct 52 ms 18260 KB Output is correct
13 Correct 75 ms 20308 KB Output is correct
14 Correct 57 ms 18016 KB Output is correct
15 Correct 38 ms 17668 KB Output is correct
16 Correct 36 ms 17500 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14428 KB Output is correct
2 Correct 10 ms 14428 KB Output is correct
3 Correct 11 ms 14524 KB Output is correct
4 Correct 14 ms 14428 KB Output is correct
5 Correct 9 ms 14428 KB Output is correct
6 Correct 15 ms 14428 KB Output is correct
7 Correct 12 ms 14628 KB Output is correct
8 Correct 12 ms 14700 KB Output is correct
9 Correct 15 ms 14672 KB Output is correct
10 Correct 34 ms 17716 KB Output is correct
11 Correct 108 ms 20140 KB Output is correct
12 Correct 104 ms 21460 KB Output is correct
13 Correct 154 ms 21904 KB Output is correct
14 Correct 110 ms 20520 KB Output is correct
15 Correct 75 ms 18148 KB Output is correct
16 Correct 72 ms 18000 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14428 KB Output is correct
2 Correct 10 ms 14428 KB Output is correct
3 Correct 11 ms 14524 KB Output is correct
4 Correct 14 ms 14428 KB Output is correct
5 Correct 9 ms 14428 KB Output is correct
6 Correct 15 ms 14428 KB Output is correct
7 Correct 12 ms 14628 KB Output is correct
8 Correct 12 ms 14700 KB Output is correct
9 Correct 15 ms 14672 KB Output is correct
10 Correct 34 ms 17716 KB Output is correct
11 Correct 108 ms 20140 KB Output is correct
12 Correct 104 ms 21460 KB Output is correct
13 Correct 154 ms 21904 KB Output is correct
14 Correct 110 ms 20520 KB Output is correct
15 Correct 75 ms 18148 KB Output is correct
16 Correct 72 ms 18000 KB Output is correct
17 Correct 1645 ms 20496 KB Output is correct
18 Correct 10 ms 14416 KB Output is correct
19 Correct 9 ms 14416 KB Output is correct
20 Correct 10 ms 14436 KB Output is correct
21 Correct 10 ms 14568 KB Output is correct
22 Correct 12 ms 14672 KB Output is correct
23 Correct 21 ms 14416 KB Output is correct
24 Correct 38 ms 14672 KB Output is correct
25 Correct 43 ms 14672 KB Output is correct
26 Correct 34 ms 14672 KB Output is correct
27 Correct 38 ms 17868 KB Output is correct
28 Correct 2129 ms 21656 KB Output is correct
29 Correct 2036 ms 22004 KB Output is correct
30 Correct 1097 ms 20428 KB Output is correct

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 18012 KB Output is correct
2 Correct 13 ms 14428 KB Output is correct
3 Correct 14 ms 14784 KB Output is correct
4 Correct 15 ms 14428 KB Output is correct
5 Correct 13 ms 14428 KB Output is correct
6 Correct 13 ms 14432 KB Output is correct
7 Correct 14 ms 14432 KB Output is correct
8 Correct 43 ms 18052 KB Output is correct
9 Correct 39 ms 18340 KB Output is correct
10 Correct 24 ms 15684 KB Output is correct
11 Correct 75 ms 18712 KB Output is correct
12 Correct 5 ms 14416 KB Output is correct
13 Correct 10 ms 14416 KB Output is correct
14 Correct 5 ms 14416 KB Output is correct
15 Correct 8 ms 14416 KB Output is correct
16 Correct 12 ms 14416 KB Output is correct
17 Correct 25 ms 14708 KB Output is correct
18 Correct 26 ms 14740 KB Output is correct
19 Correct 41 ms 17992 KB Output is correct
20 Correct 66 ms 20304 KB Output is correct
21 Correct 69 ms 18628 KB Output is correct
22 Correct 52 ms 18260 KB Output is correct
23 Correct 75 ms 20308 KB Output is correct
24 Correct 57 ms 18016 KB Output is correct
25 Correct 38 ms 17668 KB Output is correct
26 Correct 36 ms 17500 KB Output is correct
27 Correct 9 ms 14428 KB Output is correct
28 Correct 10 ms 14428 KB Output is correct
29 Correct 11 ms 14524 KB Output is correct
30 Correct 14 ms 14428 KB Output is correct
31 Correct 9 ms 14428 KB Output is correct
32 Correct 15 ms 14428 KB Output is correct
33 Correct 12 ms 14628 KB Output is correct
34 Correct 12 ms 14700 KB Output is correct
35 Correct 15 ms 14672 KB Output is correct
36 Correct 34 ms 17716 KB Output is correct
37 Correct 108 ms 20140 KB Output is correct
38 Correct 104 ms 21460 KB Output is correct
39 Correct 154 ms 21904 KB Output is correct
40 Correct 110 ms 20520 KB Output is correct
41 Correct 75 ms 18148 KB Output is correct
42 Correct 72 ms 18000 KB Output is correct
43 Correct 1645 ms 20496 KB Output is correct
44 Correct 10 ms 14416 KB Output is correct
45 Correct 9 ms 14416 KB Output is correct
46 Correct 10 ms 14436 KB Output is correct
47 Correct 10 ms 14568 KB Output is correct
48 Correct 12 ms 14672 KB Output is correct
49 Correct 21 ms 14416 KB Output is correct
50 Correct 38 ms 14672 KB Output is correct
51 Correct 43 ms 14672 KB Output is correct
52 Correct 34 ms 14672 KB Output is correct
53 Correct 38 ms 17868 KB Output is correct
54 Correct 2129 ms 21656 KB Output is correct
55 Correct 2036 ms 22004 KB Output is correct
56 Correct 1097 ms 20428 KB Output is correct
57 Execution timed out 3042 ms 22704 KB Time limit exceeded
58 Halted 0 ms 0 KB -