oj.uz

Submission #699254

# Submission time Handle Problem Language Result Execution time Memory
699254 2023-02-16T09:24:49 Z nguyentunglam Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 158076 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace __gnu_pbds;
using namespace std;
const int N = 3e4 + 10, M = 8e6 + 10;
gp_hash_table<int, int> dd;
vector<int> lst[N];
int d[M];
int cnt;
bool mark[N];
int id(int x, int y) {
    int code = x * (3e4 + 1) + y;
    if (!dd[code]) dd[code] = ++cnt;
    return dd[code];
}
int main() {
    #define task ""
    cin.tie(0) -> sync_with_stdio(0);
    if (fopen ("task.inp", "r")) {
        freopen ("task.inp", "r", stdin);
        freopen ("task.out", "w", stdout);
    }
    if (fopen (task".inp", "r")) {
        freopen (task".inp", "r", stdin);
        freopen (task".out", "w", stdout);
    }
    int n, m; cin >> n >> m;
    pair<int, int> st, ed;
    for(int i = 0; i < m; i++) {
        int b, p; cin >> b >> p;
        lst[b].push_back(p);
        if (i == 0) st = make_pair(b, p);
        if (i == 1) ed = make_pair(b, p);
    }
    deque<pair<int, int> > dq;
    d[id(st.fi, st.se)] = 1; dq.push_back(st);

    while (!dq.empty()) {
        auto [pos, jump] = dq.front(); dq.pop_front();
        int cur = id(pos, jump);
        if (pos == ed.fi) return cout << d[cur] - 1, 0;
        if (!mark[pos]) {
            for(auto &j : lst[pos]) {
                int code = id(pos, j);
                if (!d[code]) d[code] = d[cur], dq.push_front({pos, j});
            }
            mark[pos] = 1;
        }
        if (pos + jump < n) {
            int code = id(pos + jump, jump);
            if (!d[code]) d[code] = d[cur] + 1, dq.push_back({pos + jump, jump});
        }
        if (pos - jump >= 0) {
            int code = id(pos - jump, jump);
            if (!d[code]) d[code] = d[cur] + 1, dq.push_back({pos - jump, jump});
        }
    }
    cout << -1;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:24:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         freopen ("task.inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:25:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |         freopen ("task.out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:28:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         freopen (task".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:29:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         freopen (task".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 1364 KB Output is correct
15 Correct 1 ms 1236 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 1364 KB Output is correct
15 Correct 1 ms 1236 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 2 ms 1364 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 2 ms 1364 KB Output is correct
24 Correct 2 ms 1432 KB Output is correct
25 Correct 2 ms 1108 KB Output is correct
26 Correct 1 ms 1236 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 5 ms 2384 KB Output is correct
29 Correct 13 ms 3540 KB Output is correct
30 Correct 3 ms 2412 KB Output is correct
31 Correct 5 ms 2388 KB Output is correct
32 Correct 4 ms 2388 KB Output is correct
33 Correct 23 ms 6140 KB Output is correct
34 Correct 19 ms 3628 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 1364 KB Output is correct
15 Correct 1 ms 1236 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 2 ms 1364 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 2 ms 1108 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 2 ms 1364 KB Output is correct
24 Correct 2 ms 1492 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1236 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 5 ms 2384 KB Output is correct
29 Correct 19 ms 3620 KB Output is correct
30 Correct 3 ms 2388 KB Output is correct
31 Correct 5 ms 2388 KB Output is correct
32 Correct 4 ms 2388 KB Output is correct
33 Correct 22 ms 6104 KB Output is correct
34 Correct 16 ms 3548 KB Output is correct
35 Correct 15 ms 3848 KB Output is correct
36 Correct 2 ms 1236 KB Output is correct
37 Correct 11 ms 3800 KB Output is correct
38 Correct 10 ms 2532 KB Output is correct
39 Correct 7 ms 1372 KB Output is correct
40 Correct 7 ms 1628 KB Output is correct
41 Correct 7 ms 1988 KB Output is correct
42 Correct 4 ms 1368 KB Output is correct
43 Correct 5 ms 1496 KB Output is correct
44 Correct 5 ms 1240 KB Output is correct
45 Correct 147 ms 21592 KB Output is correct
46 Correct 81 ms 20972 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 1104 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 1364 KB Output is correct
15 Correct 2 ms 1236 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 2 ms 1364 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 2 ms 1364 KB Output is correct
24 Correct 2 ms 1492 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1236 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 4 ms 2408 KB Output is correct
29 Correct 13 ms 3540 KB Output is correct
30 Correct 4 ms 2388 KB Output is correct
31 Correct 6 ms 2388 KB Output is correct
32 Correct 4 ms 2388 KB Output is correct
33 Correct 28 ms 6104 KB Output is correct
34 Correct 18 ms 3548 KB Output is correct
35 Correct 11 ms 3788 KB Output is correct
36 Correct 2 ms 1236 KB Output is correct
37 Correct 9 ms 3800 KB Output is correct
38 Correct 8 ms 2644 KB Output is correct
39 Correct 6 ms 1236 KB Output is correct
40 Correct 7 ms 1620 KB Output is correct
41 Correct 7 ms 1956 KB Output is correct
42 Correct 4 ms 1364 KB Output is correct
43 Correct 4 ms 1492 KB Output is correct
44 Correct 4 ms 1236 KB Output is correct
45 Correct 159 ms 21624 KB Output is correct
46 Correct 81 ms 20996 KB Output is correct
47 Correct 7 ms 2088 KB Output is correct
48 Correct 5 ms 1492 KB Output is correct
49 Correct 5 ms 1412 KB Output is correct
50 Correct 4 ms 1364 KB Output is correct
51 Correct 16 ms 4212 KB Output is correct
52 Correct 18 ms 4312 KB Output is correct
53 Correct 8 ms 2004 KB Output is correct
54 Correct 3 ms 1688 KB Output is correct
55 Correct 3 ms 2388 KB Output is correct
56 Correct 11 ms 3280 KB Output is correct
57 Correct 1 ms 1116 KB Output is correct
58 Correct 14 ms 6256 KB Output is correct
59 Correct 11 ms 3744 KB Output is correct
60 Correct 10 ms 3852 KB Output is correct
61 Correct 10 ms 3852 KB Output is correct
62 Correct 100 ms 22172 KB Output is correct
63 Correct 759 ms 158076 KB Output is correct
64 Execution timed out 1100 ms 157320 KB Time limit exceeded
65 Halted 0 ms 0 KB -