제출 #1024009

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1024009		Muhammet	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	36 / 100	1097 ms	1372 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;

#define N 30005
#define ll long long int
#define sz(x) (int)x.size()
#define ff first
#define ss second

ll T, n, m, b[N], p[N], d[N], vis[N];

int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    cin >> n >> m;

    for(int i = 0; i < m; i++){
        cin >> b[i] >> p[i];
        d[i] = 1e9;
    }
    d[0] = 0;
    int x = 0;
    vis[0] = 1;
    while(1){
        ll mn = 1e9, ind = x;
        for(int i = 0; i < m; i++){
            if(vis[i] == 1) continue;
            int k = (abs(b[i]-b[x]));
            if(d[i] < mn) ind = i;
            mn = min(d[i],mn);
            if(k % p[x] != 0) continue;
            d[i] = min(d[x] + (k/p[x]), d[i]);
            if(d[i] < mn) ind = i;
            mn = min(d[i],mn);
        }
        if(x == ind) break;
        x = ind;
        vis[x] = 1;
    }

    if(d[1] == 1e9) d[1] = -1;
    cout << d[1];

    return 0;
}   

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