oj.uz

Submission #249240

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


char visit[30000];
unordered_map<int,int> dist[30000];
int dp[30000][100]; // 거리 100 이하일 때,
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;
    }

    memset(dp, -1, sizeof(dp));
    queue<pii> q;
    for (int i : v[st]) {
        if (i < 100) dp[st][i] = 0;
        else dist[st][i] = 0;
        q.push({st, i});
    }

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

        int me;
        if (tv.second < 100) me = dp[tv.first][tv.second];
        else me = dist[tv.first][tv.second];

        if (tv.first == ed) return !printf("%d", me);
        int ne;

        if (tv.second < 100) {
            for (int dir = -1; dir <= 1; dir += 2) {
                ne = tv.first + dir * tv.second;
                if (ne < 0 || ne >= n) continue;
                if (dp[ne][tv.second] == -1) {
                    int flag = 0;
                    if (!visit[ne]) {
                        visit[ne] = 1;
                        for (int i : v[ne]) {
                            if (i < 100) dp[ne][i] = me + 1;
                            else dist[ne][i] = me + 1;
                            q.push({ne, i});
                            flag |= i == tv.second;
                        }
                    }
                    if (!flag) {
                        q.push({ne, tv.second});
                        dp[ne][tv.second] = me + 1;
                    }
                }
            }
        }
        else {
            for (int dir = -1; dir <= 1; dir += 2) {
                ne = tv.first + dir * tv.second;
                if (ne < 0 || ne >= n) continue;
                if (dist[ne].find(tv.second) == dist[ne].end()) {
                    int flag = 0;
                    if (!visit[ne]) {
                        visit[ne] = 1;
                        for (int i : v[ne]) {
                            if (i < 100) dp[ne][i] = me + 1;
                            else 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:13: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:18: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:15:9: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
     int st, ed;
         ^~
skyscraper.cpp:40:9: warning: 'ed' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (tv.first == ed) return !printf("%d", me);
         ^~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14464 KB Output is correct
2 Correct 8 ms 14336 KB Output is correct
3 Correct 8 ms 14464 KB Output is correct
4 Correct 8 ms 14464 KB Output is correct
5 Correct 8 ms 14464 KB Output is correct
6 Correct 10 ms 14464 KB Output is correct
7 Correct 7 ms 14464 KB Output is correct
8 Correct 7 ms 14464 KB Output is correct
9 Correct 7 ms 14464 KB Output is correct
10 Correct 8 ms 14464 KB Output is correct
11 Correct 8 ms 14464 KB Output is correct
12 Correct 8 ms 14464 KB Output is correct
13 Correct 10 ms 14464 KB Output is correct
14 Correct 8 ms 14464 KB Output is correct
15 Correct 9 ms 14464 KB Output is correct
16 Correct 10 ms 14464 KB Output is correct
17 Correct 9 ms 14592 KB Output is correct
18 Correct 8 ms 14444 KB Output is correct
19 Correct 7 ms 14464 KB Output is correct
20 Correct 8 ms 14464 KB Output is correct
21 Correct 8 ms 14464 KB Output is correct
22 Correct 8 ms 14464 KB Output is correct
23 Correct 9 ms 14592 KB Output is correct
24 Correct 12 ms 14720 KB Output is correct
25 Correct 8 ms 14464 KB Output is correct
26 Correct 8 ms 14464 KB Output is correct
27 Correct 8 ms 14464 KB Output is correct
28 Correct 10 ms 14848 KB Output is correct
29 Correct 9 ms 14464 KB Output is correct
30 Correct 8 ms 14464 KB Output is correct
31 Correct 9 ms 14464 KB Output is correct
32 Correct 8 ms 14464 KB Output is correct
33 Correct 10 ms 14464 KB Output is correct
34 Correct 9 ms 14464 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14464 KB Output is correct
2 Correct 7 ms 14464 KB Output is correct
3 Correct 7 ms 14464 KB Output is correct
4 Correct 8 ms 14464 KB Output is correct
5 Correct 7 ms 14464 KB Output is correct
6 Correct 7 ms 14464 KB Output is correct
7 Correct 7 ms 14464 KB Output is correct
8 Correct 7 ms 14464 KB Output is correct
9 Correct 7 ms 14464 KB Output is correct
10 Correct 7 ms 14464 KB Output is correct
11 Correct 8 ms 14464 KB Output is correct
12 Correct 8 ms 14464 KB Output is correct
13 Correct 8 ms 14464 KB Output is correct
14 Correct 8 ms 14464 KB Output is correct
15 Correct 8 ms 14464 KB Output is correct
16 Correct 7 ms 14464 KB Output is correct
17 Correct 9 ms 14592 KB Output is correct
18 Correct 8 ms 14464 KB Output is correct
19 Correct 8 ms 14464 KB Output is correct
20 Correct 8 ms 14464 KB Output is correct
21 Correct 8 ms 14464 KB Output is correct
22 Correct 7 ms 14464 KB Output is correct
23 Correct 11 ms 14592 KB Output is correct
24 Correct 9 ms 14720 KB Output is correct
25 Correct 8 ms 14464 KB Output is correct
26 Correct 8 ms 14464 KB Output is correct
27 Correct 8 ms 14464 KB Output is correct
28 Correct 10 ms 14848 KB Output is correct
29 Correct 9 ms 14464 KB Output is correct
30 Correct 8 ms 14464 KB Output is correct
31 Correct 8 ms 14464 KB Output is correct
32 Correct 8 ms 14464 KB Output is correct
33 Correct 10 ms 14464 KB Output is correct
34 Correct 9 ms 14464 KB Output is correct
35 Correct 22 ms 16504 KB Output is correct
36 Correct 9 ms 14592 KB Output is correct
37 Correct 19 ms 16256 KB Output is correct
38 Correct 27 ms 17024 KB Output is correct
39 Correct 23 ms 14720 KB Output is correct
40 Correct 17 ms 15104 KB Output is correct
41 Correct 20 ms 16256 KB Output is correct
42 Correct 19 ms 14600 KB Output is correct
43 Correct 15 ms 14848 KB Output is correct
44 Correct 21 ms 14848 KB Output is correct
45 Correct 107 ms 26748 KB Output is correct
46 Correct 86 ms 24312 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14464 KB Output is correct
2 Correct 8 ms 14464 KB Output is correct
3 Correct 7 ms 14464 KB Output is correct
4 Correct 7 ms 14464 KB Output is correct
5 Correct 10 ms 14464 KB Output is correct
6 Correct 7 ms 14464 KB Output is correct
7 Correct 7 ms 14464 KB Output is correct
8 Correct 7 ms 14464 KB Output is correct
9 Correct 7 ms 14464 KB Output is correct
10 Correct 7 ms 14464 KB Output is correct
11 Correct 8 ms 14456 KB Output is correct
12 Correct 8 ms 14464 KB Output is correct
13 Correct 7 ms 14464 KB Output is correct
14 Correct 8 ms 14464 KB Output is correct
15 Correct 7 ms 14464 KB Output is correct
16 Correct 7 ms 14464 KB Output is correct
17 Correct 9 ms 14592 KB Output is correct
18 Correct 7 ms 14464 KB Output is correct
19 Correct 7 ms 14464 KB Output is correct
20 Correct 8 ms 14464 KB Output is correct
21 Correct 7 ms 14464 KB Output is correct
22 Correct 7 ms 14464 KB Output is correct
23 Correct 8 ms 14592 KB Output is correct
24 Correct 9 ms 14720 KB Output is correct
25 Correct 8 ms 14464 KB Output is correct
26 Correct 8 ms 14464 KB Output is correct
27 Correct 8 ms 14464 KB Output is correct
28 Correct 10 ms 14848 KB Output is correct
29 Correct 9 ms 14464 KB Output is correct
30 Correct 8 ms 14464 KB Output is correct
31 Correct 8 ms 14464 KB Output is correct
32 Correct 8 ms 14464 KB Output is correct
33 Correct 10 ms 14464 KB Output is correct
34 Correct 10 ms 14464 KB Output is correct
35 Correct 22 ms 16512 KB Output is correct
36 Correct 9 ms 14592 KB Output is correct
37 Correct 18 ms 16256 KB Output is correct
38 Correct 26 ms 17016 KB Output is correct
39 Correct 16 ms 14720 KB Output is correct
40 Correct 18 ms 15104 KB Output is correct
41 Correct 21 ms 16384 KB Output is correct
42 Correct 13 ms 14720 KB Output is correct
43 Correct 13 ms 14848 KB Output is correct
44 Correct 14 ms 14848 KB Output is correct
45 Correct 90 ms 26488 KB Output is correct
46 Correct 66 ms 24184 KB Output is correct
47 Correct 21 ms 16128 KB Output is correct
48 Correct 16 ms 14848 KB Output is correct
49 Correct 15 ms 14848 KB Output is correct
50 Correct 13 ms 14748 KB Output is correct
51 Correct 31 ms 17656 KB Output is correct
52 Correct 35 ms 18296 KB Output is correct
53 Correct 20 ms 15360 KB Output is correct
54 Correct 8 ms 14464 KB Output is correct
55 Correct 9 ms 14464 KB Output is correct
56 Correct 20 ms 15360 KB Output is correct
57 Correct 8 ms 14464 KB Output is correct
58 Correct 15 ms 14848 KB Output is correct
59 Correct 16 ms 14720 KB Output is correct
60 Correct 16 ms 14720 KB Output is correct
61 Correct 17 ms 15232 KB Output is correct
62 Correct 116 ms 27000 KB Output is correct
63 Execution timed out 1096 ms 99832 KB Time limit exceeded
64 Halted 0 ms 0 KB -