oj.uz

Submission #699250

# Submission time Handle Problem Language Result Execution time Memory
699250 2023-02-16T09:00:09 Z nguyentunglam Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 86852 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
const int N = 3e4 + 10, M = 8e6 + 10;
unordered_map<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 (!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 << d[id(ed.fi, ed.se)] - 1;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:22:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         freopen ("task.inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:23:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen ("task.out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:26:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |         freopen (task".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:27:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |         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 1040 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 1 ms 1032 KB Output is correct
6 Correct 1 ms 1040 KB Output is correct
7 Correct 1 ms 984 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1036 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 1 ms 1040 KB Output is correct
4 Correct 1 ms 988 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 1032 KB Output is correct
9 Correct 1 ms 988 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1240 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 1304 KB Output is correct
15 Correct 2 ms 1300 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1032 KB Output is correct
2 Correct 1 ms 1028 KB Output is correct
3 Correct 1 ms 1036 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1044 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 1036 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 2 ms 1236 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 1300 KB Output is correct
15 Correct 2 ms 1364 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 5 ms 1748 KB Output is correct
18 Correct 2 ms 1044 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 4 ms 1684 KB Output is correct
25 Correct 3 ms 1364 KB Output is correct
26 Correct 2 ms 1364 KB Output is correct
27 Correct 2 ms 1308 KB Output is correct
28 Correct 5 ms 2324 KB Output is correct
29 Correct 11 ms 3812 KB Output is correct
30 Correct 4 ms 1748 KB Output is correct
31 Correct 7 ms 2480 KB Output is correct
32 Correct 6 ms 2192 KB Output is correct
33 Correct 34 ms 6688 KB Output is correct
34 Correct 27 ms 6660 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 984 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 1036 KB Output is correct
6 Correct 1 ms 984 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 1036 KB Output is correct
10 Correct 1 ms 1036 KB Output is correct
11 Correct 2 ms 1240 KB Output is correct
12 Correct 1 ms 984 KB Output is correct
13 Correct 1 ms 1048 KB Output is correct
14 Correct 2 ms 1300 KB Output is correct
15 Correct 2 ms 1368 KB Output is correct
16 Correct 1 ms 984 KB Output is correct
17 Correct 4 ms 1644 KB Output is correct
18 Correct 2 ms 984 KB Output is correct
19 Correct 1 ms 1040 KB Output is correct
20 Correct 1 ms 1112 KB Output is correct
21 Correct 1 ms 1044 KB Output is correct
22 Correct 1 ms 988 KB Output is correct
23 Correct 2 ms 1372 KB Output is correct
24 Correct 5 ms 1700 KB Output is correct
25 Correct 3 ms 1348 KB Output is correct
26 Correct 3 ms 1376 KB Output is correct
27 Correct 2 ms 1376 KB Output is correct
28 Correct 7 ms 2340 KB Output is correct
29 Correct 13 ms 3860 KB Output is correct
30 Correct 4 ms 1760 KB Output is correct
31 Correct 7 ms 2564 KB Output is correct
32 Correct 5 ms 2268 KB Output is correct
33 Correct 24 ms 6600 KB Output is correct
34 Correct 24 ms 6672 KB Output is correct
35 Correct 27 ms 6408 KB Output is correct
36 Correct 5 ms 1888 KB Output is correct
37 Correct 45 ms 8788 KB Output is correct
38 Correct 46 ms 8484 KB Output is correct
39 Correct 55 ms 8432 KB Output is correct
40 Correct 62 ms 8532 KB Output is correct
41 Correct 45 ms 8524 KB Output is correct
42 Correct 6 ms 1664 KB Output is correct
43 Correct 6 ms 1620 KB Output is correct
44 Correct 5 ms 1492 KB Output is correct
45 Correct 119 ms 23888 KB Output is correct
46 Correct 151 ms 23836 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1032 KB Output is correct
2 Correct 1 ms 1032 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 1036 KB Output is correct
7 Correct 1 ms 1036 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 1028 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 2 ms 1172 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 1040 KB Output is correct
14 Correct 3 ms 1296 KB Output is correct
15 Correct 3 ms 1364 KB Output is correct
16 Correct 1 ms 1040 KB Output is correct
17 Correct 4 ms 1748 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 1036 KB Output is correct
22 Correct 1 ms 1040 KB Output is correct
23 Correct 2 ms 1364 KB Output is correct
24 Correct 4 ms 1716 KB Output is correct
25 Correct 3 ms 1364 KB Output is correct
26 Correct 3 ms 1364 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 5 ms 2328 KB Output is correct
29 Correct 12 ms 3872 KB Output is correct
30 Correct 3 ms 1748 KB Output is correct
31 Correct 6 ms 2480 KB Output is correct
32 Correct 5 ms 2188 KB Output is correct
33 Correct 25 ms 6576 KB Output is correct
34 Correct 30 ms 6536 KB Output is correct
35 Correct 29 ms 6396 KB Output is correct
36 Correct 6 ms 1876 KB Output is correct
37 Correct 53 ms 8688 KB Output is correct
38 Correct 51 ms 8424 KB Output is correct
39 Correct 43 ms 8512 KB Output is correct
40 Correct 43 ms 8480 KB Output is correct
41 Correct 50 ms 8444 KB Output is correct
42 Correct 8 ms 1620 KB Output is correct
43 Correct 6 ms 1620 KB Output is correct
44 Correct 5 ms 1492 KB Output is correct
45 Correct 174 ms 23908 KB Output is correct
46 Correct 136 ms 23836 KB Output is correct
47 Correct 416 ms 43580 KB Output is correct
48 Correct 6 ms 1620 KB Output is correct
49 Correct 6 ms 1620 KB Output is correct
50 Correct 4 ms 1424 KB Output is correct
51 Correct 104 ms 15836 KB Output is correct
52 Correct 146 ms 16892 KB Output is correct
53 Correct 28 ms 7012 KB Output is correct
54 Correct 4 ms 1748 KB Output is correct
55 Correct 5 ms 2260 KB Output is correct
56 Correct 12 ms 3504 KB Output is correct
57 Correct 168 ms 21940 KB Output is correct
58 Correct 15 ms 4316 KB Output is correct
59 Correct 23 ms 6444 KB Output is correct
60 Correct 30 ms 7060 KB Output is correct
61 Correct 26 ms 6572 KB Output is correct
62 Correct 191 ms 25196 KB Output is correct
63 Execution timed out 1089 ms 86852 KB Time limit exceeded
64 Halted 0 ms 0 KB -