oj.uz

Submission #1097790

# Submission time Handle Problem Language Result Execution time Memory
1097790 2024-10-08T09:34:04 Z KasymK Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 328 ms 13768 KB 
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 3e4+5;
const ll INF = 1e18;
set<int> adj[N];
ll dis[N];
 
int main(){
    int n, m, s, t;
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= m; ++i){
        int x, p;
        scanf("%d%d", &x, &p), x++;
        if(i == 1)
            s = x;
        if(i == 2)
            t = x;
        adj[x].insert(p);
    }
    for(int i = 1; i <= n; ++i)
        dis[i] = INF;
    priority_queue<pli, vector<pli>, greater<pli>> pq;
    pq.push({0, s});
    dis[s] = 0;
    while(!pq.empty()){
        pli P = pq.top();
        pq.pop();
        ll val = P.ff;
        int x = P.ss;
        if(dis[x] != val)
            continue;
        for(int p : adj[x]){
            for(int i = 1; x-i*p >= 1; ++i){
                int to = x-i*p;
                if(umin(dis[to], val+i))
                    pq.push({dis[to], to});
            }
            for(int i = 1; x+i*p <= n; ++i){
                int to = x+i*p;
                if(umin(dis[to], val+i))
                    pq.push({dis[to], to});
            }
        }
    }
    int d = -1;
    printf("%lld\n", dis[t]==INF?d:dis[t]);
    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
skyscraper.cpp:25:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |         scanf("%d%d", &x, &p), x++;
      |         ~~~~~^~~~~~~~~~~~~~~~
skyscraper.cpp:36:12: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
   36 |     dis[s] = 0;
      |     ~~~~~~~^~~
skyscraper.cpp:58:27: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
   58 |     printf("%lld\n", dis[t]==INF?d:dis[t]);
      |                      ~~~~~^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1628 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 1 ms 1628 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 1 ms 1880 KB Output is correct
15 Correct 2 ms 1884 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 2 ms 1768 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 3 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 1 ms 1884 KB Output is correct
26 Correct 1 ms 1884 KB Output is correct
27 Correct 1 ms 1884 KB Output is correct
28 Correct 1 ms 1880 KB Output is correct
29 Correct 2 ms 2140 KB Output is correct
30 Correct 1 ms 1884 KB Output is correct
31 Correct 2 ms 2032 KB Output is correct
32 Correct 1 ms 1884 KB Output is correct
33 Correct 5 ms 2528 KB Output is correct
34 Correct 4 ms 2528 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1628 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 1 ms 1628 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 1 ms 1884 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 3 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 1 ms 1884 KB Output is correct
24 Correct 2 ms 1892 KB Output is correct
25 Correct 2 ms 1880 KB Output is correct
26 Correct 2 ms 1884 KB Output is correct
27 Correct 2 ms 1884 KB Output is correct
28 Correct 1 ms 1884 KB Output is correct
29 Correct 3 ms 2140 KB Output is correct
30 Correct 2 ms 1884 KB Output is correct
31 Correct 2 ms 2032 KB Output is correct
32 Correct 1 ms 1884 KB Output is correct
33 Correct 4 ms 2528 KB Output is correct
34 Correct 4 ms 2528 KB Output is correct
35 Correct 9 ms 3152 KB Output is correct
36 Correct 2 ms 2140 KB Output is correct
37 Correct 6 ms 2908 KB Output is correct
38 Correct 14 ms 3420 KB Output is correct
39 Correct 11 ms 3420 KB Output is correct
40 Correct 11 ms 3420 KB Output is correct
41 Correct 12 ms 3392 KB Output is correct
42 Correct 4 ms 1884 KB Output is correct
43 Correct 5 ms 1880 KB Output is correct
44 Correct 6 ms 1884 KB Output is correct
45 Correct 12 ms 3856 KB Output is correct
46 Correct 14 ms 3804 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1624 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 2 ms 1628 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 1 ms 1884 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 3 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 1 ms 1884 KB Output is correct
24 Correct 1 ms 1884 KB Output is correct
25 Correct 2 ms 1884 KB Output is correct
26 Correct 1 ms 1884 KB Output is correct
27 Correct 1 ms 1880 KB Output is correct
28 Correct 1 ms 1884 KB Output is correct
29 Correct 3 ms 2140 KB Output is correct
30 Correct 1 ms 1884 KB Output is correct
31 Correct 2 ms 1884 KB Output is correct
32 Correct 1 ms 1884 KB Output is correct
33 Correct 5 ms 2528 KB Output is correct
34 Correct 4 ms 2528 KB Output is correct
35 Correct 8 ms 2936 KB Output is correct
36 Correct 2 ms 2140 KB Output is correct
37 Correct 7 ms 2900 KB Output is correct
38 Correct 11 ms 3428 KB Output is correct
39 Correct 10 ms 3344 KB Output is correct
40 Correct 14 ms 3504 KB Output is correct
41 Correct 10 ms 3428 KB Output is correct
42 Correct 4 ms 1888 KB Output is correct
43 Correct 4 ms 1892 KB Output is correct
44 Correct 11 ms 1884 KB Output is correct
45 Correct 12 ms 3812 KB Output is correct
46 Correct 12 ms 3812 KB Output is correct
47 Correct 14 ms 4280 KB Output is correct
48 Correct 6 ms 3176 KB Output is correct
49 Correct 5 ms 3164 KB Output is correct
50 Correct 4 ms 2920 KB Output is correct
51 Correct 24 ms 6016 KB Output is correct
52 Correct 21 ms 4824 KB Output is correct
53 Correct 12 ms 4964 KB Output is correct
54 Correct 2 ms 2392 KB Output is correct
55 Correct 2 ms 2396 KB Output is correct
56 Correct 328 ms 4316 KB Output is correct
57 Correct 36 ms 7628 KB Output is correct
58 Correct 6 ms 2520 KB Output is correct
59 Correct 6 ms 2604 KB Output is correct
60 Correct 6 ms 2588 KB Output is correct
61 Correct 8 ms 2776 KB Output is correct
62 Correct 8 ms 3820 KB Output is correct
63 Correct 31 ms 8144 KB Output is correct
64 Correct 33 ms 8656 KB Output is correct
65 Correct 41 ms 8832 KB Output is correct
66 Correct 77 ms 13516 KB Output is correct
67 Correct 77 ms 13768 KB Output is correct