oj.uz

Submission #20988

# Submission time Handle Problem Language Result Execution time Memory
20988 2017-03-27T08:17:04 Z jjwdi0 Jakarta Skyscrapers (APIO15_skyscraper) C++11
100 / 100
 166 ms 9248 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;
using pr = pair<int, int>;

int N, M, dist[30005];
int s, t;
vector<int> v[30005];
priority_queue<pr, vector<pr>, greater<pr>> pq;

bool chk(int to, int cost, int j, int i) {
    if(dist[to] > cost + j) {
        dist[to] = cost + j;
        pq.push(pr(dist[to], to));
    }
    auto it = lower_bound(all(v[to]), i);
    if(it != v[to].end() && *it == i) return false;
    return true;
}

int main() {
    scanf("%d %d", &N, &M);
    for(int i=0, x, y; i<M; i++) {
        scanf("%d %d", &x, &y);
        v[x].push_back(y);
        if(i == 0) s = x;
        if(i == 1) t = x;
    }
    for(int i=0; i<N; i++) sort(all(v[i])), v[i].resize(unique(all(v[i])) - v[i].begin());
    for(int i=0; i<N; i++) dist[i] = 2e9;
    pq.push(pr(0, s));
    while(!pq.empty()) {
        int u = pq.top().second, cost = pq.top().first; pq.pop();
        if(dist[u] < cost) continue;
        dist[u] = cost;
        if(u == t) return printf("%d\n", cost), 0;
        for(int i : v[u]) {
            for(int j = 1; u + j * i < N; j++) {
                int to = u + j * i;
                if(!chk(to, cost, j, i)) break;
            }
            for(int j = 1; u - j * i >= 0; j++) {
                int to = u - j * i;
                if(!chk(to, cost, j, i)) break;
            }
        }
    }
    puts("-1");
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:22:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &N, &M);
                           ^
skyscraper.cpp:24:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &x, &y);
                               ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2844 KB Output is correct
