oj.uz

답안 #239145

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239145 2020-06-14T15:02:20 Z aggu_01000101 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 86628 KB 
#include <bits/stdc++.h>
#define int long long
#define INF 1000000000000000
#define lchild(i) (i*2 + 1)
#define rchild(i) (i*2 + 2)
#define mid(l, u) ((l+u)/2)
#define x(p) p.first
#define y(p) p.second
#define MOD 998244353
int n, m;
using namespace std;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>m;
    int s = 0, t= 0;
    vector<int> adj[n];
    unordered_map<int, bool> ez[n];
    for(int i = 0;i<m;i++){
        int b, p;
        cin>>b>>p;
        if(!ez[b][p]) adj[b].push_back(p);
        ez[b][p] = true;
        if(i==0) s = b;
        if(i==1) t = b;
    }
    int dist[n];
    for(int i = 0;i<n;i++) dist[i] = INF;
    dist[s] = 0;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    pq.push({0, s});
    while(!pq.empty()){
        pair<int, int> curr = pq.top();
        pq.pop();
        if(curr.first != dist[curr.second]) continue;
        for(int j: adj[curr.second]){
            int len = 0;
            for(int i = curr.second + j;i<n;i+=j){
                len++;
                if(curr.first + len < dist[i]){
                    dist[i] = curr.first + len;
                    pq.push({dist[i], i});
                }
                if(ez[i][j]) goto second;
            }
            second:
            len = 0;
            for(int i = curr.second - j;i>=0;i-=j){
                len++;
                if(curr.first + len < dist[i]){
                    dist[i] = curr.first + len;
                    pq.push({dist[i], i});
                }
                if(ez[i][j]) goto end;
            }
            end:
            continue;
        }
    }
    if(dist[t]==INF) dist[t] = -1;
    cout<<dist[t]<<"\n";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 8 ms 1152 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 7 ms 1152 KB Output is correct
25 Correct 7 ms 896 KB Output is correct
26 Correct 7 ms 896 KB Output is correct
27 Correct 7 ms 896 KB Output is correct
28 Correct 8 ms 1664 KB Output is correct
29 Correct 15 ms 3196 KB Output is correct
30 Correct 8 ms 1408 KB Output is correct
31 Correct 11 ms 2176 KB Output is correct
32 Correct 9 ms 1664 KB Output is correct
33 Correct 42 ms 5748 KB Output is correct
34 Correct 26 ms 5756 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 308 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 640 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 1152 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 9 ms 1152 KB Output is correct
25 Correct 7 ms 896 KB Output is correct
26 Correct 6 ms 896 KB Output is correct
27 Correct 6 ms 896 KB Output is correct
28 Correct 9 ms 1536 KB Output is correct
29 Correct 15 ms 3196 KB Output is correct
30 Correct 10 ms 1408 KB Output is correct
31 Correct 12 ms 2176 KB Output is correct
32 Correct 9 ms 1664 KB Output is correct
33 Correct 29 ms 5756 KB Output is correct
34 Correct 39 ms 5756 KB Output is correct
35 Correct 30 ms 5112 KB Output is correct
36 Correct 9 ms 1408 KB Output is correct
37 Correct 82 ms 8696 KB Output is correct
38 Correct 107 ms 8184 KB Output is correct
39 Correct 59 ms 8188 KB Output is correct
40 Correct 68 ms 8056 KB Output is correct
41 Correct 98 ms 8056 KB Output is correct
42 Correct 11 ms 896 KB Output is correct
43 Correct 10 ms 896 KB Output is correct
44 Correct 9 ms 768 KB Output is correct
45 Correct 200 ms 21492 KB Output is correct
46 Correct 321 ms 21364 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 288 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 8 ms 1152 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 7 ms 1152 KB Output is correct
25 Correct 7 ms 1024 KB Output is correct
26 Correct 6 ms 896 KB Output is correct
27 Correct 6 ms 896 KB Output is correct
28 Correct 11 ms 1536 KB Output is correct
29 Correct 15 ms 3196 KB Output is correct
30 Correct 8 ms 1408 KB Output is correct
31 Correct 11 ms 2176 KB Output is correct
32 Correct 8 ms 1664 KB Output is correct
33 Correct 27 ms 5756 KB Output is correct
34 Correct 25 ms 5756 KB Output is correct
35 Correct 30 ms 5112 KB Output is correct
36 Correct 9 ms 1280 KB Output is correct
37 Correct 62 ms 8696 KB Output is correct
38 Correct 75 ms 8092 KB Output is correct
39 Correct 65 ms 8184 KB Output is correct
40 Correct 55 ms 8056 KB Output is correct
41 Correct 58 ms 8056 KB Output is correct
42 Correct 11 ms 896 KB Output is correct
43 Correct 12 ms 896 KB Output is correct
44 Correct 10 ms 640 KB Output is correct
45 Correct 186 ms 21364 KB Output is correct
46 Correct 252 ms 21492 KB Output is correct
47 Correct 383 ms 33644 KB Output is correct
48 Correct 16 ms 3968 KB Output is correct
49 Correct 16 ms 4072 KB Output is correct
50 Correct 18 ms 3968 KB Output is correct
51 Correct 158 ms 18796 KB Output is correct
52 Correct 179 ms 19816 KB Output is correct
53 Correct 41 ms 8556 KB Output is correct
54 Correct 10 ms 4092 KB Output is correct
55 Correct 11 ms 4604 KB Output is correct
56 Correct 22 ms 5760 KB Output is correct
57 Correct 142 ms 21612 KB Output is correct
58 Correct 22 ms 6524 KB Output is correct
59 Correct 39 ms 7804 KB Output is correct
60 Correct 37 ms 8956 KB Output is correct
61 Correct 36 ms 8312 KB Output is correct
62 Correct 231 ms 25756 KB Output is correct
63 Execution timed out 1099 ms 86628 KB Time limit exceeded
64 Halted 0 ms 0 KB -