oj.uz

Submission #678607

# Submission time Handle Problem Language Result Execution time Memory
678607 2023-01-06T08:32:25 Z qwerasdfzxcl Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 57480 KB 
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
constexpr int INF = 1e9+100;
int dist[30030], visited[30030];
set<int> st[30030];
vector<int> a[30030];

struct Vertex{
    int s, d, p;
    Vertex(){}
    Vertex(int _s, int _d, int _p): s(_s), d(_d), p(_p) {}
    bool operator < (const Vertex &V) const{return d > V.d;}
};

int main(){
    int n, m, s, e;
    scanf("%d %d", &n, &m);
    for (int i=1;i<=m;i++){
        int x, p;
        scanf("%d %d", &x, &p);
        ++x;

        a[x].push_back(p);

        if (i==1) s = x;
        if (i==2) e = x;
    }

    fill(dist+1, dist+n+1, INF);
    fill(visited+1, visited+n+1, 0);
    dist[s] = 0;
    for (int i=1;i<=n;i++){
        sort(a[i].begin(), a[i].end());
        a[i].erase(unique(a[i].begin(), a[i].end()), a[i].end());
    }

    priority_queue<Vertex> pq;
    pq.emplace(s, 0, 0);

    while(!pq.empty()){
        auto [s, d, p] = pq.top(); pq.pop();
        dist[s] = min(dist[s], d);
        if (p){
            if (st[s].find(p)!=st[s].end()) continue;
            st[s].insert(p);
            if (s-p > 0) pq.emplace(s-p, d+1, p);
            if (s+p <= n) pq.emplace(s+p, d+1, p);
        }

        if (!visited[s]){
            visited[s] = 1;
            for (auto &p2:a[s]){
                st[s].insert(p2);
                if (s-p2 > 0) pq.emplace(s-p2, d+1, p2);
                if (s+p2 <= n) pq.emplace(s+p2, d+1, p2);
            }
        }
    }

    /*for (int z=1;z<=n;z++){
        int mn = INF, idx = -1;
        for (int i=1;i<=n;i++) if (!visited[i] && mn > dist[i]){
            mn = dist[i];
            idx = i;
        }
        if (idx==-1) break;
        visited[idx] = 1;

        for (auto &p:a[idx]){
            for (int i=idx-p, j=1;i>0;i-=p, j++) dist[i] = min(dist[i], dist[idx] + j);
            for (int i=idx+p, j=1;i<=n;i+=p, j++) dist[i] = min(dist[i], dist[idx] + j);
        }
    }*/

    if (dist[e]==INF) printf("-1\n");
    else printf("%d\n", dist[e]);
    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     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]
   22 |         scanf("%d %d", &x, &p);
      |         ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:13:55: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
   13 |     Vertex(int _s, int _d, int _p): s(_s), d(_d), p(_p) {}
      |                                                       ^
skyscraper.cpp:18:15: note: 's' was declared here
   18 |     int n, m, s, e;
      |               ^
skyscraper.cpp:77:15: warning: 'e' may be used uninitialized in this function [-Wmaybe-uninitialized]
   77 |     if (dist[e]==INF) printf("-1\n");
      |         ~~~~~~^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 1 ms 2428 KB Output is correct
