제출 #1075956

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1075956		alexdd	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	811 ms	3952 KiB

skyscraper

#include<bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int LIM = 0;
int n,m;
int b[30005],p[30005];
set<pair<int,int>> ofrest[LIM+2][LIM+2][2];
int dist[300005];
priority_queue<pair<int,int>> pq;
vector<int> onpoz[30005];
signed main()
{
    cin>>n>>m;
    for(int i=0;i<n;i++)
        dist[i]=INF;
    for(int i=0;i<m;i++)
    {
        cin>>b[i]>>p[i];
        onpoz[b[i]].push_back(i);
    }
    dist[b[0]]=0;
    for(int i=0;i<n;i++)
    {
        for(int j=1;j<=LIM;j++)
        {
            ofrest[j][i%j][0].insert({dist[i]-i/j,i});
            ofrest[j][i%j][1].insert({dist[i]+i/j,i});
        }
    }
    pq.push({0,b[0]});
    while(!pq.empty())
    {
        int cdist = -pq.top().first;
        int poz = pq.top().second;
        pq.pop();
        if(dist[poz]!=cdist)
            continue;
        for(int id:onpoz[poz])
        {
            assert(b[id]==poz);
            if(p[id] > LIM)
            {
                for(int i=1;poz+i*p[id]<n;i++)
                {
                    int cpoz = poz+i*p[id];
                    if(dist[cpoz] > dist[poz]+i)
                    {
                        dist[cpoz] = dist[poz]+i;
                        pq.push({-dist[cpoz],cpoz});
                    }
                }
                for(int i=1;poz-i*p[id]>=0;i++)
                {
                    int cpoz = poz-i*p[id];
                    if(dist[cpoz] > dist[poz]+i)
                    {
                        dist[cpoz] = dist[poz]+i;
                        pq.push({-dist[cpoz],cpoz});
                    }
                }
            }
            else
            {

            }
        }
    }
    if(dist[b[1]]==INF)
        cout<<-1;
    else
        cout<<dist[b[1]];
    return 0;
}

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