oj.uz

답안 #239142

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239142 2020-06-14T14:58:43 Z aggu_01000101 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 47868 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];
    map<pair<int, int>, bool> ez;
    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;
                ez[{i, j}] = true;
            }
            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;
                ez[{i, j}] = true;
            }
            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 5 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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 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 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 5 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 7 ms 640 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 8 ms 768 KB Output is correct
15 Correct 7 ms 768 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 5 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 5 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 7 ms 640 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 7 ms 768 KB Output is correct
15 Correct 8 ms 768 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 11 ms 1280 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 384 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 384 KB Output is correct
23 Correct 8 ms 768 KB Output is correct
24 Correct 10 ms 1280 KB Output is correct
25 Correct 9 ms 896 KB Output is correct
26 Correct 7 ms 896 KB Output is correct
27 Correct 7 ms 768 KB Output is correct
28 Correct 14 ms 1920 KB Output is correct
29 Correct 34 ms 4348 KB Output is correct
30 Correct 12 ms 1536 KB Output is correct
31 Correct 19 ms 2560 KB Output is correct
32 Correct 14 ms 1920 KB Output is correct
33 Correct 72 ms 8180 KB Output is correct
34 Correct 66 ms 8180 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 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 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 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 7 ms 640 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 7 ms 768 KB Output is correct
15 Correct 7 ms 768 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 11 ms 1280 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 384 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 7 ms 768 KB Output is correct
24 Correct 11 ms 1280 KB Output is correct
25 Correct 8 ms 1024 KB Output is correct
26 Correct 7 ms 896 KB Output is correct
27 Correct 7 ms 768 KB Output is correct
28 Correct 14 ms 1920 KB Output is correct
29 Correct 40 ms 4444 KB Output is correct
30 Correct 12 ms 1536 KB Output is correct
31 Correct 21 ms 2560 KB Output is correct
32 Correct 17 ms 1920 KB Output is correct
33 Correct 79 ms 8176 KB Output is correct
34 Correct 68 ms 8180 KB Output is correct
35 Correct 74 ms 7160 KB Output is correct
36 Correct 14 ms 1536 KB Output is correct
37 Correct 131 ms 11512 KB Output is correct
38 Correct 156 ms 11000 KB Output is correct
39 Correct 120 ms 11000 KB Output is correct
40 Correct 145 ms 11000 KB Output is correct
41 Correct 128 ms 10960 KB Output is correct
42 Correct 11 ms 896 KB Output is correct
43 Correct 12 ms 768 KB Output is correct
44 Correct 12 ms 512 KB Output is correct
45 Correct 462 ms 30964 KB Output is correct
46 Correct 415 ms 30964 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 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 4 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 7 ms 640 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 8 ms 768 KB Output is correct
15 Correct 7 ms 768 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 12 ms 1280 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 8 ms 768 KB Output is correct
24 Correct 11 ms 1280 KB Output is correct
25 Correct 9 ms 896 KB Output is correct
26 Correct 8 ms 896 KB Output is correct
27 Correct 7 ms 768 KB Output is correct
28 Correct 14 ms 1920 KB Output is correct
29 Correct 36 ms 4348 KB Output is correct
30 Correct 12 ms 1536 KB Output is correct
31 Correct 19 ms 2560 KB Output is correct
32 Correct 14 ms 1920 KB Output is correct
33 Correct 72 ms 8052 KB Output is correct
34 Correct 82 ms 8188 KB Output is correct
35 Correct 73 ms 7160 KB Output is correct
36 Correct 13 ms 1536 KB Output is correct
37 Correct 154 ms 11512 KB Output is correct
38 Correct 124 ms 11000 KB Output is correct
39 Correct 140 ms 11000 KB Output is correct
40 Correct 129 ms 11000 KB Output is correct
41 Correct 142 ms 11000 KB Output is correct
42 Correct 13 ms 896 KB Output is correct
43 Correct 11 ms 768 KB Output is correct
44 Correct 11 ms 640 KB Output is correct
45 Correct 486 ms 31092 KB Output is correct
46 Correct 531 ms 31092 KB Output is correct
47 Execution timed out 1020 ms 47868 KB Time limit exceeded
48 Halted 0 ms 0 KB -