oj.uz

Submission #249218

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

// last를 기록하고. 이게 갱신되면 그것에 의한 갱신을 해줘야함.
// 원래 여기에 속해 있던 애는 바로 이용할 수 있음...
// 원래 있던 애 리스트...

int md[30000];
char visit[30000];
unordered_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();
        // printf("%d %d\n", tv.first, tv.second);

        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});
                        if (i==tv.second) flag = 1;
                    }
                }
                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});
                        if (i==tv.second) flag = 1;
                    }
                }
                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:17: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:22: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:19:9: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
     int st, ed;
         ^~
skyscraper.cpp:36: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 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 1 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2816 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 2 ms 2688 KB Output is correct
9 Correct 2 ms 2688 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 3 ms 2944 KB Output is correct
15 Correct 2 ms 2816 KB Output is correct
16 Correct 2 ms 2688 KB Output is correct
17 Correct 4 ms 2944 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 2 ms 2688 KB Output is correct
20 Correct 3 ms 2816 KB Output is correct
21 Correct 2 ms 2688 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 4 ms 2944 KB Output is correct
24 Correct 4 ms 3072 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 3 ms 2816 KB Output is correct
27 Correct 3 ms 2944 KB Output is correct
28 Correct 6 ms 3584 KB Output is correct
29 Correct 13 ms 5248 KB Output is correct
30 Correct 5 ms 3456 KB Output is correct
31 Correct 8 ms 4224 KB Output is correct
32 Correct 6 ms 3712 KB Output is correct
33 Correct 27 ms 7804 KB Output is correct
34 Correct 14 ms 5504 KB Output is correct
35 Correct 17 ms 5120 KB Output is correct
36 Correct 4 ms 2816 KB Output is correct
37 Correct 22 ms 4856 KB Output is correct
38 Correct 21 ms 5760 KB Output is correct
39 Correct 17 ms 3200 KB Output is correct
40 Correct 13 ms 3712 KB Output is correct
41 Correct 16 ms 4864 KB Output is correct
42 Correct 13 ms 3200 KB Output is correct
43 Correct 9 ms 3456 KB Output is correct
44 Correct 15 ms 3456 KB Output is correct
45 Correct 196 ms 23544 KB Output is correct
46 Correct 71 ms 14968 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 1 ms 2688 KB Output is correct
8 Correct 2 ms 2688 KB Output is correct
9 Correct 2 ms 2688 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 3 ms 2944 KB Output is correct
15 Correct 3 ms 2816 KB Output is correct
16 Correct 2 ms 2688 KB Output is correct
17 Correct 3 ms 2944 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 2 ms 2688 KB Output is correct
20 Correct 3 ms 2816 KB Output is correct
21 Correct 2 ms 2688 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 3 ms 2944 KB Output is correct
24 Correct 4 ms 3072 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 2 ms 2816 KB Output is correct
27 Correct 3 ms 2944 KB Output is correct
28 Correct 6 ms 3584 KB Output is correct
29 Correct 12 ms 5248 KB Output is correct
30 Correct 5 ms 3456 KB Output is correct
31 Correct 9 ms 4352 KB Output is correct
32 Correct 6 ms 3712 KB Output is correct
33 Correct 26 ms 7716 KB Output is correct
34 Correct 13 ms 5504 KB Output is correct
35 Correct 18 ms 5120 KB Output is correct
36 Correct 4 ms 2816 KB Output is correct
37 Correct 14 ms 4908 KB Output is correct
38 Correct 20 ms 5756 KB Output is correct
39 Correct 11 ms 3200 KB Output is correct
40 Correct 14 ms 3712 KB Output is correct
41 Correct 15 ms 4864 KB Output is correct
42 Correct 8 ms 3200 KB Output is correct
43 Correct 9 ms 3456 KB Output is correct
44 Correct 11 ms 3456 KB Output is correct
45 Correct 150 ms 23544 KB Output is correct
46 Correct 73 ms 14968 KB Output is correct
47 Correct 15 ms 4736 KB Output is correct
48 Correct 10 ms 3328 KB Output is correct
49 Correct 10 ms 3328 KB Output is correct
50 Correct 7 ms 3200 KB Output is correct
51 Correct 31 ms 6264 KB Output is correct
52 Correct 29 ms 6904 KB Output is correct
53 Correct 13 ms 3968 KB Output is correct
54 Correct 4 ms 3584 KB Output is correct
55 Correct 6 ms 4096 KB Output is correct
56 Correct 20 ms 5752 KB Output is correct
57 Correct 3 ms 2740 KB Output is correct
58 Correct 21 ms 6272 KB Output is correct
59 Correct 19 ms 6016 KB Output is correct
60 Correct 19 ms 6008 KB Output is correct
61 Correct 21 ms 6144 KB Output is correct
62 Correct 200 ms 23840 KB Output is correct
63 Execution timed out 1088 ms 84180 KB Time limit exceeded
64 Halted 0 ms 0 KB -