Submission #42132

#	Time	Username	Problem	Language	Result	Execution time	Memory
42132		XmtosX	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	1075 ms	3428 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;
int n,p[30004],b[30004],m;
priority_queue <pair<int,int> ,vector <pair<int,int> >,greater <pair<int,int> > > pq;
bool vis[30004];
vector <int> v[30004];
int cur[30004];
void dij()
{
    for (int i=0;i<n;i++)
        cur[i]=INT_MAX;
    cur[b[0]]=0;
    pq.push({0,b[0]});
    while (!pq.empty())
    {
        int x= (pq.top()).second;
        int y= (pq.top()).first;
        pq.pop();
        if (vis[x])
            continue;
        vis[x]=true;
        for (int i=0;i<v[x].size();i++)
        {
            for (int j=0;j*v[x][i]+x<n;j++)
            {
                int a= (j*v[x][i]+x);
                if (cur[a]>y+j)
                {
                    cur[a]=y+j;
                    pq.push({cur[a],a});
                }
            }
            for (int j=1;x-j*v[x][i]>=0;j++)
            {
                int a= (x-j*v[x][i]);
                if (cur[a]>y+j)
                {
                    cur[a]=y+j;
                    pq.push({cur[a],a});
                }
            }
        }
    }
}
int main()
{
    cin >>n>>m;
    for (int i=0;i<m;i++)
    {
        cin >>b[i]>>p[i];
        v[b[i]].push_back(p[i]);
    }
    for (int i=0;i<n;i++)
    {
        sort(v[i].begin(),v[i].end());
        reverse(v[i].begin(),v[i].end());
    }
    dij();
    if (!vis[b[1]])
        cout <<-1;
    else
        cout <<cur[b[1]];
    return 0;
}

Compilation message (stderr)

skyscraper.cpp: In function 'void dij()':
skyscraper.cpp:22:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=0;i<v[x].size();i++)
                       ^

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 14 / 14
• Subtask 4: 21 / 21
• Subtask 5: 0 / 43