oj.uz

Submission #392786

# Submission time Handle Problem Language Result Execution time Memory
392786 2021-04-21T16:42:05 Z Victor Toll (BOI17_toll) C++17
56 / 100
 3000 ms 7736 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;

int main() {
    vii graph[50001];
    int n, memo[50001], k, m, o;
    scanf("%d %d %d %d", &k, &n, &m, &o);

    rep(i, 0, m) {
        int u, v, w;
        scanf("%d %d %d", &u, &v, &w);
        graph[u].emplace_back(v, w);
    }

    int ans[10000];
    iii orders[10000];

    rep(i, 0, o) {
        orders[i].second.second = i;
        scanf("%d %d", &orders[i].first, &orders[i].second.first);
        orders[i].second.first *= -1;
    }

    sort(orders, orders + o);

    rep(l, 0, o) {
        int a = orders[l].first, b = -orders[l].second.first;

        if (!l || a != orders[l - 1].first) {
            fill(memo + a, memo + b + 1, INF);
            memo[a] = 0;
            rep(i, a, b) {
                if (INF == memo[i]) continue;
                trav(j, graph[i]) {
                    int v, w;
                    tie(v, w) = j;
                    memo[v] = min(memo[v], memo[i] + w);
                }
            }
        }
        ans[orders[l].second.second] = memo[b] == INF ? -1 : memo[b];
    }
    rep(i,0,o)printf("%d\n",ans[i]);
    return 0;
}

Compilation message

toll.cpp: In function 'int main()':
toll.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |     scanf("%d %d %d %d", &k, &n, &m, &o);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
toll.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   32 |         scanf("%d %d %d", &u, &v, &w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
toll.cpp:41:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   41 |         scanf("%d %d", &orders[i].first, &orders[i].second.first);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2965 ms 4280 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 2 ms 1484 KB Output is correct
4 Correct 2 ms 1484 KB Output is correct
5 Correct 2 ms 1612 KB Output is correct
6 Correct 2 ms 1616 KB Output is correct
7 Correct 3 ms 1612 KB Output is correct
8 Correct 329 ms 4272 KB Output is correct
9 Correct 246 ms 4168 KB Output is correct
10 Correct 224 ms 1924 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 4984 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 6 ms 1740 KB Output is correct
8 Correct 8 ms 1740 KB Output is correct
9 Correct 33 ms 4200 KB Output is correct
10 Correct 67 ms 6456 KB Output is correct
11 Correct 46 ms 5060 KB Output is correct
12 Correct 38 ms 4548 KB Output is correct
13 Correct 63 ms 6804 KB Output is correct
14 Correct 40 ms 4788 KB Output is correct
15 Correct 35 ms 4220 KB Output is correct
16 Correct 33 ms 4184 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory 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 1596 KB Output is correct
5 Correct 1 ms 1612 KB Output is correct
6 Correct 2 ms 1612 KB Output is correct
7 Correct 2 ms 1612 KB Output is correct
8 Correct 4 ms 1740 KB Output is correct
9 Correct 3 ms 1612 KB Output is correct
10 Correct 28 ms 4108 KB Output is correct
11 Correct 74 ms 4804 KB Output is correct
12 Correct 104 ms 6304 KB Output is correct
13 Correct 120 ms 7000 KB Output is correct
14 Correct 93 ms 5572 KB Output is correct
15 Correct 55 ms 4108 KB Output is correct
16 Correct 52 ms 4148 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory 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 1596 KB Output is correct
5 Correct 1 ms 1612 KB Output is correct
6 Correct 2 ms 1612 KB Output is correct
7 Correct 2 ms 1612 KB Output is correct
8 Correct 4 ms 1740 KB Output is correct
9 Correct 3 ms 1612 KB Output is correct
10 Correct 28 ms 4108 KB Output is correct
11 Correct 74 ms 4804 KB Output is correct
12 Correct 104 ms 6304 KB Output is correct
13 Correct 120 ms 7000 KB Output is correct
14 Correct 93 ms 5572 KB Output is correct
15 Correct 55 ms 4108 KB Output is correct
16 Correct 52 ms 4148 KB Output is correct
17 Correct 1108 ms 4896 KB Output is correct
18 Correct 1 ms 1488 KB Output is correct
19 Correct 1 ms 1484 KB Output is correct
20 Correct 1 ms 1484 KB Output is correct
21 Correct 1 ms 1484 KB Output is correct
22 Correct 1 ms 1484 KB Output is correct
23 Correct 4 ms 1612 KB Output is correct
24 Correct 9 ms 1612 KB Output is correct
25 Correct 11 ms 1756 KB Output is correct
26 Correct 10 ms 1740 KB Output is correct
27 Correct 123 ms 4164 KB Output is correct
28 Correct 1324 ms 6460 KB Output is correct
29 Correct 1429 ms 7020 KB Output is correct
30 Correct 855 ms 5704 KB Output is correct

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 2965 ms 4280 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 2 ms 1484 KB Output is correct
4 Correct 2 ms 1484 KB Output is correct
5 Correct 2 ms 1612 KB Output is correct
6 Correct 2 ms 1616 KB Output is correct
7 Correct 3 ms 1612 KB Output is correct
8 Correct 329 ms 4272 KB Output is correct
9 Correct 246 ms 4168 KB Output is correct
10 Correct 224 ms 1924 KB Output is correct
11 Correct 44 ms 4984 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 6 ms 1740 KB Output is correct
18 Correct 8 ms 1740 KB Output is correct
19 Correct 33 ms 4200 KB Output is correct
20 Correct 67 ms 6456 KB Output is correct
21 Correct 46 ms 5060 KB Output is correct
22 Correct 38 ms 4548 KB Output is correct
23 Correct 63 ms 6804 KB Output is correct
24 Correct 40 ms 4788 KB Output is correct
25 Correct 35 ms 4220 KB Output is correct
26 Correct 33 ms 4184 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 1596 KB Output is correct
31 Correct 1 ms 1612 KB Output is correct
32 Correct 2 ms 1612 KB Output is correct
33 Correct 2 ms 1612 KB Output is correct
34 Correct 4 ms 1740 KB Output is correct
35 Correct 3 ms 1612 KB Output is correct
36 Correct 28 ms 4108 KB Output is correct
37 Correct 74 ms 4804 KB Output is correct
38 Correct 104 ms 6304 KB Output is correct
39 Correct 120 ms 7000 KB Output is correct
40 Correct 93 ms 5572 KB Output is correct
41 Correct 55 ms 4108 KB Output is correct
42 Correct 52 ms 4148 KB Output is correct
43 Correct 1108 ms 4896 KB Output is correct
44 Correct 1 ms 1488 KB Output is correct
45 Correct 1 ms 1484 KB Output is correct
46 Correct 1 ms 1484 KB Output is correct
47 Correct 1 ms 1484 KB Output is correct
48 Correct 1 ms 1484 KB Output is correct
49 Correct 4 ms 1612 KB Output is correct
50 Correct 9 ms 1612 KB Output is correct
51 Correct 11 ms 1756 KB Output is correct
52 Correct 10 ms 1740 KB Output is correct
53 Correct 123 ms 4164 KB Output is correct
54 Correct 1324 ms 6460 KB Output is correct
55 Correct 1429 ms 7020 KB Output is correct
56 Correct 855 ms 5704 KB Output is correct
57 Execution timed out 3068 ms 7736 KB Time limit exceeded
58 Halted 0 ms 0 KB -