oj.uz

Submission #239141

# Submission time Handle Problem Language Result Execution time Memory
239141 2020-06-14T14:55:53 Z aggu_01000101 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 68964 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;
            }
            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

# Verdict Execution time Memory 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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory 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 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 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 512 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 6 ms 768 KB Output is correct
15 Correct 7 ms 768 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory 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 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
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 6 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 10 ms 1280 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 6 ms 512 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 896 KB Output is correct
24 Correct 9 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 6 ms 896 KB Output is correct
28 Correct 11 ms 1920 KB Output is correct
29 Correct 37 ms 4468 KB Output is correct
30 Correct 10 ms 1536 KB Output is correct
31 Correct 15 ms 2560 KB Output is correct
32 Correct 12 ms 1920 KB Output is correct
33 Correct 74 ms 8180 KB Output is correct
34 Correct 52 ms 8180 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 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 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 512 KB Output is correct
11 Correct 6 ms 768 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 13 ms 1408 KB Output is correct
18 Correct 5 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 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 1024 KB Output is correct
26 Correct 7 ms 896 KB Output is correct
27 Correct 7 ms 896 KB Output is correct
28 Correct 13 ms 1920 KB Output is correct
29 Correct 26 ms 4348 KB Output is correct
30 Correct 10 ms 1536 KB Output is correct
31 Correct 16 ms 2560 KB Output is correct
32 Correct 12 ms 2048 KB Output is correct
33 Correct 63 ms 8312 KB Output is correct
34 Correct 54 ms 8120 KB Output is correct
35 Correct 62 ms 7544 KB Output is correct
36 Correct 13 ms 1664 KB Output is correct
37 Correct 184 ms 11768 KB Output is correct
38 Correct 181 ms 11316 KB Output is correct
39 Correct 172 ms 11256 KB Output is correct
40 Correct 108 ms 11384 KB Output is correct
41 Correct 123 ms 11280 KB Output is correct
42 Correct 12 ms 1024 KB Output is correct
43 Correct 12 ms 1024 KB Output is correct
44 Correct 10 ms 768 KB Output is correct
45 Correct 757 ms 31220 KB Output is correct
46 Correct 342 ms 31220 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory 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 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 5 ms 360 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 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 7 ms 896 KB Output is correct
15 Correct 8 ms 768 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 10 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 7 ms 384 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 7 ms 896 KB Output is correct
24 Correct 9 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 896 KB Output is correct
28 Correct 11 ms 1920 KB Output is correct
29 Correct 26 ms 4348 KB Output is correct
30 Correct 10 ms 1536 KB Output is correct
31 Correct 15 ms 2560 KB Output is correct
32 Correct 12 ms 1920 KB Output is correct
33 Correct 52 ms 8180 KB Output is correct
34 Correct 55 ms 8176 KB Output is correct
35 Correct 95 ms 7416 KB Output is correct
36 Correct 13 ms 1664 KB Output is correct
37 Correct 110 ms 11768 KB Output is correct
38 Correct 129 ms 11260 KB Output is correct
39 Correct 113 ms 11256 KB Output is correct
40 Correct 110 ms 11316 KB Output is correct
41 Correct 107 ms 11256 KB Output is correct
42 Correct 11 ms 1024 KB Output is correct
43 Correct 11 ms 1024 KB Output is correct
44 Correct 10 ms 768 KB Output is correct
45 Correct 407 ms 31196 KB Output is correct
46 Correct 338 ms 31236 KB Output is correct
47 Correct 731 ms 47976 KB Output is correct
48 Correct 20 ms 3200 KB Output is correct
49 Correct 20 ms 3200 KB Output is correct
50 Correct 16 ms 2688 KB Output is correct
51 Correct 246 ms 23152 KB Output is correct
52 Correct 269 ms 24812 KB Output is correct
53 Correct 57 ms 8428 KB Output is correct
54 Correct 9 ms 2428 KB Output is correct
55 Correct 13 ms 3068 KB Output is correct
56 Correct 39 ms 4344 KB Output is correct
57 Correct 341 ms 29260 KB Output is correct
58 Correct 28 ms 5756 KB Output is correct
59 Correct 42 ms 7804 KB Output is correct
60 Correct 58 ms 9460 KB Output is correct
61 Correct 43 ms 8564 KB Output is correct
62 Correct 488 ms 33400 KB Output is correct
63 Execution timed out 1096 ms 68964 KB Time limit exceeded
64 Halted 0 ms 0 KB -