oj.uz

답안 #1097907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097907 2024-10-08T15:21:14 Z anhthi Toll (BOI17_toll) C++14
100 / 100
 195 ms 91660 KB 
#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 = 5e4 + 15, 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 - 1) / k) forn(j, 0, LOG)
        intial(oo).swap(f[i][j]);

    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 == b) {
            cout << 0 << '\n';
            continue;
        }
        if (a / k >= b / k) {
            cout << -1 << '\n';
            continue;
        }
        int p = (a / k);
        int d = (b / k) - (a / k);
        matrix res = f[p][ctz(d)];
        p += MASK(ctz(d)); d -= d & -d;
        
        for(; d > 0; d -= d & -d) {
            combine(res, f[p][ctz(d)]).swap(res);
            p += MASK(ctz(d));
        }

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

    }

    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 165 ms 79396 KB Output is correct
2 Correct 12 ms 24920 KB Output is correct
3 Correct 12 ms 24924 KB Output is correct
4 Correct 13 ms 24924 KB Output is correct
5 Correct 13 ms 26132 KB Output is correct
6 Correct 15 ms 26212 KB Output is correct
7 Correct 15 ms 26200 KB Output is correct
8 Correct 175 ms 79188 KB Output is correct
9 Correct 179 ms 79188 KB Output is correct
10 Correct 148 ms 78460 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 79956 KB Output is correct
2 Correct 12 ms 24924 KB Output is correct
3 Correct 11 ms 25080 KB Output is correct
4 Correct 11 ms 24924 KB Output is correct
5 Correct 10 ms 24912 KB Output is correct
6 Correct 10 ms 24924 KB Output is correct
7 Correct 15 ms 26240 KB Output is correct
8 Correct 16 ms 26204 KB Output is correct
9 Correct 139 ms 79188 KB Output is correct
10 Correct 150 ms 76116 KB Output is correct
11 Correct 155 ms 79952 KB Output is correct
12 Correct 126 ms 75180 KB Output is correct
13 Correct 102 ms 64044 KB Output is correct
14 Correct 86 ms 55772 KB Output is correct
15 Correct 89 ms 63056 KB Output is correct
16 Correct 95 ms 63056 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 24920 KB Output is correct
2 Correct 12 ms 24924 KB Output is correct
3 Correct 11 ms 24924 KB Output is correct
4 Correct 12 ms 24912 KB Output is correct
5 Correct 15 ms 24924 KB Output is correct
6 Correct 13 ms 26112 KB Output is correct
7 Correct 14 ms 26204 KB Output is correct
8 Correct 16 ms 26204 KB Output is correct
9 Correct 15 ms 26204 KB Output is correct
10 Correct 140 ms 79116 KB Output is correct
11 Correct 156 ms 79696 KB Output is correct
12 Correct 150 ms 75896 KB Output is correct
13 Correct 151 ms 76192 KB Output is correct
14 Correct 149 ms 75604 KB Output is correct
15 Correct 98 ms 63016 KB Output is correct
16 Correct 100 ms 62804 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 24920 KB Output is correct
2 Correct 12 ms 24924 KB Output is correct
3 Correct 11 ms 24924 KB Output is correct
4 Correct 12 ms 24912 KB Output is correct
5 Correct 15 ms 24924 KB Output is correct
6 Correct 13 ms 26112 KB Output is correct
7 Correct 14 ms 26204 KB Output is correct
8 Correct 16 ms 26204 KB Output is correct
9 Correct 15 ms 26204 KB Output is correct
10 Correct 140 ms 79116 KB Output is correct
11 Correct 156 ms 79696 KB Output is correct
12 Correct 150 ms 75896 KB Output is correct
13 Correct 151 ms 76192 KB Output is correct
14 Correct 149 ms 75604 KB Output is correct
15 Correct 98 ms 63016 KB Output is correct
16 Correct 100 ms 62804 KB Output is correct
17 Correct 179 ms 79700 KB Output is correct
18 Correct 12 ms 24924 KB Output is correct
19 Correct 14 ms 25140 KB Output is correct
20 Correct 11 ms 25032 KB Output is correct
21 Correct 12 ms 24924 KB Output is correct
22 Correct 11 ms 24924 KB Output is correct
23 Correct 16 ms 26200 KB Output is correct
24 Correct 14 ms 26204 KB Output is correct
25 Correct 18 ms 26412 KB Output is correct
26 Correct 16 ms 26460 KB Output is correct
27 Correct 152 ms 78932 KB Output is correct
28 Correct 157 ms 76112 KB Output is correct
29 Correct 153 ms 76116 KB Output is correct
30 Correct 145 ms 75748 KB Output is correct

