Submission #1264939

#	Time	Username	Problem	Language	Result	Execution time	Memory
1264939		icebear	Toll (BOI17_toll)	C++20	7 / 100	63 ms	9100 KiB

toll

// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;
#define int ll
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

template<class T>
    bool minimize(T &a, const T &b) {
        if (a > b) return a = b, true;
        return false;
    }

template<class T>
    bool maximize(T &a, const T &b) {
        if (a < b) return a = b, true;
        return false;
    }

#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"

const int MOD = 1e9 + 7;
const int inf = 1e9 + 27092008;
const ll INF = 1e18 + 27092008;
const int N = 50000 + 5;
int n, k, m, q;
vector<ii> G[2][N];
ll dist[2][N], ans[N];
vector<array<int, 3>> queries;

void dijkstra(int T, int layer, int L, int R) {
    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> Q;
    FOR(i, L * k, (R + 1) * k - 1) dist[T][i] = INF;
    FOR(i, layer * k, (layer + 1) * k - 1) {
        dist[T][i] = 0;
        Q.push(mp(0, i));
    }

    while(!Q.empty()) {
        ll du; int u;
        tie(du, u) = Q.top(); Q.pop();
        if (du != dist[T][u]) continue;
        for(ii v : G[T][u]) if (L * k <= v.fi && v.fi < (R + 1) * k) {
            if (minimize(dist[T][v.fi], du + v.se))
                Q.push(mp(dist[T][v.fi], v.fi));
        }
    }
}

void DnC(int L, int R, vector<array<int, 3>> &queries) {
    if (L + 1 >= R) {
        for(auto &x : queries) {
            for(ii v : G[0][x[0]]) if (v.fi == x[1])
                ans[x[2]] = v.se;
        }
        return;
    }
    int mid = (L + R) >> 1;
    vector<array<int, 3>> left, right;
    dijkstra(0, mid, L, R);
    dijkstra(1, mid, L, R);
    for(auto &x : queries) {
        if (x[1] / k <= mid) left.pb(x);
        else if (x[0] / k >= mid) right.pb(x);
        else {
            minimize(ans[x[2]], dist[1][x[0]] + dist[0][x[1]]);
        }
    }
    DnC(L, mid, left);
    DnC(mid, R, right);
}

void init(void) {
    cin >> k >> n >> m >> q;
    FOR(i, 1, m) {
        int a, b, t;
        cin >> a >> b >> t;
        G[0][a].pb(mp(b, t));
        G[1][b].pb(mp(a, t));
    }
    FOR(i, 1, q) {
        int a, b;
        cin >> a >> b;
        queries.pb({a, b, i});
    }
}

void process(void) {
    FOR(i, 1, q) ans[i] = INF;
    DnC(0, n / k, queries);
    FOR(i, 1, q) cout << (ans[i] == INF ? -1 : ans[i]) << '\n';
}

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 tc = 1;
//     cin >> tc;
    while(tc--) {
        init();
        process();
    }
    return 0;
}

Compilation message (stderr)

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

• Subtask 1: 7 / 7
• Subtask 2: 0 / 10
• Subtask 3: 0 / 8
• Subtask 4: 0 / 31
• Subtask 5: 0 / 44