oj.uz

Submission #678715

# Submission time Handle Problem Language Result Execution time Memory
678715 2023-01-06T12:19:02 Z qwerasdfzxcl Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 87484 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];
set<int> st[30030];
vector<int> a[30030];

struct Vertex{
    int s, p;
    Vertex(){}
    Vertex(int _s, int _p): s(_s), 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());
    }

    stack<Vertex, vector<Vertex>> pq[2];
    pq[0].emplace(s, 0);
    int d = 0;

    while(true){
        if (pq[d&1].empty() && pq[(d+1)&1].empty()) break;
        if (pq[d&1].empty()) {d++; continue;}

        auto [s, p] = pq[d&1].top(); pq[d&1].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[(d+1)&1].emplace(s-p, p);
            if (s+p <= n) pq[(d+1)&1].emplace(s+p, p);
        }

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

    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:40: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
   20 |     Vertex(int _s, int _p): s(_s), p(_p) {}
      |                                        ^
skyscraper.cpp:25:15: note: 's' was declared here
   25 |     int n, m, s, e;
      |               ^
skyscraper.cpp:73:15: warning: 'e' may be used uninitialized in this function [-Wmaybe-uninitialized]
   73 |     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 2428 KB Output is correct
3 Correct 2 ms 2388 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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 ms 2388 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 2424 KB Output is correct
7 Correct 2 ms 2388 KB Output is correct
8 Correct 2 ms 2428 KB Output is correct
9 Correct 2 ms 2388 KB Output is correct
10 Correct 3 ms 2424 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 2440 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 2424 KB Output is correct
3 Correct 1 ms 2424 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 1 ms 2424 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 2428 KB Output is correct
9 Correct 2 ms 2420 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 2 ms 2772 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 1 ms 2388 KB Output is correct
17 Correct 4 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 4 ms 3028 KB Output is correct
25 Correct 3 ms 2772 KB Output is correct
26 Correct 3 ms 2772 KB Output is correct
27 Correct 2 ms 2772 KB Output is correct
28 Correct 5 ms 3540 KB Output is correct
29 Correct 13 ms 5244 KB Output is correct
30 Correct 5 ms 3156 KB Output is correct
31 Correct 6 ms 3924 KB Output is correct
32 Correct 5 ms 3524 KB Output is correct
33 Correct 29 ms 8052 KB Output is correct
34 Correct 30 ms 8032 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 2 ms 2428 KB Output is correct
4 Correct 2 ms 2424 KB Output is correct
5 Correct 2 ms 2416 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 2 ms 2516 KB Output is correct
8 Correct 1 ms 2428 KB Output is correct
9 Correct 1 ms 2388 KB Output is correct
10 Correct 2 ms 2428 KB Output is correct
11 Correct 2 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 2692 KB Output is correct
16 Correct 2 ms 2388 KB Output is correct
17 Correct 5 ms 3212 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 4 ms 3028 KB Output is correct
25 Correct 4 ms 2824 KB Output is correct
26 Correct 3 ms 2772 KB Output is correct
27 Correct 2 ms 2772 KB Output is correct
28 Correct 5 ms 3540 KB Output is correct
29 Correct 12 ms 5332 KB Output is correct
30 Correct 4 ms 3144 KB Output is correct
31 Correct 6 ms 3924 KB Output is correct
32 Correct 5 ms 3584 KB Output is correct
33 Correct 27 ms 8140 KB Output is correct
34 Correct 28 ms 8044 KB Output is correct
35 Correct 35 ms 7880 KB Output is correct
36 Correct 6 ms 3412 KB Output is correct
37 Correct 64 ms 11468 KB Output is correct
38 Correct 65 ms 10944 KB Output is correct
39 Correct 57 ms 10972 KB Output is correct
40 Correct 56 ms 10956 KB Output is correct
41 Correct 54 ms 10948 KB Output is correct
42 Correct 7 ms 3028 KB Output is correct
43 Correct 7 ms 3028 KB Output is correct
44 Correct 7 ms 2900 KB Output is correct
45 Correct 160 ms 26228 KB Output is correct
46 Correct 153 ms 26264 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 1 ms 2388 KB Output is correct
5 Correct 2 ms 2428 KB Output is correct
6 Correct 1 ms 2388 KB Output is correct
7 Correct 1 ms 2388 KB Output is correct
8 Correct 2 ms 2388 KB Output is correct
9 Correct 1 ms 2388 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 2772 KB Output is correct
15 Correct 3 ms 2692 KB Output is correct
16 Correct 2 ms 2388 KB Output is correct
17 Correct 5 ms 3156 KB Output is correct
18 Correct 2 ms 2388 KB Output is correct
19 Correct 2 ms 2428 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 2688 KB Output is correct
24 Correct 4 ms 3028 KB Output is correct
25 Correct 4 ms 2856 KB Output is correct
26 Correct 3 ms 2772 KB Output is correct
27 Correct 2 ms 2772 KB Output is correct
28 Correct 5 ms 3540 KB Output is correct
29 Correct 12 ms 5296 KB Output is correct
30 Correct 4 ms 3192 KB Output is correct
31 Correct 9 ms 3964 KB Output is correct
32 Correct 5 ms 3540 KB Output is correct
33 Correct 29 ms 8068 KB Output is correct
34 Correct 31 ms 8132 KB Output is correct
35 Correct 32 ms 7904 KB Output is correct
36 Correct 6 ms 3412 KB Output is correct
37 Correct 65 ms 11376 KB Output is correct
38 Correct 59 ms 10968 KB Output is correct
39 Correct 54 ms 10988 KB Output is correct
40 Correct 58 ms 10940 KB Output is correct
41 Correct 58 ms 10856 KB Output is correct
42 Correct 7 ms 3148 KB Output is correct
43 Correct 7 ms 3020 KB Output is correct
44 Correct 6 ms 2900 KB Output is correct
45 Correct 165 ms 26300 KB Output is correct
46 Correct 163 ms 26312 KB Output is correct
47 Correct 520 ms 38708 KB Output is correct
48 Correct 8 ms 3208 KB Output is correct
49 Correct 8 ms 3308 KB Output is correct
50 Correct 5 ms 3156 KB Output is correct
51 Correct 127 ms 18756 KB Output is correct
52 Correct 170 ms 20048 KB Output is correct
53 Correct 18 ms 7812 KB Output is correct
54 Correct 2 ms 3284 KB Output is correct
55 Correct 3 ms 3796 KB Output is correct
56 Correct 11 ms 5148 KB Output is correct
57 Correct 139 ms 22964 KB Output is correct
58 Correct 12 ms 5972 KB Output is correct
59 Correct 17 ms 7508 KB Output is correct
60 Correct 29 ms 8708 KB Output is correct
61 Correct 24 ms 8084 KB Output is correct
62 Correct 194 ms 27000 KB Output is correct
63 Execution timed out 1099 ms 87484 KB Time limit exceeded
64 Halted 0 ms 0 KB -