oj.uz

Submission #500336

# Submission time Handle Problem Language Result Execution time Memory
500336 2021-12-30T18:42:54 Z MohamedAhmed04 Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 186 ms 67740 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int main()
{
    int n , m ;
    scanf("%d %d" , &n , &m) ;
    vector< set<int> >v(n+1) ;
    vector< vector< pair<int , int> > >adj(n+1) ;
    int s , e ;
    for(int i = 0 ; i < m ; ++i)
    {
        int a , b ;
        scanf("%d %d" , &a , &b) ;
        if(i == 0)
            s = a ;
        else if(i == 1)
            e = a ;
        v[a].insert(b) ;
    }
    for(int i = 0 ; i < n ; ++i)
    {
        for(auto &power : v[i])
        {
            for(int j = 1 ; ; ++j)
            {
                int here = i+power*j ;
                if(here >= n)
                    break;
                adj[i].push_back({here , j}) ;
                if(v[here].count(power))
                    break;
            }
            for(int j = 1; ; ++j)
            {
                int here = i-power * j ;
                if(here < 0)
                    break;
                adj[i].push_back({here , j}) ;
                if(v[here].count(power))
                    break;
            }
        }
    }
    priority_queue< pair<int , int> , vector< pair<int , int> > , greater< pair<int , int> > >q ;
    q.push({0 , s}) ;
    int dist[n+2] ;
    for(int i = 0 ; i <= n ; ++i)
        dist[i] = 1e9 ;
    dist[s] = 0 ;
    while(!q.empty())
    {
        pair<int , int> p = q.top();
        q.pop();
        int now = p.second , d = p.first ;
        if(now == e)
            return cout<<d<<"\n" , 0 ;
        if(d > dist[now])
            continue;
        for(auto &i : adj[now])
        {
            int to = i.first ;
            int dist2 = d + i.second ;
            if(dist2 < dist[to])
            {
                dist[to] = dist2 ;
                q.push({dist2 , to}) ;
            }
        }
    }
    return cout<<-1<<"\n" , 0 ;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     scanf("%d %d" , &n , &m) ;
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
skyscraper.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d %d" , &a , &b) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~~~
skyscraper.cpp:51:13: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
   51 |     dist[s] = 0 ;
      |     ~~~~~~~~^~~
skyscraper.cpp:57:9: warning: 'e' may be used uninitialized in this function [-Wmaybe-uninitialized]
   57 |         if(now == e)
      |         ^~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 424 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 432 KB Output is correct
15 Correct 2 ms 432 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 428 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 2 ms 588 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 716 KB Output is correct
29 Correct 3 ms 1228 KB Output is correct
30 Correct 1 ms 716 KB Output is correct
31 Correct 2 ms 844 KB Output is correct
32 Correct 2 ms 676 KB Output is correct
33 Correct 7 ms 2020 KB Output is correct
34 Correct 4 ms 1996 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 424 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 292 KB Output is correct
17 Correct 2 ms 592 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 2 ms 588 KB Output is correct
25 Correct 1 ms 588 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 2 ms 716 KB Output is correct
29 Correct 3 ms 1196 KB Output is correct
30 Correct 1 ms 716 KB Output is correct
31 Correct 2 ms 844 KB Output is correct
32 Correct 2 ms 716 KB Output is correct
33 Correct 5 ms 1996 KB Output is correct
34 Correct 5 ms 1996 KB Output is correct
35 Correct 15 ms 2716 KB Output is correct
36 Correct 3 ms 716 KB Output is correct
37 Correct 18 ms 3504 KB Output is correct
38 Correct 21 ms 3908 KB Output is correct
39 Correct 19 ms 3776 KB Output is correct
40 Correct 19 ms 3748 KB Output is correct
41 Correct 19 ms 3752 KB Output is correct
42 Correct 6 ms 632 KB Output is correct
43 Correct 6 ms 716 KB Output is correct
44 Correct 8 ms 792 KB Output is correct
45 Correct 22 ms 6500 KB Output is correct
46 Correct 29 ms 6600 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 292 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 428 KB Output is correct
24 Correct 2 ms 588 KB Output is correct
25 Correct 1 ms 588 KB Output is correct
26 Correct 1 ms 556 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 2 ms 716 KB Output is correct
29 Correct 3 ms 1228 KB Output is correct
30 Correct 1 ms 716 KB Output is correct
31 Correct 2 ms 844 KB Output is correct
32 Correct 1 ms 716 KB Output is correct
33 Correct 5 ms 1996 KB Output is correct
34 Correct 4 ms 1968 KB Output is correct
35 Correct 19 ms 2732 KB Output is correct
36 Correct 3 ms 700 KB Output is correct
37 Correct 19 ms 3524 KB Output is correct
38 Correct 22 ms 3940 KB Output is correct
39 Correct 19 ms 3720 KB Output is correct
40 Correct 23 ms 3756 KB Output is correct
41 Correct 19 ms 3760 KB Output is correct
42 Correct 6 ms 640 KB Output is correct
43 Correct 6 ms 704 KB Output is correct
44 Correct 6 ms 684 KB Output is correct
45 Correct 22 ms 6576 KB Output is correct
46 Correct 20 ms 6492 KB Output is correct
47 Correct 34 ms 11684 KB Output is correct
48 Correct 14 ms 5576 KB Output is correct
49 Correct 12 ms 4812 KB Output is correct
50 Correct 11 ms 4656 KB Output is correct
51 Correct 31 ms 8228 KB Output is correct
52 Correct 28 ms 8656 KB Output is correct
53 Correct 20 ms 5320 KB Output is correct
54 Correct 4 ms 2980 KB Output is correct
55 Correct 6 ms 3356 KB Output is correct
56 Correct 16 ms 5068 KB Output is correct
57 Correct 15 ms 11288 KB Output is correct
58 Correct 9 ms 3684 KB Output is correct
59 Correct 11 ms 4056 KB Output is correct
60 Correct 10 ms 4680 KB Output is correct
61 Correct 11 ms 4128 KB Output is correct
62 Correct 23 ms 9324 KB Output is correct
63 Correct 69 ms 26580 KB Output is correct
64 Correct 72 ms 29404 KB Output is correct
65 Correct 94 ms 39428 KB Output is correct
66 Correct 186 ms 67740 KB Output is correct
67 Correct 148 ms 67656 KB Output is correct