3 Correct 2 ms 2420 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 2 ms 2388 KB Output is correct
6 Correct 1 ms 2388 KB Output is correct
7 Correct 2 ms 2428 KB Output is correct
8 Correct 1 ms 2388 KB Output is correct
9 Correct 1 ms 2428 KB Output is correct
10 Correct 2 ms 2516 KB Output is correct
11 Correct 3 ms 2644 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 2 ms 2388 KB Output is correct
14 Correct 3 ms 2696 KB Output is correct
15 Correct 3 ms 2772 KB Output is correct
16 Correct 2 ms 2432 KB Output is correct
17 Correct 6 ms 3156 KB Output is correct
18 Correct 2 ms 2388 KB Output is correct
19 Correct 1 ms 2388 KB Output is correct
20 Correct 2 ms 2516 KB Output is correct
21 Correct 2 ms 2388 KB Output is correct
22 Correct 2 ms 2388 KB Output is correct
23 Correct 3 ms 2772 KB Output is correct
24 Correct 5 ms 3016 KB Output is correct
25 Correct 3 ms 2820 KB Output is correct
26 Correct 3 ms 2772 KB Output is correct
27 Correct 3 ms 2692 KB Output is correct
28 Correct 6 ms 3540 KB Output is correct
29 Correct 23 ms 5328 KB Output is correct
30 Correct 5 ms 3156 KB Output is correct
31 Correct 12 ms 3960 KB Output is correct
32 Correct 10 ms 3540 KB Output is correct
33 Correct 54 ms 8116 KB Output is correct
34 Correct 54 ms 8072 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 3 ms 2396 KB Output is correct
4 Correct 2 ms 2388 KB Output is correct
5 Correct 1 ms 2388 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 2 ms 2388 KB Output is correct
8 Correct 2 ms 2388 KB Output is correct
9 Correct 2 ms 2388 KB Output is correct
10 Correct 2 ms 2400 KB Output is correct
11 Correct 5 ms 2564 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 2 ms 2436 KB Output is correct
14 Correct 3 ms 2772 KB Output is correct
15 Correct 5 ms 2772 KB Output is correct
16 Correct 2 ms 2432 KB Output is correct
17 Correct 6 ms 3156 KB Output is correct
18 Correct 2 ms 2388 KB Output is correct
19 Correct 2 ms 2388 KB Output is correct
20 Correct 2 ms 2516 KB Output is correct
21 Correct 2 ms 2388 KB Output is correct
22 Correct 2 ms 2388 KB Output is correct
23 Correct 3 ms 2692 KB Output is correct
24 Correct 6 ms 3028 KB Output is correct
25 Correct 4 ms 2828 KB Output is correct
26 Correct 3 ms 2772 KB Output is correct
27 Correct 3 ms 2696 KB Output is correct
28 Correct 7 ms 3540 KB Output is correct
29 Correct 24 ms 5276 KB Output is correct
30 Correct 6 ms 3200 KB Output is correct
31 Correct 24 ms 3924 KB Output is correct
32 Correct 9 ms 3540 KB Output is correct
33 Correct 53 ms 8024 KB Output is correct
34 Correct 59 ms 8012 KB Output is correct
35 Correct 49 ms 7844 KB Output is correct
36 Correct 7 ms 3284 KB Output is correct
37 Correct 103 ms 11276 KB Output is correct
38 Correct 96 ms 10868 KB Output is correct
39 Correct 92 ms 10884 KB Output is correct
40 Correct 103 ms 10808 KB Output is correct
41 Correct 97 ms 10840 KB Output is correct
42 Correct 8 ms 3076 KB Output is correct
43 Correct 7 ms 3028 KB Output is correct
44 Correct 7 ms 2900 KB Output is correct
45 Correct 359 ms 26060 KB Output is correct
46 Correct 331 ms 26024 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 2 ms 2388 KB Output is correct
4 Correct 2 ms 2428 KB Output is correct
5 Correct 2 ms 2388 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 1 ms 2424 KB Output is correct
8 Correct 2 ms 2432 KB Output is correct
9 Correct 2 ms 2428 KB Output is correct
10 Correct 2 ms 2516 KB Output is correct
11 Correct 3 ms 2644 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 2 ms 2388 KB Output is correct
14 Correct 4 ms 2772 KB Output is correct
15 Correct 3 ms 2772 KB Output is correct
16 Correct 2 ms 2388 KB Output is correct
17 Correct 6 ms 3156 KB Output is correct
18 Correct 2 ms 2388 KB Output is correct
19 Correct 2 ms 2388 KB Output is correct
20 Correct 2 ms 2516 KB Output is correct
21 Correct 2 ms 2388 KB Output is correct
22 Correct 2 ms 2388 KB Output is correct
23 Correct 3 ms 2772 KB Output is correct
24 Correct 6 ms 3028 KB Output is correct
25 Correct 3 ms 2824 KB Output is correct
26 Correct 3 ms 2816 KB Output is correct
27 Correct 3 ms 2772 KB Output is correct
28 Correct 6 ms 3592 KB Output is correct
29 Correct 23 ms 5288 KB Output is correct
30 Correct 7 ms 3244 KB Output is correct
31 Correct 12 ms 3924 KB Output is correct
32 Correct 11 ms 3496 KB Output is correct
33 Correct 56 ms 8028 KB Output is correct
34 Correct 59 ms 8040 KB Output is correct
35 Correct 50 ms 7848 KB Output is correct
36 Correct 7 ms 3284 KB Output is correct
37 Correct 99 ms 11212 KB Output is correct
38 Correct 109 ms 10876 KB Output is correct
39 Correct 87 ms 10852 KB Output is correct
40 Correct 89 ms 10884 KB Output is correct
41 Correct 96 ms 10824 KB Output is correct
42 Correct 9 ms 3088 KB Output is correct
43 Correct 9 ms 3084 KB Output is correct
44 Correct 7 ms 2900 KB Output is correct
45 Correct 351 ms 26116 KB Output is correct
46 Correct 343 ms 26024 KB Output is correct
47 Correct 816 ms 38496 KB Output is correct
48 Correct 8 ms 3284 KB Output is correct
49 Correct 9 ms 3296 KB Output is correct
50 Correct 6 ms 3104 KB Output is correct
51 Correct 215 ms 18576 KB Output is correct
52 Correct 204 ms 19964 KB Output is correct
53 Correct 27 ms 7696 KB Output is correct
54 Correct 3 ms 3284 KB Output is correct
55 Correct 4 ms 3836 KB Output is correct
56 Correct 14 ms 5152 KB Output is correct
57 Correct 244 ms 22980 KB Output is correct
58 Correct 14 ms 5972 KB Output is correct
59 Correct 25 ms 7524 KB Output is correct
60 Correct 30 ms 8796 KB Output is correct
61 Correct 29 ms 8056 KB Output is correct
62 Correct 209 ms 26968 KB Output is correct
63 Execution timed out 1096 ms 57480 KB Time limit exceeded
64 Halted 0 ms 0 KB -