Submission #1100457

#	Time	Username	Problem	Language	Result	Execution time	Memory
1100457		Whisper	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	708 ms	14528 KiB

skyscraper

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX                     30005
int numHouse, numDoge;
set<int> G[MAX];
int pos[MAX], power[MAX], minDist[MAX];
void process(void){
    int from, to;
    cin >> numHouse >> numDoge;
    for (int i = 1; i <= numDoge; ++i){
        cin >> pos[i] >> power[i];
        ++pos[i];
        G[pos[i]].insert(power[i]);
        if(i == 1){
            from = pos[i];
        }
        if(i == 2){
            to = pos[i];
        }
    }

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;

    memset(minDist, 0x3f, sizeof minDist);

    q.emplace(0, from);
    minDist[from] = 0;
    while(q.size()){
        int du, u; tie(du, u) = q.top(); q.pop();
        if(du > minDist[u]) continue;

        for (auto&v : G[u]){
            for (int i = 1; u + v * i <= numHouse; ++i){
                if(minimize(minDist[u + v * i], minDist[u] + i)){
                    q.emplace(minDist[u + v * i], u + v * i);
                }
            }
            for (int i = -1; u + v * i >= 1; --i){
                if(minimize(minDist[u + v * i], minDist[u] - i)){
                    q.emplace(minDist[u + v * i], u + v * i);
                }
            }
        }
    }
    cout << (minDist[to] >= LINF ? -1 : minDist[to]);
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Compilation message (stderr)

skyscraper.cpp: In function 'void process()':
skyscraper.cpp:62:19: warning: 'from' may be used uninitialized in this function [-Wmaybe-uninitialized]
   62 |     minDist[from] = 0;
      |     ~~~~~~~~~~~~~~^~~
skyscraper.cpp:80:24: warning: 'to' may be used uninitialized in this function [-Wmaybe-uninitialized]
   80 |     cout << (minDist[to] >= LINF ? -1 : minDist[to]);
      |              ~~~~~~~~~~^

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