oj.uz

Submission #1097789

# Submission time Handle Problem Language Result Execution time Memory
1097789 2024-10-08T09:33:17 Z KasymK Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 14 ms 2788 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 = 2e3+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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 544 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 0 ms 576 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 1 ms 776 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 4 ms 1248 KB Output is correct
34 Correct 3 ms 1248 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 540 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 544 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 3 ms 1248 KB Output is correct
34 Correct 3 ms 1248 KB Output is correct
35 Correct 8 ms 2016 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 7 ms 1568 KB Output is correct
38 Correct 9 ms 2348 KB Output is correct
39 Correct 9 ms 2392 KB Output is correct
40 Correct 10 ms 2392 KB Output is correct
41 Correct 9 ms 2396 KB Output is correct
42 Correct 4 ms 604 KB Output is correct
43 Correct 4 ms 604 KB Output is correct
44 Correct 5 ms 860 KB Output is correct
45 Correct 13 ms 2780 KB Output is correct
46 Correct 11 ms 2740 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 412 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 532 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 544 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 1 ms 536 KB Output is correct
31 Correct 1 ms 792 KB Output is correct
32 Correct 1 ms 716 KB Output is correct
33 Correct 3 ms 1248 KB Output is correct
34 Correct 4 ms 1288 KB Output is correct
35 Correct 8 ms 1880 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 7 ms 1812 KB Output is correct
38 Correct 10 ms 2404 KB Output is correct
39 Correct 10 ms 2364 KB Output is correct
40 Correct 10 ms 2396 KB Output is correct
41 Correct 9 ms 2272 KB Output is correct
42 Correct 3 ms 604 KB Output is correct
43 Correct 4 ms 600 KB Output is correct
44 Correct 6 ms 860 KB Output is correct
45 Correct 12 ms 2780 KB Output is correct
46 Correct 14 ms 2788 KB Output is correct
47 Runtime error 1 ms 604 KB Execution killed with signal 11
48 Halted 0 ms 0 KB -