Subtask #5
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 165 ms 79396 KB Output is correct
2 Correct 12 ms 24920 KB Output is correct
3 Correct 12 ms 24924 KB Output is correct
4 Correct 13 ms 24924 KB Output is correct
5 Correct 13 ms 26132 KB Output is correct
6 Correct 15 ms 26212 KB Output is correct
7 Correct 15 ms 26200 KB Output is correct
8 Correct 175 ms 79188 KB Output is correct
9 Correct 179 ms 79188 KB Output is correct
10 Correct 148 ms 78460 KB Output is correct
11 Correct 170 ms 79956 KB Output is correct
12 Correct 12 ms 24924 KB Output is correct
13 Correct 11 ms 25080 KB Output is correct
14 Correct 11 ms 24924 KB Output is correct
15 Correct 10 ms 24912 KB Output is correct
16 Correct 10 ms 24924 KB Output is correct
17 Correct 15 ms 26240 KB Output is correct
18 Correct 16 ms 26204 KB Output is correct
19 Correct 139 ms 79188 KB Output is correct
20 Correct 150 ms 76116 KB Output is correct
21 Correct 155 ms 79952 KB Output is correct
22 Correct 126 ms 75180 KB Output is correct
23 Correct 102 ms 64044 KB Output is correct
24 Correct 86 ms 55772 KB Output is correct
25 Correct 89 ms 63056 KB Output is correct
26 Correct 95 ms 63056 KB Output is correct
27 Correct 14 ms 24920 KB Output is correct
28 Correct 12 ms 24924 KB Output is correct
29 Correct 11 ms 24924 KB Output is correct
30 Correct 12 ms 24912 KB Output is correct
31 Correct 15 ms 24924 KB Output is correct
32 Correct 13 ms 26112 KB Output is correct
33 Correct 14 ms 26204 KB Output is correct
34 Correct 16 ms 26204 KB Output is correct
35 Correct 15 ms 26204 KB Output is correct
36 Correct 140 ms 79116 KB Output is correct
37 Correct 156 ms 79696 KB Output is correct
38 Correct 150 ms 75896 KB Output is correct
39 Correct 151 ms 76192 KB Output is correct
40 Correct 149 ms 75604 KB Output is correct
41 Correct 98 ms 63016 KB Output is correct
42 Correct 100 ms 62804 KB Output is correct
43 Correct 179 ms 79700 KB Output is correct
44 Correct 12 ms 24924 KB Output is correct
45 Correct 14 ms 25140 KB Output is correct
46 Correct 11 ms 25032 KB Output is correct
47 Correct 12 ms 24924 KB Output is correct
48 Correct 11 ms 24924 KB Output is correct
49 Correct 16 ms 26200 KB Output is correct
50 Correct 14 ms 26204 KB Output is correct
51 Correct 18 ms 26412 KB Output is correct
52 Correct 16 ms 26460 KB Output is correct
53 Correct 152 ms 78932 KB Output is correct
54 Correct 157 ms 76112 KB Output is correct
55 Correct 153 ms 76116 KB Output is correct
56 Correct 145 ms 75748 KB Output is correct
57 Correct 195 ms 91660 KB Output is correct
58 Correct 169 ms 79188 KB Output is correct
59 Correct 175 ms 80076 KB Output is correct