2 Correct 0 ms 2844 KB Output is correct
3 Correct 0 ms 2844 KB Output is correct
4 Correct 0 ms 2844 KB Output is correct
5 Correct 0 ms 2844 KB Output is correct
6 Correct 0 ms 2844 KB Output is correct
7 Correct 0 ms 2844 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2844 KB Output is correct
2 Correct 0 ms 2844 KB Output is correct
3 Correct 0 ms 2844 KB Output is correct
4 Correct 0 ms 2844 KB Output is correct
5 Correct 0 ms 2844 KB Output is correct
6 Correct 0 ms 2844 KB Output is correct
7 Correct 0 ms 2844 KB Output is correct
8 Correct 0 ms 2844 KB Output is correct
9 Correct 0 ms 2844 KB Output is correct
10 Correct 0 ms 2844 KB Output is correct
11 Correct 0 ms 2844 KB Output is correct
12 Correct 0 ms 2844 KB Output is correct
13 Correct 0 ms 2844 KB Output is correct
14 Correct 0 ms 2844 KB Output is correct
15 Correct 0 ms 2844 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2844 KB Output is correct
2 Correct 0 ms 2844 KB Output is correct
3 Correct 0 ms 2844 KB Output is correct
4 Correct 0 ms 2844 KB Output is correct
5 Correct 0 ms 2844 KB Output is correct
6 Correct 0 ms 2844 KB Output is correct
7 Correct 0 ms 2844 KB Output is correct
8 Correct 0 ms 2844 KB Output is correct
9 Correct 0 ms 2844 KB Output is correct
10 Correct 0 ms 2844 KB Output is correct
11 Correct 0 ms 2844 KB Output is correct
12 Correct 0 ms 2844 KB Output is correct
13 Correct 0 ms 2844 KB Output is correct
14 Correct 0 ms 2844 KB Output is correct
15 Correct 0 ms 2844 KB Output is correct
16 Correct 0 ms 2844 KB Output is correct
17 Correct 0 ms 2976 KB Output is correct
18 Correct 0 ms 2844 KB Output is correct
19 Correct 0 ms 2844 KB Output is correct
20 Correct 0 ms 2976 KB Output is correct
21 Correct 0 ms 2844 KB Output is correct
22 Correct 0 ms 2844 KB Output is correct
23 Correct 0 ms 2844 KB Output is correct
24 Correct 0 ms 2988 KB Output is correct
25 Correct 0 ms 2976 KB Output is correct
26 Correct 0 ms 2844 KB Output is correct
27 Correct 0 ms 2844 KB Output is correct
28 Correct 0 ms 2976 KB Output is correct
29 Correct 3 ms 3124 KB Output is correct
30 Correct 0 ms 2988 KB Output is correct
31 Correct 0 ms 2988 KB Output is correct
32 Correct 0 ms 2992 KB Output is correct
33 Correct 3 ms 3328 KB Output is correct
34 Correct 3 ms 3328 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2844 KB Output is correct
2 Correct 0 ms 2844 KB Output is correct
3 Correct 0 ms 2844 KB Output is correct
4 Correct 0 ms 2844 KB Output is correct
5 Correct 0 ms 2844 KB Output is correct
6 Correct 0 ms 2844 KB Output is correct
7 Correct 0 ms 2844 KB Output is correct
8 Correct 0 ms 2844 KB Output is correct
9 Correct 0 ms 2844 KB Output is correct
10 Correct 0 ms 2844 KB Output is correct
11 Correct 0 ms 2844 KB Output is correct
12 Correct 0 ms 2844 KB Output is correct
13 Correct 0 ms 2844 KB Output is correct
14 Correct 0 ms 2844 KB Output is correct
15 Correct 0 ms 2844 KB Output is correct
16 Correct 0 ms 2844 KB Output is correct
17 Correct 0 ms 2976 KB Output is correct
18 Correct 0 ms 2844 KB Output is correct
19 Correct 0 ms 2844 KB Output is correct
20 Correct 0 ms 2976 KB Output is correct
21 Correct 0 ms 2844 KB Output is correct
22 Correct 0 ms 2844 KB Output is correct
23 Correct 0 ms 2844 KB Output is correct
24 Correct 0 ms 2988 KB Output is correct
25 Correct 0 ms 2976 KB Output is correct
26 Correct 0 ms 2844 KB Output is correct
27 Correct 0 ms 2844 KB Output is correct
28 Correct 0 ms 2976 KB Output is correct
29 Correct 3 ms 3124 KB Output is correct
30 Correct 0 ms 2988 KB Output is correct
31 Correct 0 ms 2988 KB Output is correct
32 Correct 0 ms 2992 KB Output is correct
33 Correct 3 ms 3328 KB Output is correct
34 Correct 3 ms 3328 KB Output is correct
35 Correct 6 ms 3108 KB Output is correct
36 Correct 3 ms 2976 KB Output is correct
37 Correct 6 ms 3112 KB Output is correct
38 Correct 9 ms 3292 KB Output is correct
39 Correct 9 ms 3108 KB Output is correct
40 Correct 9 ms 3108 KB Output is correct
41 Correct 9 ms 3292 KB Output is correct
42 Correct 6 ms 3120 KB Output is correct
43 Correct 6 ms 3120 KB Output is correct
44 Correct 3 ms 3116 KB Output is correct
45 Correct 13 ms 3488 KB Output is correct
46 Correct 13 ms 3492 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2844 KB Output is correct
2 Correct 0 ms 2844 KB Output is correct
3 Correct 0 ms 2844 KB Output is correct
4 Correct 0 ms 2844 KB Output is correct
5 Correct 0 ms 2844 KB Output is correct
6 Correct 0 ms 2844 KB Output is correct
7 Correct 0 ms 2844 KB Output is correct
8 Correct 0 ms 2844 KB Output is correct
9 Correct 0 ms 2844 KB Output is correct
10 Correct 0 ms 2844 KB Output is correct
11 Correct 0 ms 2844 KB Output is correct
12 Correct 0 ms 2844 KB Output is correct
13 Correct 0 ms 2844 KB Output is correct
14 Correct 0 ms 2844 KB Output is correct
15 Correct 0 ms 2844 KB Output is correct
16 Correct 0 ms 2844 KB Output is correct
17 Correct 0 ms 2976 KB Output is correct
18 Correct 0 ms 2844 KB Output is correct
19 Correct 0 ms 2844 KB Output is correct
20 Correct 0 ms 2976 KB Output is correct
21 Correct 0 ms 2844 KB Output is correct
22 Correct 0 ms 2844 KB Output is correct
23 Correct 0 ms 2844 KB Output is correct
24 Correct 0 ms 2988 KB Output is correct
25 Correct 0 ms 2976 KB Output is correct
26 Correct 0 ms 2844 KB Output is correct
27 Correct 0 ms 2844 KB Output is correct
28 Correct 0 ms 2976 KB Output is correct
29 Correct 3 ms 3124 KB Output is correct
30 Correct 0 ms 2988 KB Output is correct
31 Correct 0 ms 2988 KB Output is correct
32 Correct 0 ms 2992 KB Output is correct
33 Correct 3 ms 3328 KB Output is correct
34 Correct 3 ms 3328 KB Output is correct
35 Correct 9 ms 3108 KB Output is correct
36 Correct 0 ms 2976 KB Output is correct
37 Correct 16 ms 3112 KB Output is correct
38 Correct 9 ms 3292 KB Output is correct
39 Correct 9 ms 3108 KB Output is correct
40 Correct 9 ms 3108 KB Output is correct
41 Correct 6 ms 3292 KB Output is correct
42 Correct 6 ms 3120 KB Output is correct
43 Correct 6 ms 3120 KB Output is correct
44 Correct 6 ms 3116 KB Output is correct
45 Correct 13 ms 3488 KB Output is correct
46 Correct 13 ms 3492 KB Output is correct
47 Correct 29 ms 4040 KB Output is correct
48 Correct 9 ms 3372 KB Output is correct
49 Correct 9 ms 3372 KB Output is correct
50 Correct 3 ms 3240 KB Output is correct
51 Correct 16 ms 4288 KB Output is correct
52 Correct 19 ms 4292 KB Output is correct
53 Correct 16 ms 3644 KB Output is correct
54 Correct 0 ms 3116 KB Output is correct
55 Correct 3 ms 3116 KB Output is correct
56 Correct 13 ms 3768 KB Output is correct
57 Correct 0 ms 3380 KB Output is correct
58 Correct 6 ms 3184 KB Output is correct
59 Correct 6 ms 3184 KB Output is correct
60 Correct 9 ms 3192 KB Output is correct
61 Correct 9 ms 3200 KB Output is correct
62 Correct 16 ms 3768 KB Output is correct
63 Correct 53 ms 6232 KB Output is correct
64 Correct 59 ms 6196 KB Output is correct
65 Correct 79 ms 6220 KB Output is correct
66 Correct 166 ms 9248 KB Output is correct
67 Correct 116 ms 9248 KB Output is correct