oj.uz

Submission #219981

# Submission time Handle Problem Language Result Execution time Memory
219981 2020-04-06T18:51:29 Z MKopchev Jakarta Skyscrapers (APIO15_skyscraper) C++14
22 / 100
 35 ms 1280 KB 
#include<bits/stdc++.h>
using namespace std;
const int nmax=3e4+42;
int dist[nmax];
vector<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)
{
    int pos=lower_bound(seen[where].begin(),seen[where].end(),val)-seen[where].begin();
    if(pos<seen[where].size()&&seen[where][pos]==val)return 1;
    return 0;
}
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].push_back(p);
    }

    for(int i=0;i<m;i++)
        if(seen[i].size())
        {
            sort(seen[i].begin(),seen[i].end());
            unique(seen[i].begin(),seen[i].end());
        }

    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,current.second))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,current.second))break;
            }
        }
    }
    printf("-1\n");
    return 0;
}

Compilation message

skyscraper.cpp: In function 'bool in(int, int)':
skyscraper.cpp:17:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(pos<seen[where].size()&&seen[where][pos]==val)return 1;
        ~~~^~~~~~~~~~~~~~~~~~~
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]
     scanf("%i%i",&m,&n);
     ~~~~~^~~~~~~~~~~~~~
skyscraper.cpp:29: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 1024 KB Output is correct
2 Correct 5 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1024 KB Output is correct
2 Correct 5 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 5 ms 1024 KB Output is correct
11 Correct 5 ms 1024 KB Output is correct
12 Correct 5 ms 1024 KB Output is correct
13 Correct 6 ms 1024 KB Output is correct
14 Correct 5 ms 1024 KB Output is correct
15 Correct 5 ms 1024 KB Output is correct
16 Correct 6 ms 1024 KB Output is correct
17 Correct 6 ms 1024 KB Output is correct
18 Correct 5 ms 1024 KB Output is correct
19 Correct 6 ms 1024 KB Output is correct
20 Correct 35 ms 1152 KB Output is correct
21 Correct 5 ms 1024 KB Output is correct
22 Correct 5 ms 1024 KB Output is correct
23 Correct 6 ms 1152 KB Output is correct
24 Correct 7 ms 1152 KB Output is correct
25 Correct 6 ms 1024 KB Output is correct
26 Correct 6 ms 1024 KB Output is correct
27 Correct 5 ms 1024 KB Output is correct
28 Incorrect 7 ms 1152 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1024 KB Output is correct
2 Correct 5 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 5 ms 1024 KB Output is correct
11 Correct 5 ms 1024 KB Output is correct
12 Correct 5 ms 1024 KB Output is correct
13 Correct 6 ms 1024 KB Output is correct
14 Correct 6 ms 1024 KB Output is correct
15 Correct 6 ms 1024 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 6 ms 1024 KB Output is correct
18 Correct 5 ms 1024 KB Output is correct
19 Correct 5 ms 1024 KB Output is correct
20 Correct 33 ms 1152 KB Output is correct
21 Correct 5 ms 1056 KB Output is correct
22 Correct 5 ms 1024 KB Output is correct
23 Correct 6 ms 1024 KB Output is correct
24 Correct 6 ms 1152 KB Output is correct
25 Correct 6 ms 1024 KB Output is correct
26 Correct 6 ms 1024 KB Output is correct
27 Correct 5 ms 1056 KB Output is correct
28 Incorrect 6 ms 1152 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1024 KB Output is correct
2 Correct 5 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 5 ms 1024 KB Output is correct
11 Correct 6 ms 1024 KB Output is correct
12 Correct 5 ms 1152 KB Output is correct
13 Correct 6 ms 1024 KB Output is correct
14 Correct 6 ms 1024 KB Output is correct
15 Correct 6 ms 1024 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 6 ms 1280 KB Output is correct
18 Correct 5 ms 1024 KB Output is correct
19 Correct 6 ms 1024 KB Output is correct
20 Correct 34 ms 1152 KB Output is correct
21 Correct 5 ms 1024 KB Output is correct
22 Correct 5 ms 1024 KB Output is correct
23 Correct 6 ms 1024 KB Output is correct
24 Correct 6 ms 1152 KB Output is correct
25 Correct 6 ms 1024 KB Output is correct
26 Correct 6 ms 1024 KB Output is correct
27 Correct 6 ms 1152 KB Output is correct
28 Incorrect 6 ms 1152 KB Output isn't correct
29 Halted 0 ms 0 KB -