Submission #236678

#	Time	Username	Problem	Language	Result	Execution time	Memory
236678		DS007	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	22 / 100	11 ms	6776 KiB

skyscraper

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

const int N = 30000;
vector<pair<int, int>> adj[N];
int b[N], p[N];
set<int> inv[N];
int n, m;

void solveTestCase() {
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        cin >> b[i] >> p[i];
        inv[b[i]].insert(p[i]);
    }

    for (int i = 0; i < m; i++) {
        for (int j = b[i] - p[i], k = 1; j >= 0; j -= p[i], k++) {
            adj[b[i]].emplace_back(j, k);
            if (inv[j].count(p[i]))
                break;
        }
        for (int j = b[i] + p[i], k = 1; j < n; j += p[i], k++) {
            adj[b[i]].emplace_back(j, k);
            if (inv[j].count(p[i]))
                break;
        }
    }

    int dist[n];
    fill(dist, dist + n, 1e18);
    dist[b[0]] = 0;
    priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(greater<>())> pq;
    pq.push({0, b[0]});
    set<int> done;

    while (!pq.empty()) {
        auto temp = pq.top();
        pq.pop();

        if (done.count(temp.second))
            break;
        done.insert(temp.second);
        assert(temp.first == dist[temp.second] && temp.first != 1e18);

        for (auto i : adj[temp.second]) {
            if (dist[i.first] > temp.first + i.second) {
                dist[i.first] = temp.first + i.second;
                pq.push({dist[i.first], i.first});
            }
        }
    }

    cout << (dist[b[1]] == 1e18 ? -1 : dist[b[1]]);
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int test = 1;
    // cin >> test;
    while (test--)
        solveTestCase();
}

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