제출 #602505

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
602505		snasibov05	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	10 / 100	1 ms	340 KiB

skyscraper

#include <bits/stdc++.h>

using namespace std;

#define oo 1000000000

int main() {
    int n, m; cin >> n >> m;
    vector<int> b(m), p(m);
    for (int i = 0; i < m; ++i) cin >> b[i] >> p[i];

    vector<bool> exists(n);
    for (int i = 0; i < m; ++i) exists[b[i]] = true;

    vector<vector<int>> ed(n, vector<int>(n, oo));
    for (int i = 0; i < m; ++i){
        int cnt = 0;
        for (int j = b[i] + p[i]; j < n; j += p[i]) {
            cnt++;
            if (exists[j]) ed[b[i]][j] = min(ed[b[i]][j], cnt);
        }
        for (int j = b[i] - p[i]; j >= 0; j -= p[i]){
            cnt++;
            if (exists[j]) ed[b[i]][j] = min(ed[b[i]][j], cnt);
        }
    }

    vector<int> d(n, oo); d[b[0]] = 0;
    vector<bool> visited(n);
    for (int i = 0; i < n; ++i){
        int mn = -1;
        for (int j = 0; j < n; ++j){
            if (!visited[j] && (mn == -1 || d[mn] > d[j])) mn = j;
        }

        visited[mn] = true;
        for (int j = 0; j < n; ++j){
            if (visited[j]) continue;
            if (d[j] > d[mn] + ed[mn][j]) d[j] = d[mn] + ed[mn][j];
        }
    }

    int ans = d[b[1]];
    if (ans == oo) ans = -1;
    cout << ans << "\n";

    return 0;
}

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