oj.uz

Submission #969743

# Submission time Handle Problem Language Result Execution time Memory
969743 2024-04-25T14:16:19 Z Pring Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 110320 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 = 30000, MXM = 10000005, INF = 1e9;
int n, m;
vector<int> pos, p;
map<pii, int> M;

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

    void ZOBFS(int sr) {
        auto PUSH = [&](int id) -> void {
            debug(id, dis[id]);
            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);
        while (dq.size()) {
            int id = dq.front();
            dq.pop_front();
            if (b[id]) continue;
            b[id] = true;
            PUSH(id);
        }
    }
}

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);
    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;
}

Compilation message

skyscraper.cpp: In lambda function:
skyscraper.cpp:11:20: warning: statement has no effect [-Wunused-value]
   11 | #define debug(...) 39
      |                    ^~
skyscraper.cpp:34:13: note: in expansion of macro 'debug'
   34 |             debug(id, dis[id]);
      |             ^~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 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

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 1112 KB Output is correct
3 Correct 1 ms 1368 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 1368 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 2 ms 1628 KB Output is correct
12 Correct 2 ms 1372 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 3 ms 1880 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 1112 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 2 ms 1628 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 3 ms 1884 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 6 ms 2620 KB Output is correct
18 Correct 1 ms 1112 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 2 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 3 ms 1884 KB Output is correct
24 Correct 5 ms 2396 KB Output is correct
25 Correct 4 ms 2140 KB Output is correct
26 Correct 3 ms 2360 KB Output is correct
27 Correct 3 ms 2140 KB Output is correct
28 Correct 7 ms 3600 KB Output is correct
29 Correct 18 ms 6524 KB Output is correct
30 Correct 4 ms 2652 KB Output is correct
31 Correct 13 ms 4116 KB Output is correct
32 Correct 8 ms 3348 KB Output is correct
33 Correct 42 ms 11540 KB Output is correct
34 Correct 31 ms 11528 KB Output is correct

Subtask #4
21.0 / 21.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 2 ms 1628 KB Output is correct
12 Correct 2 ms 1364 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 2 ms 1880 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 5 ms 2396 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 2 ms 1624 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 3 ms 1884 KB Output is correct
24 Correct 4 ms 2396 KB Output is correct
25 Correct 4 ms 2140 KB Output is correct
26 Correct 4 ms 2140 KB Output is correct
27 Correct 3 ms 2140 KB Output is correct
28 Correct 7 ms 3604 KB Output is correct
29 Correct 17 ms 6392 KB Output is correct
30 Correct 4 ms 2652 KB Output is correct
31 Correct 9 ms 4012 KB Output is correct
32 Correct 6 ms 3348 KB Output is correct
33 Correct 29 ms 11588 KB Output is correct
34 Correct 31 ms 11580 KB Output is correct
35 Correct 45 ms 12348 KB Output is correct
36 Correct 7 ms 3348 KB Output is correct
37 Correct 81 ms 19116 KB Output is correct
38 Correct 98 ms 19420 KB Output is correct
39 Correct 83 ms 19440 KB Output is correct
40 Correct 99 ms 19448 KB Output is correct
41 Correct 110 ms 19352 KB Output is correct
42 Correct 11 ms 4880 KB Output is correct
43 Correct 11 ms 4624 KB Output is correct
44 Correct 9 ms 4732 KB Output is correct
45 Correct 259 ms 44848 KB Output is correct
46 Correct 270 ms 44848 KB Output is correct

Subtask #5
0 / 43.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 1264 KB Output is correct
11 Correct 2 ms 1628 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 3 ms 1884 KB Output is correct
16 Correct 1 ms 1168 KB Output is correct
17 Correct 5 ms 2620 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 2 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 3 ms 2136 KB Output is correct
24 Correct 5 ms 2396 KB Output is correct
25 Correct 3 ms 2252 KB Output is correct
26 Correct 3 ms 2140 KB Output is correct
27 Correct 3 ms 2140 KB Output is correct
28 Correct 9 ms 3604 KB Output is correct
29 Correct 16 ms 6532 KB Output is correct
30 Correct 4 ms 2652 KB Output is correct
31 Correct 10 ms 3860 KB Output is correct
32 Correct 7 ms 3348 KB Output is correct
33 Correct 29 ms 11576 KB Output is correct
34 Correct 32 ms 11832 KB Output is correct
35 Correct 48 ms 12600 KB Output is correct
36 Correct 8 ms 3348 KB Output is correct
37 Correct 88 ms 19184 KB Output is correct
38 Correct 111 ms 19444 KB Output is correct
39 Correct 84 ms 19468 KB Output is correct
40 Correct 94 ms 19280 KB Output is correct
41 Correct 100 ms 19356 KB Output is correct
42 Correct 11 ms 4880 KB Output is correct
43 Correct 11 ms 4624 KB Output is correct
44 Correct 10 ms 4628 KB Output is correct
45 Correct 253 ms 44844 KB Output is correct
46 Correct 295 ms 44840 KB Output is correct
47 Correct 798 ms 74596 KB Output is correct
48 Correct 5 ms 1884 KB Output is correct
49 Correct 7 ms 1884 KB Output is correct
50 Correct 3 ms 1628 KB Output is correct
51 Correct 280 ms 37960 KB Output is correct
52 Correct 292 ms 38676 KB Output is correct
53 Correct 79 ms 14104 KB Output is correct
54 Correct 6 ms 3604 KB Output is correct
55 Correct 10 ms 5320 KB Output is correct
56 Correct 30 ms 11060 KB Output is correct
57 Correct 286 ms 41304 KB Output is correct
58 Correct 34 ms 12296 KB Output is correct
59 Correct 44 ms 14136 KB Output is correct
60 Correct 66 ms 19440 KB Output is correct
61 Correct 50 ms 14908 KB Output is correct
62 Correct 436 ms 48224 KB Output is correct
63 Execution timed out 1065 ms 110320 KB Time limit exceeded
64 Halted 0 ms 0 KB -