Submission #1191938

#	Time	Username	Problem	Language	Result	Execution time	Memory
1191938		user192837	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1092 ms	3600 KiB

skyscraper

#include <bits/stdc++.h>
#define ar array
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;

const int N = 30005;
const ll inf = 1e18;
vector <int> g[N];
vector <ar <ll, 2>> e[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int n, m;
    cin >> n >> m;
    int strt = -1, end = -1;
    for (int i = 0; i < m; i++) {
        int b, p;
        cin >> b >> p;
        if (i == 0)
            strt = b;
        else if (i == 1)
            end = b;
        g[b].push_back(p);
    }
    vector <ll> vis(n, inf);
    vis[strt] = 0;
    queue <int> q; q.push(strt);
    while (!q.empty()) {
        int x = q.front(); q.pop();
        for (int p : g[x]) {
            int y = x, cnt = 1;
            while (y + p < n) {
                if (vis[y + p] > vis[x] + cnt) {
                    vis[y + p] = vis[x] + cnt;
                    q.push(y + p);
                }
                y += p, cnt++;
            }
            y = x, cnt = 1;
            while (y - p >= 0) {
                if (vis[y - p] > vis[x] + cnt) {
                    vis[y - p] = vis[x] + cnt;
                    q.push(y - p);
                }
                y -= p, cnt++;
            }
        }
    }
    if (vis[end] == inf)
        cout << -1;
    else
        cout << vis[end];
}

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