oj.uz

Submission #969557

# Submission time Handle Problem Language Result Execution time Memory
969557 2024-04-25T09:58:26 Z Pring Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 173 ms 164240 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
using ll = long long;
typedef pair<int, int> pii;
typedef array<int, 3> p3i;

const int MXN = 30005, MXM = 2000005, INF = 1e9;
int n, m;
map<pii, int> M;

namespace GRAPH {
    int rt[MXM], dis[MXM], nc;
    vector<p3i> edge;

    int new_node() {
        rt[nc] = -1;
        return nc++;
    }

    void add_edge(int u, int v, int w) { 
        debug(u, v, w);
        edge.push_back({w, v, rt[u]});
        rt[u] = edge.size() - 1;
    }

    int ADD_CHAIN(int mod, int r) {
        if (M.find(mp(mod, r)) != M.end()) return M[mp(mod, r)];
        vector<int> v;
        for (int i = r; i < n; i += mod) {
            v.push_back(new_node());
            add_edge(v.back(), i, 0);
        }
        FOR(i, 1, v.size()) {
            add_edge(v[i - 1], v[i], 1);
            add_edge(v[i], v[i - 1], 1);
        }
        debug(mod, r, v.front());
        return (M[mp(mod, r)] = v.front());
    }

    void ZOBFS(int sr) {
        // FOR(i, 0, nc) cout << rt[i] << ' ';
        // cout << endl;
        // for (auto [u, v, w] : edge) cout << '<' << u << ' ' << v << ' ' << w << '>' << '\n';
        deque<pii> dq;
        fill(dis, dis + nc, INF);
        dq.push_back(mp(0, sr));
        while (dq.size()) {
            auto [len, id] = dq.front();
            dq.pop_front();
            if (dis[id] < INF) continue;
            dis[id] = len;
            debug(id, len);
            int p = rt[id];
            while (p != -1) {
                auto [w, i, nxt] = edge[p];
                // debug(p, w, i, nxt);
                if (dis[i] == INF) {
                    if (w) dq.push_back(mp(len + 1, i));
                    else dq.push_front(mp(len, i));
                }
                p = nxt;
            }
        }
    }
}

int minimum_jumps(int N, int M, vector<int> &B, vector<int> &P) {
    using namespace GRAPH;
    n = N;
    m = M;
    FOR(i, 0, n) new_node();
    FOR(i, 0, m) {
        int now = new_node();
        add_edge(B[i], now, 0);
        add_edge(now, B[i], 0);
    }
    FOR(i, 0, m) {
        int rt = ADD_CHAIN(P[i], B[i] % P[i]);
        int now = rt + B[i] / P[i];
        add_edge(n + i, now, 0);
    }
    ZOBFS(n);
    return (dis[n + 1] == INF ? -1 : dis[n + 1]);
}

void miku() {
    int n, m;
    cin >> n >> m;
    vector<int> b(m), p(m);
    FOR(i, 0, m) cin >> b[i] >> p[i];
    cout << minimum_jumps(n, m, b, p) << '\n';
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    miku();
    return 0;
}

Compilation message

skyscraper.cpp: In function 'void GRAPH::add_edge(int, int, int)':
skyscraper.cpp:11:20: warning: statement has no effect [-Wunused-value]
   11 | #define debug(...) 39
      |                    ^~
skyscraper.cpp:36:9: note: in expansion of macro 'debug'
   36 |         debug(u, v, w);
      |         ^~~~~
skyscraper.cpp: In function 'int GRAPH::ADD_CHAIN(int, int)':
skyscraper.cpp:11:20: warning: statement has no effect [-Wunused-value]
   11 | #define debug(...) 39
      |                    ^~
skyscraper.cpp:52:9: note: in expansion of macro 'debug'
   52 |         debug(mod, r, v.front());
      |         ^~~~~
skyscraper.cpp: In function 'void GRAPH::ZOBFS(int)':
skyscraper.cpp:11:20: warning: statement has no effect [-Wunused-value]
   11 | #define debug(...) 39
      |                    ^~
skyscraper.cpp:68:13: note: in expansion of macro 'debug'
   68 |             debug(id, len);
      |             ^~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 2 ms 2872 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 2 ms 2936 KB Output is correct
