oj.uz

Submission #969759

# Submission time Handle Problem Language Result Execution time Memory
969759 2024-04-25T14:37:34 Z Pring Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 891 ms 54276 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;

const int MXN = 30005, INF = 1e9;
int n, m;
vector<int> pos, p;

namespace GRAPH {
    vector<int> bck[MXN];
    unordered_map<int, int> dis;
    unordered_map<int, bool> b;
    deque<int> dq;

    void ZOBFS(int sr, int to) {
        auto PUSH = [&](int id) -> void {
            auto PUT = [&](int i, int id, int w) -> void {
                if (b[i]) return;
                if (dis.find(i) == dis.end() || dis[i] < dis[id] + w) {
                    dis[i] = dis[id] + w;
                    if (w) dq.push_back(i);
                    else dq.push_front(i);
                }
            };
            if (id < n) {
                for (auto &i : bck[id]) PUT(i + n, id, 0);
                return;
            }
            if (id < n + m) {
                PUT(pos[id - n], id, 0);
                PUT(pos[id - n] * MXN + p[id - n] + n + m, id, 0);
                return;
            }
            id -= (n + m);
            int now = id / MXN, mod = id % MXN;
            PUT(now, id + n + m, 0);
            if (now - mod >= 0) PUT((now - mod) * MXN + mod + n + m, id + n + m, 1);
            if (now + mod < n) PUT((now + mod) * MXN + mod + n + m, id + n + m, 1);
        };
        dis[sr] = 0;
        dq.push_back(sr);
        int t = clock();
        while (dq.size() && clock() - t <= CLOCKS_PER_SEC / 10 * 7) {
            int id = dq.front();
            dq.pop_front();
            if (b[id]) continue;
            b[id] = true;
            PUSH(id);
            if (dis.find(to) != dis.end()) break;
        }
    }
}

int minimum_jumps(int N, int M, vector<int> &B, vector<int> &P) {
    using namespace GRAPH;
    n = N;
    m = M;
    pos = B;
    p = P;
    FOR(i, 0, m) bck[B[i]].push_back(i);
    ZOBFS(n, n + 1);
    if (dis.find(n + 1) == dis.end()) return -1;
    return 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;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 5 ms 1884 KB Output is correct
15 Correct 3 ms 1628 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 5 ms 1628 KB Output is correct
15 Correct 3 ms 1628 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 4 ms 1628 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 6 ms 1820 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 5 ms 1628 KB Output is correct
24 Correct 6 ms 1884 KB Output is correct
25 Correct 2 ms 1372 KB Output is correct
26 Correct 3 ms 1372 KB Output is correct
27 Correct 5 ms 1884 KB Output is correct
28 Correct 14 ms 3348 KB Output is correct
29 Correct 37 ms 6256 KB Output is correct
30 Correct 10 ms 2652 KB Output is correct
31 Correct 20 ms 3860 KB Output is correct
32 Correct 15 ms 3344 KB Output is correct
33 Correct 95 ms 11472 KB Output is correct
34 Correct 42 ms 6740 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 5 ms 1628 KB Output is correct
15 Correct 3 ms 1752 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 6 ms 1628 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1112 KB Output is correct
20 Correct 4 ms 1880 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 5 ms 1628 KB Output is correct
24 Correct 6 ms 1884 KB Output is correct
25 Correct 2 ms 1180 KB Output is correct
26 Correct 3 ms 1372 KB Output is correct
27 Correct 4 ms 1884 KB Output is correct
28 Correct 14 ms 3336 KB Output is correct
29 Correct 37 ms 6268 KB Output is correct
30 Correct 11 ms 2652 KB Output is correct
31 Correct 19 ms 3876 KB Output is correct
32 Correct 15 ms 3344 KB Output is correct
33 Correct 74 ms 11576 KB Output is correct
34 Correct 47 ms 6744 KB Output is correct
35 Correct 42 ms 7620 KB Output is correct
36 Correct 2 ms 1372 KB Output is correct
37 Correct 26 ms 6012 KB Output is correct
38 Correct 22 ms 4764 KB Output is correct
39 Correct 5 ms 1880 KB Output is correct
40 Correct 10 ms 2764 KB Output is correct
41 Correct 14 ms 3164 KB Output is correct
42 Correct 6 ms 2140 KB Output is correct
43 Correct 11 ms 4644 KB Output is correct
44 Correct 23 ms 4628 KB Output is correct
45 Correct 486 ms 45192 KB Output is correct
46 Correct 245 ms 26016 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1368 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 2 ms 1368 KB Output is correct
14 Correct 5 ms 1884 KB Output is correct
15 Correct 3 ms 1628 KB Output is correct
16 Correct 1 ms 1368 KB Output is correct
17 Correct 4 ms 1628 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 4 ms 1628 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 5 ms 1628 KB Output is correct
24 Correct 6 ms 1884 KB Output is correct
25 Correct 2 ms 1372 KB Output is correct
26 Correct 3 ms 1368 KB Output is correct
27 Correct 4 ms 1884 KB Output is correct
28 Correct 17 ms 3300 KB Output is correct
29 Correct 37 ms 6292 KB Output is correct
30 Correct 11 ms 2648 KB Output is correct
31 Correct 19 ms 3860 KB Output is correct
32 Correct 15 ms 3352 KB Output is correct
33 Correct 75 ms 11584 KB Output is correct
34 Correct 42 ms 6772 KB Output is correct
35 Correct 43 ms 7792 KB Output is correct
36 Correct 2 ms 1372 KB Output is correct
37 Correct 26 ms 6088 KB Output is correct
38 Correct 22 ms 4912 KB Output is correct
39 Correct 5 ms 1884 KB Output is correct
40 Correct 10 ms 2908 KB Output is correct
41 Correct 15 ms 3164 KB Output is correct
42 Correct 6 ms 2020 KB Output is correct
43 Correct 11 ms 4624 KB Output is correct
44 Correct 20 ms 4624 KB Output is correct
45 Correct 473 ms 45020 KB Output is correct
46 Correct 305 ms 26076 KB Output is correct
47 Correct 17 ms 4368 KB Output is correct
48 Correct 4 ms 1884 KB Output is correct
49 Correct 4 ms 1884 KB Output is correct
50 Correct 3 ms 1624 KB Output is correct
51 Correct 74 ms 10764 KB Output is correct
52 Correct 73 ms 11568 KB Output is correct
53 Correct 14 ms 3420 KB Output is correct
54 Correct 16 ms 3700 KB Output is correct
55 Correct 26 ms 5320 KB Output is correct
56 Correct 57 ms 11032 KB Output is correct
57 Correct 2 ms 1112 KB Output is correct
58 Correct 94 ms 12264 KB Output is correct
59 Correct 56 ms 10272 KB Output is correct
60 Correct 55 ms 10452 KB Output is correct
61 Correct 57 ms 11068 KB Output is correct
62 Correct 589 ms 45428 KB Output is correct
63 Incorrect 891 ms 54276 KB Output isn't correct
64 Halted 0 ms 0 KB -