oj.uz

답안 #339607

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
339607 2020-12-25T17:26:31 Z eyangch Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 2728 KB 
#include <bits/stdc++.h>

using namespace std;

struct loc{int x; int doge; int d; bool r;};

int N, M;
int b[30000], p[30000];
vector<int> graph[30000];
int dist[30000];

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> N >> M;
    for(int i = 0; i < M; i++){
        cin >> b[i] >> p[i];
        graph[b[i]].push_back(i);
    }
    fill(dist, dist+N, -1);
    deque<loc> q;
    q.push_back({b[0], 0, 0, true});
    q.push_back({b[0], 0, 0, false});
    while(!q.empty()){
        if(~dist[b[1]]) break;
        int x = q.front().x, doge = q.front().doge, d = q.front().d;
        bool r = q.front().r;
        q.pop_front();
        if(x < 0 || x >= N) continue;
        if(!(~dist[x])){
            dist[x] = d;
            for(int i : graph[x]){
                if(i != doge){
                    q.push_front({x, i, d, true});
                    q.push_front({x, i, d, false});
                }
            }
        }
        int dv = p[doge];
        if(!r) dv = -dv;
        q.push_back({x+dv, doge, d+1, r});
    }
    cout << dist[b[1]] << endl;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1004 KB Output is correct