15 Correct 2 ms 2936 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 2 ms 2872 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 2 ms 2936 KB Output is correct
15 Correct 2 ms 2932 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 2 ms 3424 KB Output is correct
18 Correct 1 ms 2924 KB Output is correct
19 Correct 1 ms 2864 KB Output is correct
20 Correct 1 ms 2792 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2932 KB Output is correct
23 Correct 1 ms 2920 KB Output is correct
24 Correct 3 ms 3432 KB Output is correct
25 Correct 2 ms 2908 KB Output is correct
26 Correct 2 ms 2908 KB Output is correct
27 Correct 1 ms 3160 KB Output is correct
28 Correct 3 ms 4056 KB Output is correct
29 Correct 5 ms 7372 KB Output is correct
30 Correct 2 ms 3416 KB Output is correct
31 Correct 3 ms 4052 KB Output is correct
32 Correct 3 ms 4052 KB Output is correct
33 Correct 10 ms 9928 KB Output is correct
34 Correct 11 ms 10700 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2512 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 2 ms 2868 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 2 ms 2936 KB Output is correct
15 Correct 2 ms 2936 KB Output is correct
16 Correct 1 ms 2724 KB Output is correct
17 Correct 2 ms 3424 KB Output is correct
18 Correct 1 ms 2924 KB Output is correct
19 Correct 1 ms 2864 KB Output is correct
20 Correct 1 ms 2848 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2932 KB Output is correct
23 Correct 2 ms 2924 KB Output is correct
24 Correct 2 ms 3432 KB Output is correct
25 Correct 2 ms 2976 KB Output is correct
26 Correct 2 ms 2908 KB Output is correct
27 Correct 2 ms 2908 KB Output is correct
28 Correct 4 ms 4364 KB Output is correct
29 Correct 5 ms 7372 KB Output is correct
30 Correct 2 ms 3420 KB Output is correct
31 Correct 4 ms 4056 KB Output is correct
32 Correct 2 ms 4184 KB Output is correct
33 Correct 10 ms 10380 KB Output is correct
34 Correct 10 ms 10192 KB Output is correct
35 Correct 22 ms 12164 KB Output is correct
36 Correct 4 ms 3544 KB Output is correct
37 Correct 26 ms 18504 KB Output is correct
38 Correct 28 ms 15304 KB Output is correct
39 Correct 30 ms 15296 KB Output is correct
40 Correct 40 ms 15232 KB Output is correct
41 Correct 30 ms 15292 KB Output is correct
42 Correct 6 ms 4816 KB Output is correct
43 Correct 6 ms 4684 KB Output is correct
44 Correct 5 ms 4560 KB Output is correct
45 Correct 65 ms 32748 KB Output is correct
46 Correct 67 ms 32952 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2512 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 2 ms 2872 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 2 ms 2932 KB Output is correct
15 Correct 2 ms 2936 KB Output is correct
16 Correct 1 ms 2772 KB Output is correct
17 Correct 3 ms 3424 KB Output is correct
18 Correct 1 ms 2924 KB Output is correct
19 Correct 1 ms 2864 KB Output is correct
20 Correct 1 ms 2844 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2932 KB Output is correct
23 Correct 2 ms 2920 KB Output is correct
24 Correct 2 ms 3432 KB Output is correct
25 Correct 2 ms 2908 KB Output is correct
26 Correct 2 ms 2908 KB Output is correct
27 Correct 1 ms 2908 KB Output is correct
28 Correct 3 ms 4056 KB Output is correct
29 Correct 5 ms 7368 KB Output is correct
30 Correct 2 ms 3416 KB Output is correct
31 Correct 4 ms 4052 KB Output is correct
32 Correct 3 ms 4056 KB Output is correct
33 Correct 11 ms 10956 KB Output is correct
34 Correct 12 ms 10444 KB Output is correct
35 Correct 21 ms 11472 KB Output is correct
36 Correct 4 ms 3492 KB Output is correct
37 Correct 24 ms 20168 KB Output is correct
38 Correct 33 ms 15296 KB Output is correct
39 Correct 30 ms 15292 KB Output is correct
40 Correct 30 ms 15292 KB Output is correct
41 Correct 33 ms 15304 KB Output is correct
42 Correct 6 ms 4564 KB Output is correct
43 Correct 8 ms 4564 KB Output is correct
44 Correct 6 ms 4564 KB Output is correct
45 Correct 65 ms 31588 KB Output is correct
46 Correct 65 ms 31416 KB Output is correct
47 Correct 82 ms 59060 KB Output is correct
48 Correct 23 ms 19656 KB Output is correct
49 Correct 18 ms 13772 KB Output is correct
50 Correct 15 ms 13072 KB Output is correct
51 Correct 43 ms 21316 KB Output is correct
52 Correct 53 ms 33808 KB Output is correct
53 Correct 24 ms 12996 KB Output is correct
54 Correct 3 ms 5972 KB Output is correct
55 Correct 4 ms 6900 KB Output is correct
56 Correct 9 ms 7328 KB Output is correct
57 Correct 31 ms 30180 KB Output is correct
58 Correct 9 ms 9932 KB Output is correct
59 Correct 11 ms 12824 KB Output is correct
60 Correct 13 ms 12692 KB Output is correct
61 Correct 14 ms 12484 KB Output is correct
62 Correct 53 ms 31924 KB Output is correct
63 Runtime error 173 ms 164240 KB Execution killed with signal 11
64 Halted 0 ms 0 KB -