oj.uz

Submission #678613

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

typedef long long ll;
using namespace std;
constexpr int INF = 1e9+100;

struct my_bitset{
    unsigned long long bit[500];
    bool find(int x){return bit[x/64]&(1LL<<(x&63));}
    void insert(int x){bit[x/64] |= (1LL<<(x&63));}
};

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

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 2 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 2 ms 1492 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 4 ms 3924 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 6 ms 8916 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 7 ms 7124 KB Output is correct
24 Correct 8 ms 8532 KB Output is correct
25 Correct 6 ms 8788 KB Output is correct
26 Correct 6 ms 8788 KB Output is correct
27 Correct 5 ms 8872 KB Output is correct
28 Correct 6 ms 8868 KB Output is correct
29 Correct 14 ms 8892 KB Output is correct
30 Correct 7 ms 8788 KB Output is correct
31 Correct 10 ms 8844 KB Output is correct
32 Correct 8 ms 8788 KB Output is correct
33 Correct 23 ms 8976 KB Output is correct
34 Correct 23 ms 8972 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 2 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 2 ms 1492 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 4 ms 3924 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 5 ms 8916 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 5 ms 7124 KB Output is correct
24 Correct 7 ms 8532 KB Output is correct
25 Correct 6 ms 8788 KB Output is correct
26 Correct 6 ms 8788 KB Output is correct
27 Correct 6 ms 8788 KB Output is correct
28 Correct 7 ms 8916 KB Output is correct
29 Correct 14 ms 8880 KB Output is correct
30 Correct 9 ms 8788 KB Output is correct
31 Correct 10 ms 8788 KB Output is correct
32 Correct 8 ms 8788 KB Output is correct
33 Correct 24 ms 8968 KB Output is correct
34 Correct 24 ms 8936 KB Output is correct
35 Correct 23 ms 7248 KB Output is correct
36 Correct 6 ms 5332 KB Output is correct
37 Correct 38 ms 9424 KB Output is correct
38 Correct 36 ms 9820 KB Output is correct
39 Correct 36 ms 9808 KB Output is correct
40 Correct 37 ms 9900 KB Output is correct
41 Correct 36 ms 9824 KB Output is correct
42 Correct 10 ms 9056 KB Output is correct
43 Correct 9 ms 9060 KB Output is correct
44 Correct 10 ms 9096 KB Output is correct
45 Correct 97 ms 9900 KB Output is correct
46 Correct 97 ms 9796 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 2 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1396 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 2 ms 1492 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 4 ms 4036 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 9 ms 8920 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 5 ms 7124 KB Output is correct
24 Correct 7 ms 8532 KB Output is correct
25 Correct 6 ms 8788 KB Output is correct
26 Correct 6 ms 8788 KB Output is correct
27 Correct 5 ms 8788 KB Output is correct
28 Correct 7 ms 8916 KB Output is correct
29 Correct 13 ms 8868 KB Output is correct
30 Correct 7 ms 8788 KB Output is correct
31 Correct 9 ms 8788 KB Output is correct
32 Correct 8 ms 8876 KB Output is correct
33 Correct 24 ms 8936 KB Output is correct
34 Correct 26 ms 8956 KB Output is correct
35 Correct 24 ms 7260 KB Output is correct
36 Correct 6 ms 5332 KB Output is correct
37 Correct 38 ms 9424 KB Output is correct
38 Correct 36 ms 9808 KB Output is correct
39 Correct 36 ms 9936 KB Output is correct
40 Correct 37 ms 9808 KB Output is correct
41 Correct 36 ms 9812 KB Output is correct
42 Correct 9 ms 9044 KB Output is correct
43 Correct 10 ms 9024 KB Output is correct
44 Correct 10 ms 9012 KB Output is correct
45 Correct 97 ms 9820 KB Output is correct
46 Correct 98 ms 9908 KB Output is correct
47 Correct 184 ms 50740 KB Output is correct
48 Correct 7 ms 1620 KB Output is correct
49 Correct 7 ms 1644 KB Output is correct
50 Correct 5 ms 1492 KB Output is correct
51 Correct 139 ms 119544 KB Output is correct
52 Correct 145 ms 119656 KB Output is correct
53 Correct 76 ms 119260 KB Output is correct
54 Correct 32 ms 61392 KB Output is correct
55 Correct 45 ms 80512 KB Output is correct
56 Correct 71 ms 119704 KB Output is correct
57 Correct 151 ms 118736 KB Output is correct
58 Correct 80 ms 119000 KB Output is correct
59 Correct 83 ms 119116 KB Output is correct
60 Correct 92 ms 119068 KB Output is correct
61 Correct 82 ms 119116 KB Output is correct
62 Correct 105 ms 119872 KB Output is correct
63 Correct 617 ms 119736 KB Output is correct
64 Correct 759 ms 119760 KB Output is correct
65 Execution timed out 1086 ms 119868 KB Time limit exceeded
66 Halted 0 ms 0 KB -