2 Correct 1 ms 1004 KB Output is correct
3 Correct 1 ms 1004 KB Output is correct
4 Correct 1 ms 1004 KB Output is correct
5 Correct 1 ms 1004 KB Output is correct
6 Correct 1 ms 1004 KB Output is correct
7 Correct 1 ms 1004 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1004 KB Output is correct
2 Correct 1 ms 1004 KB Output is correct
3 Correct 1 ms 1004 KB Output is correct
4 Correct 1 ms 1004 KB Output is correct
5 Correct 1 ms 1004 KB Output is correct
6 Correct 1 ms 1004 KB Output is correct
7 Correct 1 ms 1004 KB Output is correct
8 Correct 1 ms 1004 KB Output is correct
9 Correct 1 ms 1004 KB Output is correct
10 Correct 1 ms 1004 KB Output is correct
11 Correct 1 ms 1132 KB Output is correct
12 Correct 1 ms 1132 KB Output is correct
13 Correct 1 ms 1132 KB Output is correct
14 Correct 1 ms 1132 KB Output is correct
15 Correct 1 ms 1132 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1004 KB Output is correct
2 Correct 1 ms 1004 KB Output is correct
3 Correct 1 ms 1004 KB Output is correct
4 Correct 1 ms 1004 KB Output is correct
5 Correct 1 ms 1004 KB Output is correct
6 Correct 1 ms 1004 KB Output is correct
7 Correct 1 ms 1004 KB Output is correct
8 Correct 1 ms 1004 KB Output is correct
9 Correct 1 ms 1004 KB Output is correct
10 Correct 1 ms 1004 KB Output is correct
11 Correct 1 ms 1132 KB Output is correct
12 Correct 1 ms 1132 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 2 ms 1152 KB Output is correct
15 Correct 1 ms 1132 KB Output is correct
16 Correct 1 ms 1152 KB Output is correct
17 Correct 1 ms 1132 KB Output is correct
18 Correct 1 ms 1132 KB Output is correct
19 Correct 1 ms 1132 KB Output is correct
20 Correct 40 ms 1260 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 1 ms 1132 KB Output is correct
23 Correct 1 ms 1132 KB Output is correct
24 Correct 2 ms 1132 KB Output is correct
25 Correct 1 ms 1132 KB Output is correct
26 Correct 1 ms 1132 KB Output is correct
27 Correct 1 ms 1132 KB Output is correct
28 Correct 2 ms 1132 KB Output is correct
29 Correct 2 ms 1132 KB Output is correct
30 Correct 1 ms 1004 KB Output is correct
31 Correct 1 ms 1132 KB Output is correct
32 Correct 1 ms 1132 KB Output is correct
33 Correct 3 ms 1132 KB Output is correct
34 Correct 2 ms 1132 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1004 KB Output is correct
2 Correct 1 ms 1004 KB Output is correct
3 Correct 1 ms 1004 KB Output is correct
4 Correct 1 ms 1004 KB Output is correct
5 Correct 1 ms 1004 KB Output is correct
6 Correct 1 ms 1004 KB Output is correct
7 Correct 1 ms 1004 KB Output is correct
8 Correct 1 ms 1004 KB Output is correct
9 Correct 1 ms 1004 KB Output is correct
10 Correct 1 ms 1132 KB Output is correct
11 Correct 1 ms 1132 KB Output is correct
12 Correct 1 ms 1132 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 2 ms 1132 KB Output is correct
15 Correct 1 ms 1132 KB Output is correct
16 Correct 1 ms 1004 KB Output is correct
17 Correct 1 ms 1132 KB Output is correct
18 Correct 1 ms 1132 KB Output is correct
19 Correct 2 ms 1132 KB Output is correct
20 Correct 40 ms 1260 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 1 ms 1132 KB Output is correct
23 Correct 1 ms 1132 KB Output is correct
24 Correct 2 ms 1132 KB Output is correct
25 Correct 2 ms 1260 KB Output is correct
26 Correct 1 ms 1132 KB Output is correct
27 Correct 1 ms 1132 KB Output is correct
28 Correct 2 ms 1132 KB Output is correct
29 Correct 2 ms 1132 KB Output is correct
30 Correct 1 ms 1004 KB Output is correct
31 Correct 1 ms 1132 KB Output is correct
32 Correct 1 ms 1132 KB Output is correct
33 Correct 3 ms 1132 KB Output is correct
34 Correct 2 ms 1132 KB Output is correct
35 Correct 8 ms 2156 KB Output is correct
36 Correct 2 ms 1132 KB Output is correct
37 Correct 6 ms 1900 KB Output is correct
38 Correct 8 ms 1900 KB Output is correct
39 Correct 7 ms 1516 KB Output is correct
40 Correct 8 ms 1644 KB Output is correct
41 Correct 9 ms 2284 KB Output is correct
42 Correct 5 ms 1516 KB Output is correct
43 Correct 6 ms 2412 KB Output is correct
44 Correct 47 ms 2412 KB Output is correct
45 Correct 14 ms 2412 KB Output is correct
46 Correct 11 ms 2412 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1004 KB Output is correct
2 Correct 1 ms 1004 KB Output is correct
3 Correct 1 ms 1004 KB Output is correct
4 Correct 1 ms 1004 KB Output is correct
5 Correct 1 ms 1004 KB Output is correct
6 Correct 1 ms 1004 KB Output is correct
7 Correct 1 ms 1004 KB Output is correct
8 Correct 1 ms 1004 KB Output is correct
9 Correct 1 ms 1004 KB Output is correct
10 Correct 1 ms 1004 KB Output is correct
11 Correct 1 ms 1132 KB Output is correct
12 Correct 1 ms 1132 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 1 ms 1132 KB Output is correct
15 Correct 1 ms 1132 KB Output is correct
16 Correct 1 ms 1004 KB Output is correct
17 Correct 2 ms 1132 KB Output is correct
18 Correct 1 ms 1132 KB Output is correct
19 Correct 1 ms 1132 KB Output is correct
20 Correct 40 ms 1132 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 1 ms 1132 KB Output is correct
23 Correct 1 ms 1132 KB Output is correct
24 Correct 2 ms 1132 KB Output is correct
25 Correct 1 ms 1132 KB Output is correct
26 Correct 1 ms 1132 KB Output is correct
27 Correct 1 ms 1132 KB Output is correct
28 Correct 2 ms 1132 KB Output is correct
29 Correct 2 ms 1132 KB Output is correct
30 Correct 1 ms 1004 KB Output is correct
31 Correct 2 ms 1132 KB Output is correct
32 Correct 1 ms 1132 KB Output is correct
33 Correct 3 ms 1132 KB Output is correct
34 Correct 2 ms 1132 KB Output is correct
35 Correct 8 ms 2156 KB Output is correct
36 Correct 2 ms 1132 KB Output is correct
37 Correct 6 ms 1900 KB Output is correct
38 Correct 8 ms 1900 KB Output is correct
39 Correct 7 ms 1516 KB Output is correct
40 Correct 8 ms 1644 KB Output is correct
41 Correct 9 ms 2284 KB Output is correct
42 Correct 6 ms 1516 KB Output is correct
43 Correct 7 ms 2412 KB Output is correct
44 Correct 47 ms 2412 KB Output is correct
45 Correct 15 ms 2412 KB Output is correct
46 Correct 11 ms 2412 KB Output is correct
47 Correct 7 ms 1772 KB Output is correct
48 Correct 7 ms 1772 KB Output is correct
49 Correct 7 ms 1772 KB Output is correct
50 Correct 5 ms 1644 KB Output is correct
51 Correct 12 ms 2156 KB Output is correct
52 Correct 12 ms 2156 KB Output is correct
53 Correct 10 ms 2028 KB Output is correct
54 Correct 1 ms 1132 KB Output is correct
55 Correct 1 ms 1132 KB Output is correct
56 Execution timed out 1094 ms 2728 KB Time limit exceeded
57 Halted 0 ms 0 KB -