Submission #482743

# Submission time Handle Problem Language Result Execution time Memory
482743 2021-10-26T07:55:59 Z jalsol Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
1000 ms 33252 KB
#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
#define TASK "empty"
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

constexpr int maxn = 3e4 + 5;

struct Link {
    int v, c;
};

struct Data {
    int u, du;

    bool operator<(const Data& o) const {
        return du > o.du;
    }
};

int len, n;
int a[maxn], pw[maxn];
vector<Link> g[maxn];

int d[maxn];
priority_queue<Data> q;

void Dijkstra() {
    memset(d, 0x3f, sizeof(int) * n);
    d[0] = 0;
    q.push({0, d[0]});

    while (isz(q)) {
        auto [u, du] = q.top(); q.pop();
        if (du != d[u]) continue;

        Fe (&[v, c] : g[u]) {
            if (chmin(d[v], d[u] + c)) {
                q.push({v, d[v]});
            }
        }
    }
}

signed main() {
    cin >> len >> n;
    Rep (i, n) cin >> a[i] >> pw[i];

    Rep (i, n) {
        Rep (j, n) {
            if (i == j) continue;

            int dist = abs(a[i] - a[j]);
            if (dist % pw[i] == 0) {
                g[i].push_back({j, dist / pw[i]});
            }
        }
    }

    Dijkstra();

    int ans = d[1];
    if (ans >= inf) ans = -1;
    cout << ans << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 2 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 2 ms 1100 KB Output is correct
11 Correct 25 ms 3140 KB Output is correct
12 Correct 62 ms 32964 KB Output is correct
13 Correct 68 ms 33064 KB Output is correct
14 Correct 25 ms 2536 KB Output is correct
15 Correct 25 ms 2520 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 2 ms 1100 KB Output is correct
11 Correct 25 ms 3120 KB Output is correct
12 Correct 58 ms 32904 KB Output is correct
13 Correct 71 ms 33252 KB Output is correct
14 Correct 26 ms 2508 KB Output is correct
15 Correct 26 ms 2508 KB Output is correct
16 Correct 5 ms 1228 KB Output is correct
17 Correct 20 ms 1624 KB Output is correct
18 Correct 7 ms 1100 KB Output is correct
19 Correct 3 ms 972 KB Output is correct
20 Correct 60 ms 33092 KB Output is correct
21 Correct 9 ms 1076 KB Output is correct
22 Correct 4 ms 972 KB Output is correct
23 Correct 6 ms 1100 KB Output is correct
24 Correct 21 ms 1212 KB Output is correct
25 Correct 23 ms 1140 KB Output is correct
26 Correct 60 ms 30140 KB Output is correct
27 Correct 61 ms 30916 KB Output is correct
28 Correct 24 ms 1276 KB Output is correct
29 Correct 5 ms 1228 KB Output is correct
30 Correct 1 ms 972 KB Output is correct
31 Correct 3 ms 1100 KB Output is correct
32 Correct 2 ms 1100 KB Output is correct
33 Correct 25 ms 2492 KB Output is correct
34 Correct 24 ms 2500 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 2 ms 1100 KB Output is correct
11 Correct 25 ms 3136 KB Output is correct
12 Correct 60 ms 32888 KB Output is correct
13 Correct 64 ms 33068 KB Output is correct
14 Correct 26 ms 2500 KB Output is correct
15 Correct 28 ms 2532 KB Output is correct
16 Correct 6 ms 1228 KB Output is correct
17 Correct 19 ms 1612 KB Output is correct
18 Correct 7 ms 1100 KB Output is correct
19 Correct 3 ms 972 KB Output is correct
20 Correct 59 ms 33080 KB Output is correct
21 Correct 8 ms 1096 KB Output is correct
22 Correct 3 ms 972 KB Output is correct
23 Correct 5 ms 1100 KB Output is correct
24 Correct 19 ms 1228 KB Output is correct
25 Correct 22 ms 1140 KB Output is correct
26 Correct 61 ms 30068 KB Output is correct
27 Correct 60 ms 30992 KB Output is correct
28 Correct 23 ms 1220 KB Output is correct
29 Correct 4 ms 1228 KB Output is correct
30 Correct 1 ms 972 KB Output is correct
31 Correct 4 ms 1100 KB Output is correct
32 Correct 2 ms 1100 KB Output is correct
33 Correct 24 ms 2508 KB Output is correct
34 Correct 25 ms 2500 KB Output is correct
35 Execution timed out 1086 ms 11216 KB Time limit exceeded
36 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 924 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 2 ms 1100 KB Output is correct
11 Correct 27 ms 3196 KB Output is correct
12 Correct 63 ms 32960 KB Output is correct
13 Correct 59 ms 33064 KB Output is correct
14 Correct 24 ms 2512 KB Output is correct
15 Correct 24 ms 2432 KB Output is correct
16 Correct 5 ms 1228 KB Output is correct
17 Correct 20 ms 1612 KB Output is correct
18 Correct 7 ms 1100 KB Output is correct
19 Correct 3 ms 972 KB Output is correct
20 Correct 68 ms 33052 KB Output is correct
21 Correct 8 ms 1100 KB Output is correct
22 Correct 4 ms 1064 KB Output is correct
23 Correct 6 ms 1068 KB Output is correct
24 Correct 19 ms 1192 KB Output is correct
25 Correct 21 ms 1108 KB Output is correct
26 Correct 57 ms 30180 KB Output is correct
27 Correct 58 ms 30916 KB Output is correct
28 Correct 24 ms 1228 KB Output is correct
29 Correct 5 ms 1356 KB Output is correct
30 Correct 1 ms 972 KB Output is correct
31 Correct 3 ms 1100 KB Output is correct
32 Correct 3 ms 1100 KB Output is correct
33 Correct 26 ms 2500 KB Output is correct
34 Correct 24 ms 2536 KB Output is correct
35 Execution timed out 1083 ms 11236 KB Time limit exceeded
36 Halted 0 ms 0 KB -