oj.uz

답안 #699246

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
699246 2023-02-16T08:52:47 Z nguyentunglam Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 34392 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;
map<pair<int, int>, int> dd;
vector<int> lst[N];
int d[M];
int cnt;
bool mark[N];
int id(int x, int y) {
    if (!dd[{x, y}]) dd[{x, y}] = ++cnt;
    return dd[{x, y}];
}
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:21:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen ("task.inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
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.out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
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".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
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".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 1040 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 1032 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 1036 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 4 ms 1236 KB Output is correct
12 Correct 1 ms 1044 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 5 ms 1364 KB Output is correct
15 Correct 6 ms 1384 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 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 1036 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 2 ms 1036 KB Output is correct
11 Correct 4 ms 1352 KB Output is correct
12 Correct 1 ms 1044 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 5 ms 1448 KB Output is correct
15 Correct 5 ms 1428 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 16 ms 1956 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 2 ms 980 KB Output is correct
20 Correct 2 ms 1180 KB Output is correct
21 Correct 1 ms 1040 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 6 ms 1492 KB Output is correct
24 Correct 12 ms 1844 KB Output is correct
25 Correct 6 ms 1492 KB Output is correct
26 Correct 6 ms 1568 KB Output is correct
27 Correct 5 ms 1436 KB Output is correct
28 Correct 17 ms 2564 KB Output is correct
29 Correct 56 ms 5068 KB Output is correct
30 Correct 13 ms 2160 KB Output is correct
31 Correct 27 ms 3148 KB Output is correct
32 Correct 19 ms 2644 KB Output is correct
33 Correct 163 ms 9028 KB Output is correct
34 Correct 143 ms 8948 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 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 1036 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 4 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 5 ms 1428 KB Output is correct
15 Correct 5 ms 1432 KB Output is correct
16 Correct 1 ms 1044 KB Output is correct
17 Correct 14 ms 1940 KB Output is correct
18 Correct 2 ms 984 KB Output is correct
19 Correct 1 ms 992 KB Output is correct
20 Correct 2 ms 1248 KB Output is correct
21 Correct 2 ms 992 KB Output is correct
22 Correct 2 ms 1052 KB Output is correct
23 Correct 5 ms 1504 KB Output is correct
24 Correct 11 ms 1816 KB Output is correct
25 Correct 6 ms 1572 KB Output is correct
26 Correct 5 ms 1504 KB Output is correct
27 Correct 5 ms 1500 KB Output is correct
28 Correct 17 ms 2604 KB Output is correct
29 Correct 60 ms 5008 KB Output is correct
30 Correct 14 ms 2144 KB Output is correct
31 Correct 30 ms 3148 KB Output is correct
32 Correct 20 ms 2548 KB Output is correct
33 Correct 141 ms 8912 KB Output is correct
34 Correct 140 ms 8912 KB Output is correct
35 Correct 129 ms 8180 KB Output is correct
36 Correct 17 ms 2204 KB Output is correct
37 Correct 242 ms 12812 KB Output is correct
38 Correct 234 ms 12264 KB Output is correct
39 Correct 223 ms 12236 KB Output is correct
40 Correct 222 ms 12168 KB Output is correct
41 Correct 236 ms 12128 KB Output is correct
42 Correct 10 ms 1844 KB Output is correct
43 Correct 9 ms 1704 KB Output is correct
44 Correct 6 ms 1564 KB Output is correct
45 Correct 757 ms 33364 KB Output is correct
46 Correct 710 ms 33368 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 984 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 1036 KB Output is correct
10 Correct 2 ms 1036 KB Output is correct
11 Correct 4 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 5 ms 1428 KB Output is correct
15 Correct 5 ms 1364 KB Output is correct
16 Correct 1 ms 1036 KB Output is correct
17 Correct 15 ms 2072 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 1236 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 1036 KB Output is correct
23 Correct 6 ms 1492 KB Output is correct
24 Correct 11 ms 1876 KB Output is correct
25 Correct 6 ms 1492 KB Output is correct
26 Correct 6 ms 1492 KB Output is correct
27 Correct 5 ms 1428 KB Output is correct
28 Correct 17 ms 2496 KB Output is correct
29 Correct 63 ms 5128 KB Output is correct
30 Correct 13 ms 2184 KB Output is correct
31 Correct 29 ms 3232 KB Output is correct
32 Correct 19 ms 2508 KB Output is correct
33 Correct 156 ms 8968 KB Output is correct
34 Correct 135 ms 9036 KB Output is correct
35 Correct 124 ms 8264 KB Output is correct
36 Correct 16 ms 2244 KB Output is correct
37 Correct 241 ms 12744 KB Output is correct
38 Correct 214 ms 12148 KB Output is correct
39 Correct 218 ms 12332 KB Output is correct
40 Correct 229 ms 12180 KB Output is correct
41 Correct 213 ms 12108 KB Output is correct
42 Correct 10 ms 1876 KB Output is correct
43 Correct 11 ms 1800 KB Output is correct
44 Correct 7 ms 1620 KB Output is correct
45 Correct 730 ms 33356 KB Output is correct
46 Correct 722 ms 33468 KB Output is correct
47 Execution timed out 1079 ms 34392 KB Time limit exceeded
48 Halted 0 ms 0 KB -