Submission #1097895

#	Time	Username	Problem	Language	Result	Execution time	Memory
1097895		anhthi	Toll (BOI17_toll)	C++14	7 / 100	267 ms	157816 KiB

toll

#include <bits/stdc++.h>
 
using namespace std;
 
#define fi first
#define se second
#define ll long long
#define mp(x, y) make_pair(x, y)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define pb push_back
#define heap priority_queue
#define max_rng *max_element
#define min_rng *min_element
#define rep(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define forn(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)

 
template <class X, class Y>
    inline bool maximize(X &x, Y y) {
        return (x < y ? x = y, true : false);
    }
 
template <class X, class Y>
    inline bool minimize(X &x, Y y) {
        return (x > y ? x = y, true : false);
    }
 
template <class X>
    inline void compress(vector<X> &a) {
        sort(all(a));
        a.resize(unique(all(a)) - a.begin());
    }
 
int ctz(ll x) { return __builtin_ctzll(x); }
int lg(ll x) { return 63 - __builtin_clzll(x); }
int popcount(ll x) { return __builtin_popcount(x); }
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) {
    return l + abs((ll) rng()) % (r - l + 1);
}
 
const ll oo = (ll) 1e17;
const int inf = (ll) 1e9 + 7, mod = (ll) 1e9 + 7;
 
const int N = 1e5 + 5, LOG = 16;
 
void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }

int k, n, m, q;

using matrix = vector<vector<ll>>;
#define intial(x) matrix(k, vector<ll>(k, x))

matrix f[N][LOG + 5];
matrix combine(matrix &x, matrix &y) {
    matrix res = intial(oo);
    forn(u, 0, k - 1) forn(v, 0, k - 1) forn(mid, 0, k - 1) {
        minimize(res[u][v], x[u][mid] + y[mid][v]);
    }
    return res;
}

int main(void) {
 
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    cin >> k >> n >> m >> q;

    forn(i, 0, n) fill(f[i], f[i] + 1 + LOG, intial(oo));

    rep(i, m) {
        int u, v, w;
        cin >> u >> v >> w;
        f[u / k][0][u % k][v % k] = w;
    }

    rep(j, LOG) {
        forn(i, 0, (n - 1) / k - MASK(j)) {
            combine(f[i][j-1], f[i + MASK(j-1)][j-1]).swap(f[i][j]);
        }
    }

    rep(_, q) {
        int a, b;
        cin >> a >> b;

        if (a / k + 1 > b / k) {
            cout << -1 << '\n';
            continue;
        }

        matrix res = intial(0);

        int p = a / k;
        ford(i, LOG, 0) {
            if (p + MASK(i) <= b / k) {
                combine(res, f[p][i]).swap(res);
                p += MASK(i);
            }
        }

        ll ans = res[a % k][b % k];
        if (ans >= oo) cout << -1 << '\n';
        else cout << ans << '\n';

    }

    return 0;
}

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