Submission #482754

# Submission time Handle Problem Language Result Execution time Memory
482754 2021-10-26T08:53:15 Z jalsol Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
433 ms 262148 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 State {
    int u, du;

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

int len, n;
int a[maxn], pw[maxn];

set<int> building[maxn];
vector<Link> g[maxn];

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

void Dijkstra() {
    memset(d, 0x3f, sizeof(int) * len);
    d[a[0]] = 0;
    q.push({a[0], d[a[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) {
        building[a[i]].insert(pw[i]);
    }

    Rep (i, len) {
        Fe (p : building[i]) {
            for (int other = i % p; other < len; other += p) {
                if (other == i) continue;
                g[i].push_back({other, abs(i - other) / p});
            }
        }
    }

    Dijkstra();
    int ans = d[a[1]];
    if (ans >= inf) ans = -1;
    cout << ans << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2380 KB Output is correct
2 Correct 1 ms 2380 KB Output is correct
3 Correct 1 ms 2380 KB Output is correct
4 Correct 1 ms 2380 KB Output is correct
5 Correct 1 ms 2380 KB Output is correct
6 Correct 1 ms 2380 KB Output is correct
7 Correct 2 ms 2380 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2380 KB Output is correct
2 Correct 1 ms 2380 KB Output is correct
3 Correct 2 ms 2380 KB Output is correct
4 Correct 1 ms 2380 KB Output is correct
5 Correct 2 ms 2380 KB Output is correct
6 Correct 1 ms 2380 KB Output is correct
7 Correct 1 ms 2380 KB Output is correct
8 Correct 1 ms 2380 KB Output is correct
9 Correct 1 ms 2380 KB Output is correct
10 Correct 2 ms 2380 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 1 ms 2380 KB Output is correct
13 Correct 2 ms 2508 KB Output is correct
14 Correct 2 ms 2508 KB Output is correct
15 Correct 2 ms 2508 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2380 KB Output is correct
2 Correct 1 ms 2380 KB Output is correct
3 Correct 1 ms 2380 KB Output is correct
4 Correct 1 ms 2380 KB Output is correct
5 Correct 1 ms 2380 KB Output is correct
6 Correct 1 ms 2380 KB Output is correct
7 Correct 2 ms 2380 KB Output is correct
8 Correct 2 ms 2380 KB Output is correct
9 Correct 2 ms 2380 KB Output is correct
10 Correct 2 ms 2380 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2380 KB Output is correct
13 Correct 2 ms 2508 KB Output is correct
14 Correct 2 ms 2508 KB Output is correct
15 Correct 2 ms 2508 KB Output is correct
16 Correct 1 ms 2508 KB Output is correct
17 Correct 3 ms 2764 KB Output is correct
18 Correct 2 ms 2508 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 58 ms 34628 KB Output is correct
21 Correct 2 ms 2508 KB Output is correct
22 Correct 2 ms 2508 KB Output is correct
23 Correct 2 ms 2508 KB Output is correct
24 Correct 2 ms 2636 KB Output is correct
25 Correct 2 ms 2636 KB Output is correct
26 Correct 3 ms 2636 KB Output is correct
27 Correct 2 ms 2508 KB Output is correct
28 Correct 4 ms 2764 KB Output is correct
29 Correct 4 ms 3276 KB Output is correct
30 Correct 3 ms 2764 KB Output is correct
31 Correct 3 ms 2892 KB Output is correct
32 Correct 2 ms 2764 KB Output is correct
33 Correct 6 ms 4044 KB Output is correct
34 Correct 5 ms 4044 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2380 KB Output is correct
2 Correct 1 ms 2380 KB Output is correct
3 Correct 1 ms 2380 KB Output is correct
4 Correct 2 ms 2380 KB Output is correct
5 Correct 2 ms 2380 KB Output is correct
6 Correct 1 ms 2380 KB Output is correct
7 Correct 2 ms 2388 KB Output is correct
8 Correct 1 ms 2380 KB Output is correct
9 Correct 1 ms 2380 KB Output is correct
10 Correct 2 ms 2380 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2380 KB Output is correct
13 Correct 2 ms 2508 KB Output is correct
14 Correct 2 ms 2508 KB Output is correct
15 Correct 3 ms 2508 KB Output is correct
16 Correct 2 ms 2508 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 2 ms 2508 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 57 ms 34656 KB Output is correct
21 Correct 1 ms 2508 KB Output is correct
22 Correct 1 ms 2508 KB Output is correct
23 Correct 2 ms 2508 KB Output is correct
24 Correct 2 ms 2636 KB Output is correct
25 Correct 2 ms 2636 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 2 ms 2508 KB Output is correct
28 Correct 2 ms 2764 KB Output is correct
29 Correct 5 ms 3276 KB Output is correct
30 Correct 3 ms 2764 KB Output is correct
31 Correct 4 ms 2892 KB Output is correct
32 Correct 2 ms 2764 KB Output is correct
33 Correct 7 ms 3996 KB Output is correct
34 Correct 5 ms 4044 KB Output is correct
35 Correct 11 ms 5324 KB Output is correct
36 Correct 5 ms 2892 KB Output is correct
37 Correct 12 ms 6732 KB Output is correct
38 Correct 15 ms 6776 KB Output is correct
39 Correct 14 ms 6876 KB Output is correct
40 Correct 15 ms 6860 KB Output is correct
41 Correct 15 ms 6740 KB Output is correct
42 Correct 5 ms 2984 KB Output is correct
43 Correct 8 ms 2952 KB Output is correct
44 Correct 68 ms 34952 KB Output is correct
45 Correct 19 ms 8776 KB Output is correct
46 Correct 19 ms 8764 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2380 KB Output is correct
2 Correct 1 ms 2380 KB Output is correct
3 Correct 1 ms 2380 KB Output is correct
4 Correct 1 ms 2380 KB Output is correct
5 Correct 1 ms 2380 KB Output is correct
6 Correct 1 ms 2380 KB Output is correct
7 Correct 2 ms 2380 KB Output is correct
8 Correct 1 ms 2380 KB Output is correct
9 Correct 2 ms 2380 KB Output is correct
10 Correct 1 ms 2380 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 1 ms 2380 KB Output is correct
13 Correct 3 ms 2508 KB Output is correct
14 Correct 2 ms 2508 KB Output is correct
15 Correct 2 ms 2508 KB Output is correct
16 Correct 2 ms 2508 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 2 ms 2508 KB Output is correct
19 Correct 1 ms 2508 KB Output is correct
20 Correct 58 ms 34612 KB Output is correct
21 Correct 2 ms 2508 KB Output is correct
22 Correct 2 ms 2508 KB Output is correct
23 Correct 2 ms 2508 KB Output is correct
24 Correct 2 ms 2636 KB Output is correct
25 Correct 2 ms 2636 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 2 ms 2508 KB Output is correct
28 Correct 2 ms 2764 KB Output is correct
29 Correct 3 ms 3276 KB Output is correct
30 Correct 2 ms 2764 KB Output is correct
31 Correct 3 ms 2892 KB Output is correct
32 Correct 3 ms 2764 KB Output is correct
33 Correct 7 ms 4044 KB Output is correct
34 Correct 6 ms 4044 KB Output is correct
35 Correct 12 ms 5336 KB Output is correct
36 Correct 4 ms 2864 KB Output is correct
37 Correct 12 ms 6732 KB Output is correct
38 Correct 14 ms 6700 KB Output is correct
39 Correct 14 ms 6860 KB Output is correct
40 Correct 16 ms 6812 KB Output is correct
41 Correct 13 ms 6740 KB Output is correct
42 Correct 5 ms 2892 KB Output is correct
43 Correct 5 ms 2892 KB Output is correct
44 Correct 62 ms 35116 KB Output is correct
45 Correct 19 ms 8792 KB Output is correct
46 Correct 20 ms 8816 KB Output is correct
47 Correct 30 ms 15176 KB Output is correct
48 Correct 13 ms 6304 KB Output is correct
49 Correct 11 ms 5324 KB Output is correct
50 Correct 8 ms 4940 KB Output is correct
51 Correct 28 ms 9208 KB Output is correct
52 Correct 28 ms 9488 KB Output is correct
53 Correct 15 ms 6088 KB Output is correct
54 Correct 3 ms 3020 KB Output is correct
55 Correct 4 ms 3460 KB Output is correct
56 Runtime error 433 ms 262148 KB Execution killed with signal 9
57 Halted 0 ms 0 KB -