oj.uz

Submission #249226

# Submission time Handle Problem Language Result Execution time Memory
249226 2020-07-14T13:53:32 Z rdd6584 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 72952 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int ,int> pii;

char visit[30000];
map<int,int> dist[30000];
vector<int> v[30000];

int main() {
    int n, m;
    scanf("%d %d", &n, &m);

    int st, ed;
    for (int i = 0; i < m; i++) {
        int a,b;
        scanf("%d %d" ,&a, &b);
        v[a].push_back(b);
        if (i==0) st = a;
        else if (i==1) ed = a;
    }

    queue<pii> q;
    for (int i : v[st]) dist[st][i] = 0, q.push({st, i});

    while (!q.empty()) {
        pii tv = q.front();
        q.pop();

        if (tv.first == ed) return !printf("%d", dist[tv.first][tv.second]);

        int ne = tv.first-tv.second;
        int me = dist[tv.first][tv.second];

        if (ne >= 0) {
            if (dist[ne].find(tv.second) == dist[ne].end()) {
                int flag = 0;
                if (!visit[ne]) {
                    visit[ne] = 1;
                    for (int i : v[ne]) {
                        dist[ne][i] = me+1;
                        q.push({ne, i});
                        flag |= i==tv.second;
                    }
                }
                if (!flag) {
                    q.push({ne, tv.second});
                    dist[ne][tv.second] = me + 1;
                }
            }
        }

        ne = tv.first+tv.second;
        if (ne < n) {
            if (dist[ne].find(tv.second) == dist[ne].end()) {
                int flag = 0;
                if (!visit[ne]) {
                    visit[ne] = 1;
                    for (int i : v[ne]) {
                        dist[ne][i] = me+1;
                        q.push({ne, i});
                        flag |= i==tv.second;
                    }
                }
                if (!flag) {
                    q.push({ne, tv.second});
                    dist[ne][tv.second] = me + 1;
                }
            }
        }
    }
    printf("-1");
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d" ,&a, &b);
         ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:13:9: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
     int st, ed;
         ^~
skyscraper.cpp:29:9: warning: 'ed' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (tv.first == ed) return !printf("%d", dist[tv.first][tv.second]);
         ^~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2432 KB Output is correct
2 Correct 2 ms 2432 KB Output is correct
3 Correct 2 ms 2432 KB Output is correct
4 Correct 1 ms 2432 KB Output is correct
5 Correct 1 ms 2432 KB Output is correct
6 Correct 2 ms 2432 KB Output is correct
7 Correct 2 ms 2432 KB Output is correct
8 Correct 2 ms 2432 KB Output is correct
9 Correct 1 ms 2432 KB Output is correct
10 Correct 2 ms 2432 KB Output is correct
11 Correct 2 ms 2560 KB Output is correct
12 Correct 2 ms 2432 KB Output is correct
13 Correct 2 ms 2432 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 2 ms 2432 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 2 ms 2432 KB Output is correct
19 Correct 2 ms 2432 KB Output is correct
20 Correct 2 ms 2560 KB Output is correct
21 Correct 2 ms 2432 KB Output is correct
22 Correct 2 ms 2432 KB Output is correct
23 Correct 3 ms 2688 KB Output is correct
24 Correct 3 ms 2816 KB Output is correct
25 Correct 2 ms 2560 KB Output is correct
26 Correct 2 ms 2560 KB Output is correct
27 Correct 3 ms 2688 KB Output is correct
28 Correct 7 ms 3456 KB Output is correct
29 Correct 19 ms 5248 KB Output is correct
30 Correct 4 ms 3200 KB Output is correct
31 Correct 8 ms 3968 KB Output is correct
32 Correct 6 ms 3584 KB Output is correct
33 Correct 43 ms 8056 KB Output is correct
34 Correct 20 ms 5504 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2432 KB Output is correct
2 Correct 1 ms 2432 KB Output is correct
3 Correct 1 ms 2432 KB Output is correct
4 Correct 1 ms 2432 KB Output is correct
5 Correct 2 ms 2432 KB Output is correct
6 Correct 2 ms 2432 KB Output is correct
7 Correct 1 ms 2432 KB Output is correct
8 Correct 1 ms 2432 KB Output is correct
9 Correct 1 ms 2432 KB Output is correct
10 Correct 2 ms 2432 KB Output is correct
11 Correct 2 ms 2560 KB Output is correct
12 Correct 2 ms 2432 KB Output is correct
13 Correct 2 ms 2432 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 2 ms 2432 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 2 ms 2432 KB Output is correct
19 Correct 2 ms 2432 KB Output is correct
20 Correct 2 ms 2560 KB Output is correct
21 Correct 2 ms 2432 KB Output is correct
22 Correct 2 ms 2432 KB Output is correct
23 Correct 3 ms 2688 KB Output is correct
24 Correct 3 ms 2816 KB Output is correct
25 Correct 3 ms 2560 KB Output is correct
26 Correct 2 ms 2560 KB Output is correct
27 Correct 3 ms 2688 KB Output is correct
28 Correct 6 ms 3456 KB Output is correct
29 Correct 26 ms 5248 KB Output is correct
30 Correct 5 ms 3200 KB Output is correct
31 Correct 10 ms 3968 KB Output is correct
32 Correct 9 ms 3600 KB Output is correct
33 Correct 63 ms 8056 KB Output is correct
34 Correct 25 ms 5420 KB Output is correct
35 Correct 32 ms 4992 KB Output is correct
36 Correct 4 ms 2628 KB Output is correct
37 Correct 22 ms 4608 KB Output is correct
38 Correct 32 ms 5504 KB Output is correct
39 Correct 10 ms 2688 KB Output is correct
40 Correct 15 ms 3200 KB Output is correct
41 Correct 19 ms 4352 KB Output is correct
42 Correct 8 ms 2688 KB Output is correct
43 Correct 9 ms 3072 KB Output is correct
44 Correct 9 ms 2944 KB Output is correct
45 Correct 289 ms 25208 KB Output is correct
46 Correct 136 ms 15480 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2432 KB Output is correct
2 Correct 1 ms 2432 KB Output is correct
3 Correct 2 ms 2432 KB Output is correct
4 Correct 2 ms 2432 KB Output is correct
5 Correct 2 ms 2432 KB Output is correct
6 Correct 2 ms 2432 KB Output is correct
7 Correct 1 ms 2432 KB Output is correct
8 Correct 2 ms 2432 KB Output is correct
9 Correct 2 ms 2432 KB Output is correct
10 Correct 2 ms 2432 KB Output is correct
11 Correct 2 ms 2560 KB Output is correct
12 Correct 2 ms 2432 KB Output is correct
13 Correct 2 ms 2432 KB Output is correct
14 Correct 5 ms 2688 KB Output is correct
15 Correct 4 ms 2688 KB Output is correct
16 Correct 2 ms 2432 KB Output is correct
17 Correct 4 ms 2688 KB Output is correct
18 Correct 2 ms 2432 KB Output is correct
19 Correct 2 ms 2432 KB Output is correct
20 Correct 2 ms 2560 KB Output is correct
21 Correct 2 ms 2432 KB Output is correct
22 Correct 2 ms 2432 KB Output is correct
23 Correct 3 ms 2688 KB Output is correct
24 Correct 3 ms 2816 KB Output is correct
25 Correct 2 ms 2560 KB Output is correct
26 Correct 3 ms 2560 KB Output is correct
27 Correct 3 ms 2688 KB Output is correct
28 Correct 5 ms 3360 KB Output is correct
29 Correct 17 ms 5248 KB Output is correct
30 Correct 4 ms 3200 KB Output is correct
31 Correct 8 ms 3968 KB Output is correct
32 Correct 6 ms 3584 KB Output is correct
33 Correct 44 ms 8060 KB Output is correct
34 Correct 21 ms 5504 KB Output is correct
35 Correct 20 ms 4992 KB Output is correct
36 Correct 4 ms 2560 KB Output is correct
37 Correct 17 ms 4608 KB Output is correct
38 Correct 22 ms 5500 KB Output is correct
39 Correct 11 ms 2688 KB Output is correct
40 Correct 12 ms 3200 KB Output is correct
41 Correct 15 ms 4392 KB Output is correct
42 Correct 8 ms 2688 KB Output is correct
43 Correct 8 ms 3072 KB Output is correct
44 Correct 9 ms 2944 KB Output is correct
45 Correct 284 ms 25208 KB Output is correct
46 Correct 134 ms 15480 KB Output is correct
47 Correct 14 ms 4224 KB Output is correct
48 Correct 10 ms 2944 KB Output is correct
49 Correct 10 ms 2816 KB Output is correct
50 Correct 7 ms 2816 KB Output is correct
51 Correct 23 ms 5636 KB Output is correct
52 Correct 26 ms 6136 KB Output is correct
53 Correct 15 ms 3328 KB Output is correct
54 Correct 4 ms 3200 KB Output is correct
55 Correct 4 ms 3584 KB Output is correct
56 Correct 18 ms 4736 KB Output is correct
57 Correct 2 ms 2560 KB Output is correct
58 Correct 16 ms 5760 KB Output is correct
59 Correct 19 ms 5248 KB Output is correct
60 Correct 14 ms 5248 KB Output is correct
61 Correct 15 ms 5376 KB Output is correct
62 Correct 189 ms 24312 KB Output is correct
63 Execution timed out 1092 ms 72952 KB Time limit exceeded
64 Halted 0 ms 0 KB -