Submission #927160

#	Time	Username	Problem	Language	Result	Execution time	Memory
927160		Amirreza_Fakhri	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	283 ms	62660 KiB

skyscraper

// In the name of the God
#include <bits/stdc++.h>
#define ll long long
// #define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(), (x).end()
using namespace std;
 
const int inf = 1e9+7;
const int mod = 998244353;
const int maxn = 3e4+5;
 
int n, m, s, t, cnt = 0, dist[maxn];
set <int> doge[maxn];
set <pii> st;
 
void dij(int v) {
    fill(dist, dist+n, inf);
    st.insert(mp(0, v));
    while (st.size()) {
        int d = st.begin()->F, u = st.begin()->S;
        st.erase(st.begin());
        if (dist[u] != inf) continue;
        // cout << u << "HHO\n";
        dist[u] = d;
        for (int p : doge[u]) {
            for (int j = 1; u+j*p < n; j++) {
                st.insert(mp(d+j, u+j*p));
                cnt++;
                assert(cnt < 1000*1000);
                // cout << "   " << u+j*p << "QQ\n";
                if (doge[u+j*p].find(p) != doge[u+j*p].end()) break;
            }
            for (int j = 1; u-j*p >= 0; j++) {
                // cout << "   " << u-j*p << "QQ\n";
                st.insert(mp(d+j, u-j*p));
                cnt++;
                assert(cnt < 1000*1000);
                if (doge[u-j*p].find(p) != doge[u-j*p].end()) break;
            }
        }
    }
}
 
int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int a, b; cin >> a >> b;
        doge[a].insert(b);
        if (i == 0) s = a;
        if (i == 1) t = a;
    }
    dij(s);
    cout << (dist[t] == inf ? -1 : dist[t]) << '\n';

    return 0;
}

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