oj.uz

Submission #219991

# Submission time Handle Problem Language Result Execution time Memory
219991 2020-04-06T19:03:48 Z MKopchev Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 110 ms 5624 KB 
#include<bits/stdc++.h>
using namespace std;
const int nmax=3e4+42;
int dist[nmax];
set<int> seen[nmax];

int m,n;

int wanted;
bool been[nmax];

priority_queue< pair<int/*dist*/,int/*node*/> > pq;

bool in(int where,int val)
{
    return seen[where].count(val);
}
int main()
{
    scanf("%i%i",&m,&n);

    for(int i=0;i<m;i++)dist[i]=1e9;

    int b,p;
    for(int i=0;i<n;i++)
    {
        scanf("%i%i",&b,&p);
        if(i==0){dist[b]=0;pq.push({0,b});}
        if(i==1)wanted=b;
        seen[b].insert(p);
    }

    while(pq.size())
    {
        pair<int/*dist*/,int/*node*/> current=pq.top();
        pq.pop();

        if(been[current.second])continue;
        been[current.second]=1;

        current.first=-current.first;

        if(current.second==wanted)
        {
            printf("%i\n",current.first);
            exit(0);
        }

        for(auto dog:seen[current.second])
        {
            for(int i=current.second+dog;i<m;i+=dog)
            {
                int dist_now=current.first+(i-current.second)/dog;
                if(dist[i]>dist_now)
                {
                    dist[i]=dist_now;
                    pq.push({-dist_now,i});
                }

                if(in(i,dog))break;
            }

            for(int i=current.second-dog;i>=0;i-=dog)
            {
                int dist_now=current.first+(current.second-i)/dog;
                if(dist[i]>dist_now)
                {
                    dist[i]=dist_now;
                    pq.push({-dist_now,i});
                }

                if(in(i,dog))break;
            }
        }
    }
    printf("-1\n");
    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i%i",&m,&n);
     ~~~~~^~~~~~~~~~~~~~
skyscraper.cpp:27:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i",&b,&p);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1792 KB Output is correct
2 Correct 5 ms 1792 KB Output is correct
3 Correct 5 ms 1792 KB Output is correct
4 Correct 5 ms 1664 KB Output is correct
5 Correct 5 ms 1792 KB Output is correct
6 Correct 5 ms 1792 KB Output is correct
7 Correct 5 ms 1792 KB Output is correct
8 Correct 5 ms 1792 KB Output is correct
9 Correct 6 ms 1792 KB Output is correct
10 Correct 6 ms 1792 KB Output is correct
11 Correct 6 ms 1792 KB Output is correct
12 Correct 5 ms 1792 KB Output is correct
13 Correct 6 ms 1792 KB Output is correct
14 Correct 6 ms 1920 KB Output is correct
15 Correct 6 ms 1792 KB Output is correct
16 Correct 6 ms 1792 KB Output is correct
17 Correct 6 ms 1792 KB Output is correct
18 Correct 6 ms 1792 KB Output is correct
19 Correct 5 ms 1792 KB Output is correct
20 Correct 6 ms 1920 KB Output is correct
21 Correct 6 ms 1792 KB Output is correct
22 Correct 5 ms 1792 KB Output is correct
23 Correct 6 ms 1792 KB Output is correct
24 Correct 7 ms 1920 KB Output is correct
25 Correct 6 ms 1920 KB Output is correct
26 Correct 6 ms 1792 KB Output is correct
27 Correct 6 ms 1792 KB Output is correct
28 Correct 6 ms 1920 KB Output is correct
29 Correct 7 ms 1920 KB Output is correct
30 Correct 6 ms 1792 KB Output is correct
31 Correct 6 ms 1920 KB Output is correct
32 Correct 7 ms 2048 KB Output is correct
33 Correct 8 ms 2048 KB Output is correct
34 Correct 8 ms 2048 KB Output is correct
35 Correct 20 ms 3200 KB Output is correct
36 Correct 7 ms 2048 KB Output is correct
37 Correct 16 ms 2944 KB Output is correct
38 Correct 26 ms 3448 KB Output is correct
39 Correct 18 ms 3456 KB Output is correct
40 Correct 20 ms 3584 KB Output is correct
41 Correct 27 ms 3456 KB Output is correct
42 Correct 11 ms 2048 KB Output is correct
43 Correct 12 ms 2048 KB Output is correct
44 Correct 11 ms 2048 KB Output is correct
45 Correct 24 ms 3648 KB Output is correct
46 Correct 23 ms 3584 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1792 KB Output is correct
2 Correct 5 ms 1792 KB Output is correct
3 Correct 5 ms 1792 KB Output is correct
4 Correct 5 ms 1792 KB Output is correct
5 Correct 6 ms 1792 KB Output is correct
6 Correct 5 ms 1792 KB Output is correct
7 Correct 5 ms 1664 KB Output is correct
8 Correct 5 ms 1792 KB Output is correct
9 Correct 5 ms 1792 KB Output is correct
10 Correct 5 ms 1792 KB Output is correct
11 Correct 6 ms 1792 KB Output is correct
12 Correct 5 ms 1792 KB Output is correct
13 Correct 6 ms 1792 KB Output is correct
14 Correct 6 ms 1920 KB Output is correct
15 Correct 7 ms 1792 KB Output is correct
16 Correct 5 ms 1792 KB Output is correct
17 Correct 6 ms 1792 KB Output is correct
18 Correct 6 ms 1792 KB Output is correct
19 Correct 5 ms 1792 KB Output is correct
20 Correct 6 ms 1920 KB Output is correct
21 Correct 6 ms 1792 KB Output is correct
22 Correct 5 ms 1792 KB Output is correct
23 Correct 6 ms 1792 KB Output is correct
24 Correct 7 ms 1920 KB Output is correct
25 Correct 6 ms 1920 KB Output is correct
26 Correct 6 ms 1792 KB Output is correct
27 Correct 6 ms 1920 KB Output is correct
28 Correct 6 ms 1920 KB Output is correct
29 Correct 7 ms 1920 KB Output is correct
30 Correct 6 ms 1792 KB Output is correct
31 Correct 6 ms 1920 KB Output is correct
32 Correct 6 ms 1920 KB Output is correct
33 Correct 8 ms 2048 KB Output is correct
34 Correct 8 ms 2048 KB Output is correct
35 Correct 20 ms 3200 KB Output is correct
36 Correct 7 ms 2048 KB Output is correct
37 Correct 19 ms 2944 KB Output is correct
38 Correct 24 ms 3456 KB Output is correct
39 Correct 19 ms 3448 KB Output is correct
40 Correct 19 ms 3584 KB Output is correct
41 Correct 25 ms 3456 KB Output is correct
42 Correct 11 ms 1920 KB Output is correct
43 Correct 11 ms 1920 KB Output is correct
44 Correct 11 ms 2048 KB Output is correct
45 Correct 24 ms 3584 KB Output is correct
46 Correct 23 ms 3584 KB Output is correct
47 Correct 20 ms 3584 KB Output is correct
48 Correct 14 ms 3072 KB Output is correct
49 Correct 14 ms 3072 KB Output is correct
50 Correct 11 ms 2688 KB Output is correct
51 Correct 27 ms 4192 KB Output is correct
52 Correct 29 ms 4224 KB Output is correct
53 Correct 18 ms 3712 KB Output is correct
54 Correct 7 ms 2176 KB Output is correct
55 Correct 7 ms 2176 KB Output is correct
56 Correct 16 ms 3456 KB Output is correct
57 Correct 7 ms 2432 KB Output is correct
58 Correct 15 ms 2184 KB Output is correct
59 Correct 14 ms 2304 KB Output is correct
60 Correct 14 ms 2304 KB Output is correct
61 Correct 14 ms 2560 KB Output is correct
62 Correct 20 ms 3584 KB Output is correct
63 Correct 50 ms 4604 KB Output is correct
64 Correct 52 ms 4604 KB Output is correct
65 Correct 63 ms 4604 KB Output is correct
66 Correct 110 ms 5624 KB Output is correct
67 Correct 89 ms 5624 KB Output is correct