제출 #95530

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
95530		MohamedAhmed0	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	0 / 100	2 ms	504 KiB

skyscraper

#include <bits/stdc++.h>

using namespace std;

const int MAX = 2010 ;
int visited[MAX] ;
pair<int , int>arr[MAX] ;
vector< vector<int> >now(MAX) ;

int main()
{
    int n , m ;
    cin>>n>>m ;
    for(int i = 0 ; i < m ; ++i)
    {
        cin>>arr[i].first>>arr[i].second;
        now[arr[i].first].push_back(i);
    }
    priority_queue< pair<int , int> , vector< pair<int , int> > , greater< pair<int , int> > >q ;
    q.push({0 , arr[0].first});
    while(!q.empty())
    {
        pair<int , int>p = q.top() ;
        q.pop() ;
        int dist = p.first , idx = p.second ;
        if(idx == 1)
            return cout<<dist<<"\n" , 0 ;
        if(visited[idx])
            continue;
        visited[idx] = 1 ;
        for(auto &i : now[idx])
        {
            int cnt = 0 ;
            for(int j = idx+arr[i].second ; j < n ; j += arr[i].second)
                cnt++ , q.push({dist+cnt , j});
            cnt = 0 ;
            for(int j = idx - arr[i].second ; j >= 0 ; j -= arr[i].second)
                cnt++ , q.push({dist + cnt , j});
        }
    }
    return cout<<-1<<"\n" , 0 ;
}

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