oj.uz

답안 #245080

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
245080 2020-07-05T12:12:40 Z santaclaus03 Toll (BOI17_toll) C++14
100 / 100
 662 ms 55508 KB 
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ii = pair<int, int>;
using vvii = vector<vector<ii>>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;

#define INF 1000000000

int K, N, M, O; 
vvii rev;
vector<ii> queries;

vi sqrt_dcmp() {
    int S = (int) sqrt(N);
    int G = (int) ceil((double) N / S);
    vvvi dist(G, vvi(S + K * 2, vi(S + K * 2, INF)));
    for (int g = 0; g < G; ++g) {
        for (int u = 0; u < S + K * 2; ++u) {
            dist[g][u][u] = 0;
            for (int v = u + 1; v < S + K * 2; ++v) {
                if (u + g * S >= N || v + g * S >= N) continue;
                for (ii e : rev[v + g * S]) {
                    int w = e.second - g * S;
                    if (w < u) continue;
                    dist[g][u][v] = min(dist[g][u][v], dist[g][u][w] + e.first);
                }
            }
        }
    }
    vi answers;
    for (ii q : queries) {
        int a = q.first, b = q.second;
        if (b < a) {
            answers.push_back(-1);
            continue;
        }
        int ans = INF;
        int g1 = a / S, g2 = b / S;
        if (g1 == g2) {
            ans = dist[g1][a % S][b % S];
        } else {
            vvi d(G, vi(K * 2, INF));
            for (int k = 0; k < K * 2; ++k) {
                d[g1+1][k] = dist[g1][a % S][k + S];
            }
            for (int g = g1 + 2; g <= g2; ++g) {
                for (int k1 = 0; k1 < K * 2; ++k1) {
                    for (int k2 = 0; k2 < K * 2; ++k2) {
                        d[g][k1] = min(d[g][k1], d[g-1][k2] + dist[g-1][k2][k1 + S]);
                    }
                }
            }
            for (int k = 0; k < K * 2; ++k) {
                ans = min(ans, d[g2][k] + dist[g2][k][b % S]);
            }
        }
        answers.push_back(ans == INF ? -1 : ans);
    }
    return answers;
}

vi bruteforce() {
    vi d0(N, INF);
    d0[0] = 0;
    for (int u = 1; u < N; ++u)
    {
        for (ii e : rev[u])
        {
            d0[u] = min(d0[u], d0[e.second] + e.first);
        }
    }
    vi answers;
    for (ii q : queries)
    {
        int a = q.first, b = q.second;
        int ans;
        if (a == 0) {
            ans = d0[b];
        }
        else
        {
            vi d(N, INF);
            d[a] = 0;
            for (int u = a + 1; u < N; ++u)
            {
                for (ii e : rev[u])
                {
                    d[u] = min(d[u], d[e.second] + e.first);
                }
            }
            ans = d[b];
        }
        answers.push_back(ans == INF ? -1 : ans);
    }
    return answers;
}

