oj.uz

Submission #482746

# Submission time Handle Problem Language Result Execution time Memory
482746 2021-10-26T08:09:42 Z jalsol Jakarta Skyscrapers (APIO15_skyscraper) C++17
10 / 100
 2 ms 1740 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<int> pwlist[maxn];
vector<Link> g[maxn];

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

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

    Rep (i, len) {
        auto& v = pwlist[i];
        sort(all(v)); v.erase(unique(all(v)), v.end());

        Fe (p : v) {
            if (p == 0) continue;

            for (int pos = i % p; pos < len; pos += p) {
                if (pos != i) {
                    g[i].push_back({pos, abs(i - pos) / p});
                }
            }
        }
    }

    Dijkstra();

    int ans = d[a[1]];
    if (ans >= inf) ans = -1;
    cout << ans << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1740 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 2 ms 1740 KB Output is correct
4 Correct 1 ms 1740 KB Output is correct
5 Correct 1 ms 1612 KB Output is correct
6 Correct 2 ms 1740 KB Output is correct
7 Correct 1 ms 1740 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1740 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 1 ms 1740 KB Output is correct
4 Correct 1 ms 1740 KB Output is correct
5 Correct 1 ms 1612 KB Output is correct
6 Correct 1 ms 1740 KB Output is correct
7 Correct 2 ms 1740 KB Output is correct
8 Incorrect 2 ms 1740 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1612 KB Output is correct
2 Correct 1 ms 1740 KB Output is correct
3 Correct 1 ms 1740 KB Output is correct
4 Correct 1 ms 1740 KB Output is correct
5 Correct 1 ms 1740 KB Output is correct
6 Correct 1 ms 1612 KB Output is correct
7 Correct 2 ms 1740 KB Output is correct
8 Incorrect 1 ms 1740 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1740 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 1 ms 1616 KB Output is correct
4 Correct 1 ms 1740 KB Output is correct
5 Correct 1 ms 1740 KB Output is correct
6 Correct 1 ms 1740 KB Output is correct
7 Correct 1 ms 1740 KB Output is correct
8 Incorrect 2 ms 1740 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1612 KB Output is correct
2 Correct 1 ms 1740 KB Output is correct
3 Correct 1 ms 1740 KB Output is correct
4 Correct 1 ms 1740 KB Output is correct
5 Correct 2 ms 1740 KB Output is correct
6 Correct 1 ms 1740 KB Output is correct
7 Correct 1 ms 1612 KB Output is correct
8 Incorrect 1 ms 1740 KB Output isn't correct
9 Halted 0 ms 0 KB -