제출 #164115

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
164115		muhammad_hokimiyon	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	36 / 100	1091 ms	137660 KiB

skyscraper

#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")

#define fi first
#define se second
#define LL long long

using namespace std;

const int B = 317;
const int N = 3e4 + 7;
const int maxn = 1e5 + 7;
const LL mod = 1e9 + 7;
const LL mod1 = 1e9 + 9;
const int inf = 1e9 + 100;

int n,m;
int a[N];
int b[N];
int d[N];
priority_queue< pair < int , int > > q;
vector < pair < int , int > > v[N];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen( "input.txt" , "r" , stdin );
    //freopen( "output.txt" , "w" , stdout );

    cin >> n >> m;
    set < int > g;
    for( int i = 0; i < m; i++ ){
        cin >> a[i] >> b[i];
        g.insert(a[i]);
    }
    for( int i = 0; i <= n; i++ )d[i] = 1e9;
    for( int i = 0; i < m; i++ ){
        int f = a[i];
        int cnt = 1;
        while( f + b[i] <= n ){
            f += b[i];
            if( g.find(f) != g.end() )v[a[i]].push_back({ f , cnt });
            cnt++;
        }
        f = a[i];
        cnt = 1;
        while( f - b[i] >= 0 ){
            f -= b[i];
            if( g.find(f) != g.end() )v[a[i]].push_back({ f , cnt });
            cnt++;
        }
    }
    d[a[0]] = 0;
    q.push({0 , a[0]});
    while( !q.empty() ){
        int x = q.top().se;
        int f = -q.top().fi;
        q.pop();
        if( f > d[x] )continue;
        for( auto y : v[x] ){
            if( d[x] + y.se < d[y.fi] ){
                d[y.fi] = d[x] + y.se;
                q.push({ -d[y.fi] , y.fi });
            }
        }
    }
    if( d[a[1]] == 1e9 )d[a[1]] = -1;
    cout << d[a[1]];
    //cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}

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