int main() {
    //freopen("out.txt", "w", stdout);
    //freopen("in.txt", "r", stdin);
    cin >> K >> N >> M >> O;
    rev.resize(N);
    queries.resize(O);
    for (int i = 0; i < M; ++i) {
        int a, b, t; cin >> a >> b >> t;
        rev[b].emplace_back(t, a);
    }
    for (int i = 0; i < O; ++i) cin >> queries[i].first >> queries[i].second;
    //vi expected = bruteforce();
    vi actual = sqrt_dcmp();
    //cout << "sqrt dcmp ok" << endl;
    for (int i = 0; i < O; ++i) {
        //if (expected[i] != actual[i]) {
        //    cout << queries[i].first << " " << queries[i].second << endl;
        //    cout << "Expected: " << expected[i] << ", Actual: " << actual[i] << endl;
        //}
        cout << actual[i] << endl;
    }
    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 263 ms 50764 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 10 ms 640 KB Output is correct
6 Correct 9 ms 640 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 269 ms 50680 KB Output is correct
9 Correct 283 ms 50680 KB Output is correct
10 Correct 192 ms 48256 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 370 ms 52472 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 44 ms 768 KB Output is correct
8 Correct 46 ms 888 KB Output is correct
9 Correct 275 ms 50684 KB Output is correct
10 Correct 524 ms 54008 KB Output is correct
11 Correct 398 ms 52728 KB Output is correct
12 Correct 418 ms 52472 KB Output is correct
13 Correct 333 ms 29944 KB Output is correct
14 Correct 206 ms 27384 KB Output is correct
15 Correct 234 ms 27896 KB Output is correct
16 Correct 233 ms 28024 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 7 ms 640 KB Output is correct
8 Correct 11 ms 768 KB Output is correct
9 Correct 9 ms 768 KB Output is correct
10 Correct 124 ms 50424 KB Output is correct
11 Correct 202 ms 52344 KB Output is correct
12 Correct 259 ms 53624 KB Output is correct
13 Correct 289 ms 53880 KB Output is correct
14 Correct 234 ms 53368 KB Output is correct
15 Correct 152 ms 27896 KB Output is correct
16 Correct 151 ms 28024 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 7 ms 640 KB Output is correct
8 Correct 11 ms 768 KB Output is correct
9 Correct 9 ms 768 KB Output is correct
10 Correct 124 ms 50424 KB Output is correct
11 Correct 202 ms 52344 KB Output is correct
12 Correct 259 ms 53624 KB Output is correct
13 Correct 289 ms 53880 KB Output is correct
14 Correct 234 ms 53368 KB Output is correct
15 Correct 152 ms 27896 KB Output is correct
16 Correct 151 ms 28024 KB Output is correct
17 Correct 246 ms 52344 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 17 ms 640 KB Output is correct
24 Correct 20 ms 768 KB Output is correct
25 Correct 25 ms 768 KB Output is correct
26 Correct 24 ms 768 KB Output is correct
27 Correct 173 ms 50552 KB Output is correct
28 Correct 330 ms 53716 KB Output is correct
29 Correct 375 ms 53880 KB Output is correct
30 Correct 309 ms 53368 KB Output is correct

Subtask #5
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 263 ms 50764 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 10 ms 640 KB Output is correct
6 Correct 9 ms 640 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 269 ms 50680 KB Output is correct
9 Correct 283 ms 50680 KB Output is correct
10 Correct 192 ms 48256 KB Output is correct
11 Correct 370 ms 52472 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 44 ms 768 KB Output is correct
18 Correct 46 ms 888 KB Output is correct
19 Correct 275 ms 50684 KB Output is correct
20 Correct 524 ms 54008 KB Output is correct
21 Correct 398 ms 52728 KB Output is correct
22 Correct 418 ms 52472 KB Output is correct
23 Correct 333 ms 29944 KB Output is correct
24 Correct 206 ms 27384 KB Output is correct
25 Correct 234 ms 27896 KB Output is correct
26 Correct 233 ms 28024 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 256 KB Output is correct
29 Correct 5 ms 256 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 7 ms 640 KB Output is correct
34 Correct 11 ms 768 KB Output is correct
35 Correct 9 ms 768 KB Output is correct
36 Correct 124 ms 50424 KB Output is correct
37 Correct 202 ms 52344 KB Output is correct
38 Correct 259 ms 53624 KB Output is correct
39 Correct 289 ms 53880 KB Output is correct
40 Correct 234 ms 53368 KB Output is correct
41 Correct 152 ms 27896 KB Output is correct
42 Correct 151 ms 28024 KB Output is correct
43 Correct 246 ms 52344 KB Output is correct
44 Correct 5 ms 256 KB Output is correct
45 Correct 5 ms 256 KB Output is correct
46 Correct 5 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 5 ms 256 KB Output is correct
49 Correct 17 ms 640 KB Output is correct
50 Correct 20 ms 768 KB Output is correct
51 Correct 25 ms 768 KB Output is correct
52 Correct 24 ms 768 KB Output is correct
53 Correct 173 ms 50552 KB Output is correct
54 Correct 330 ms 53716 KB Output is correct
55 Correct 375 ms 53880 KB Output is correct
56 Correct 309 ms 53368 KB Output is correct
57 Correct 662 ms 55508 KB Output is correct
58 Correct 276 ms 50784 KB Output is correct
59 Correct 398 ms 52856 KB Output is correct