oj.uz

답안 #391047

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
391047 2021-04-17T16:24:44 Z Victor Toll (BOI17_toll) C++17
25 / 100
 3000 ms 6724 KB 
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;

const int INF = 1000000007;

vii graph[50001];
int n, rgt[50001], dist[50001];

void solve(int u, int d) {
    if (n <= u) return;

    dist[u] = d;
    if (graph[u].empty()) {
        rgt[u] = u;
        solve(u + 1, 0);

    } else {
        int v, w;
        tie(v, w) = graph[u][0];
        solve(v,d+w);
        rgt[u] = rgt[v];
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int k, m, o;
    cin >> k >> n >> m >> o;
    rep(i, 0, m) {
        int u, v, w;
        cin >> u >> v >> w;
        graph[u].emplace_back(v, w);
    }

    if (k == 1) {
        solve(0, 0);
        while (o--) {
            int a, b;
            cin >> a >> b;
            if (b < a || rgt[a] < b)
                cout << -1 << endl;
            else
                cout << dist[b] - dist[a] << endl;
        }

    } else {
        int preva = -1;
        set<ii> pq;
        rep(i, 0, o) {
            int a, b;
            cin >> a >> b;

            if (preva != a) {
                fill(dist, dist + n, INF);
                dist[a] = 0;
                rep(i, 0, n) pq.insert({dist[i], i});

                while (!pq.empty()) {
                    int d, u;
                    tie(d, u) = *pq.begin();
                    pq.erase(pq.begin());

                    trav(edge, graph[u]) {
                        int v, w;
                        tie(v, w) = edge;
                        if (d + w >= dist[v]) continue;

                        pq.erase({dist[v], v});
                        dist[v] = d + w;
                        pq.emplace(d + w, v);
                    }
                }
            }
            preva = a;
            if (dist[b] == INF)
                cout << "-1\n";
            else
                cout << dist[b] << endl;
        }
    }
    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 5068 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 3 ms 1516 KB Output is correct
6 Correct 3 ms 1484 KB Output is correct
7 Correct 3 ms 1512 KB Output is correct
8 Correct 41 ms 5836 KB Output is correct
9 Correct 41 ms 5788 KB Output is correct
10 Correct 19 ms 2124 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 5604 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 1 ms 1484 KB Output is correct
7 Correct 19 ms 1588 KB Output is correct
8 Correct 21 ms 1612 KB Output is correct
9 Correct 40 ms 4912 KB Output is correct
10 Correct 99 ms 6460 KB Output is correct
11 Correct 85 ms 5680 KB Output is correct
12 Correct 45 ms 5504 KB Output is correct
13 Correct 82 ms 5508 KB Output is correct
14 Correct 57 ms 4556 KB Output is correct
15 Correct 54 ms 4228 KB Output is correct
16 Correct 66 ms 4292 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 2 ms 1484 KB Output is correct
7 Correct 26 ms 1484 KB Output is correct
8 Correct 40 ms 1612 KB Output is correct
9 Correct 34 ms 1484 KB Output is correct
10 Correct 23 ms 4932 KB Output is correct
11 Correct 1618 ms 5500 KB Output is correct
12 Correct 1875 ms 6468 KB Output is correct
13 Correct 2017 ms 6724 KB Output is correct
14 Correct 1819 ms 6016 KB Output is correct
15 Correct 1115 ms 4304 KB Output is correct
16 Correct 1111 ms 4228 KB Output is correct

Subtask #4
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 2 ms 1484 KB Output is correct
7 Correct 26 ms 1484 KB Output is correct
8 Correct 40 ms 1612 KB Output is correct
9 Correct 34 ms 1484 KB Output is correct
10 Correct 23 ms 4932 KB Output is correct
11 Correct 1618 ms 5500 KB Output is correct
12 Correct 1875 ms 6468 KB Output is correct
13 Correct 2017 ms 6724 KB Output is correct
14 Correct 1819 ms 6016 KB Output is correct
15 Correct 1115 ms 4304 KB Output is correct
16 Correct 1111 ms 4228 KB Output is correct
17 Execution timed out 3057 ms 5512 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 5068 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 3 ms 1516 KB Output is correct
6 Correct 3 ms 1484 KB Output is correct
7 Correct 3 ms 1512 KB Output is correct
8 Correct 41 ms 5836 KB Output is correct
9 Correct 41 ms 5788 KB Output is correct
10 Correct 19 ms 2124 KB Output is correct
11 Correct 63 ms 5604 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 1 ms 1484 KB Output is correct
15 Correct 1 ms 1484 KB Output is correct
16 Correct 1 ms 1484 KB Output is correct
17 Correct 19 ms 1588 KB Output is correct
18 Correct 21 ms 1612 KB Output is correct
19 Correct 40 ms 4912 KB Output is correct
20 Correct 99 ms 6460 KB Output is correct
21 Correct 85 ms 5680 KB Output is correct
22 Correct 45 ms 5504 KB Output is correct
23 Correct 82 ms 5508 KB Output is correct
24 Correct 57 ms 4556 KB Output is correct
25 Correct 54 ms 4228 KB Output is correct
26 Correct 66 ms 4292 KB Output is correct
27 Correct 1 ms 1484 KB Output is correct
28 Correct 1 ms 1484 KB Output is correct
29 Correct 1 ms 1484 KB Output is correct
30 Correct 1 ms 1484 KB Output is correct
31 Correct 1 ms 1484 KB Output is correct
32 Correct 2 ms 1484 KB Output is correct
33 Correct 26 ms 1484 KB Output is correct
34 Correct 40 ms 1612 KB Output is correct
35 Correct 34 ms 1484 KB Output is correct
36 Correct 23 ms 4932 KB Output is correct
37 Correct 1618 ms 5500 KB Output is correct
38 Correct 1875 ms 6468 KB Output is correct
39 Correct 2017 ms 6724 KB Output is correct
40 Correct 1819 ms 6016 KB Output is correct
41 Correct 1115 ms 4304 KB Output is correct
42 Correct 1111 ms 4228 KB Output is correct
43 Execution timed out 3057 ms 5512 KB Time limit exceeded
44 Halted 0 ms 0 KB -