Submission #1269640

#	Time	Username	Problem	Language	Result	Execution time	Memory
1269640		CodeLakVN	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	172 ms	71720 KiB

skyscraper

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

#define task "main"
#define F first
#define S second
#define ii pair<int, int>
#define il pair<int, long long>
#define li pair<long long, int>
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

const int MAX_N = (int)3e4 + 4;
const long long INF = (long long)1e18;

int nNode, nDog;
set<int> hihi[MAX_N];
vector<ii> adj[MAX_N];

long long dist[MAX_N];

void dijkstra(int s) {
    memset(dist, 0x3f, sizeof(dist));
    dist[s] = 0;
    priority_queue<li, vector<li>, greater<li>> pq;
    pq.push({0, s});
    while (!pq.empty()) {
        li t = pq.top();
        pq.pop();
        int u = t.S;
        if (dist[u] != t.F) continue;
        for (ii e : adj[u]) {
            int v = e.F, w = e.S;
            if (minimize(dist[v], dist[u] + w))
                pq.push({dist[v], v});
        }
    }
}

void solve() {
    cin >> nNode >> nDog;
    int s = -1, e = -1;
    FOR(i, 0, nDog - 1) {
        int pos, r;
        cin >> pos >> r;
        if (i == 0) s = pos;
        else if (i == 1) e = pos;

        hihi[pos].insert(r);
    }

    FOR(i, 0, nNode - 1) {
        for (int j : hihi[i]) {
            FOR(k, 1, (nNode - 1 - i) / j) {
                int nxt = i + k * j;
                adj[i].push_back({nxt, k});
                if (hihi[nxt].count(j)) break;
            }
            FOR(k, 1, i / j) {
                int nxt = i - k * j;
                if (nxt < 0) break;
                adj[i].push_back({nxt, k});
                if (hihi[nxt].count(j)) break;
            }
        }
    }

    memset(dist, 0x3f, sizeof(dist));
    dist[s] = 0;
    priority_queue<li, vector<li>, greater<li>> pq;
    pq.push({0, s});
    while (!pq.empty()) {
        li t = pq.top();
        pq.pop();
        int u = t.S;
        if (dist[u] != t.F) continue;

        if (u == e) {
            cout << dist[u];
            return;
        }

        for (ii e : adj[u]) {
            int v = e.F, w = e.S;
            if (minimize(dist[v], dist[u] + w))
                pq.push({dist[v], v});
        }
    }

    cout << -1;
}

int32_t main() {
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    bool multitest = 0;
    int numTest = 1;
    if (multitest) cin >> numTest;

    while (numTest--) {
        solve();
    }

    return 0;
}

/* Lak lu theo dieu nhac!!!! */

Compilation message (stderr)

skyscraper.cpp: In function 'int32_t main()':
skyscraper.cpp:113:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:114:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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