oj.uz

Submission #482568

# Submission time Handle Problem Language Result Execution time Memory
482568 2021-10-25T16:01:47 Z beaconmc Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 439 ms 262148 KB 
#include <bits/stdc++.h>

typedef long long ll;
#define FOR(i, x, y) for(ll i=x; i<y; i++)

using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<ll, null_type,greater_equal<int>, rb_tree_tag,tree_order_statistics_node_update>

int n,m;
int a,b,baka,imposter,sus, countz,sussy;

vector<vector<int> > edges[30000];
unordered_set <int> stuff[30000];

int dists[30001];

int main(){
    FOR(i, 0, 30001){
        dists[i] = 2147483647;
    }
    cin >> n>>m;
    FOR(i, 0, m){
        cin >> a >> b;
        if(i==0) imposter = a;
        if (i==1) baka = a;
        stuff[a].insert(b);
    }
    FOR(k, 0, n){
        for(auto&i : stuff[k]){
            sus = k;
            sussy = i;
            countz = 0;
            while ((sus+sussy)<n){
                sus += sussy;
                countz++;
                edges[k].push_back({sus, countz});
                if (stuff[sus].find(i) != stuff[sus].end()) break;
            }
            sus = k;
            countz = 0;
            
            while ((sus-sussy)>=0){
                sus -= sussy;
                countz++;
                edges[k].push_back({sus, countz});
                if (stuff[sus].find(i) != stuff[sus].end()) break;
            }
        }
    }
    int src=imposter;
    
    priority_queue<vector<int>,vector<vector<int>>, greater<vector<int>>> pq;
    dists[src] = 0;
    pq.push({0, src});

	while (pq.size()) {
        vector<int> suz = pq.top();
        int cdist, node;
        pq.pop();
        cdist = suz[0];node=suz[1];
		if (cdist != dists[node]) continue;

		for (auto& i : edges[node]) {
			if (cdist+i[1] < dists[i[0]]) {
				pq.push({dists[i[0]] = cdist+i[1], i[0]});
			}
		}
	}
    if (dists[baka] != 2147483647){
        cout << dists[baka];
    }else{
        cout << -1;
    }
    
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 1 ms 2704 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 1 ms 2764 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 1 ms 2764 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2760 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 1 ms 2764 KB Output is correct
5 Correct 1 ms 2764 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 3 ms 3020 KB Output is correct
12 Correct 2 ms 2764 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 3 ms 3020 KB Output is correct
15 Correct 3 ms 3020 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 1 ms 2764 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 1 ms 2764 KB Output is correct
8 Correct 1 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 3 ms 3040 KB Output is correct
12 Correct 2 ms 2764 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 3 ms 3020 KB Output is correct
15 Correct 3 ms 3020 KB Output is correct
16 Correct 2 ms 3020 KB Output is correct
17 Correct 4 ms 3788 KB Output is correct
18 Correct 2 ms 3148 KB Output is correct
19 Correct 3 ms 3020 KB Output is correct
20 Correct 3 ms 3176 KB Output is correct
21 Correct 2 ms 2892 KB Output is correct
22 Correct 2 ms 3148 KB Output is correct
23 Correct 3 ms 3148 KB Output is correct
24 Correct 4 ms 3660 KB Output is correct
25 Correct 4 ms 3532 KB Output is correct
26 Correct 3 ms 3276 KB Output is correct
27 Correct 3 ms 3148 KB Output is correct
28 Correct 5 ms 4300 KB Output is correct
29 Correct 9 ms 6988 KB Output is correct
30 Correct 4 ms 4164 KB Output is correct
31 Correct 7 ms 5196 KB Output is correct
32 Correct 6 ms 4444 KB Output is correct
33 Correct 15 ms 10248 KB Output is correct
34 Correct 15 ms 10244 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 1 ms 2764 KB Output is correct
3 Correct 3 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 1 ms 2636 KB Output is correct
7 Correct 1 ms 2636 KB Output is correct
8 Correct 1 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 3 ms 3064 KB Output is correct
12 Correct 2 ms 2764 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 3 ms 3020 KB Output is correct
15 Correct 3 ms 3020 KB Output is correct
16 Correct 2 ms 3020 KB Output is correct
17 Correct 4 ms 3788 KB Output is correct
18 Correct 2 ms 3148 KB Output is correct
19 Correct 2 ms 3020 KB Output is correct
20 Correct 3 ms 3276 KB Output is correct
21 Correct 2 ms 2892 KB Output is correct
22 Correct 2 ms 3148 KB Output is correct
23 Correct 3 ms 3148 KB Output is correct
24 Correct 5 ms 3660 KB Output is correct
25 Correct 4 ms 3532 KB Output is correct
26 Correct 3 ms 3276 KB Output is correct
27 Correct 3 ms 3148 KB Output is correct
28 Correct 5 ms 4300 KB Output is correct
29 Correct 9 ms 6988 KB Output is correct
30 Correct 5 ms 4172 KB Output is correct
31 Correct 6 ms 5196 KB Output is correct
32 Correct 5 ms 4548 KB Output is correct
33 Correct 15 ms 10248 KB Output is correct
34 Correct 14 ms 10364 KB Output is correct
35 Correct 27 ms 9636 KB Output is correct
36 Correct 6 ms 3916 KB Output is correct
37 Correct 39 ms 15168 KB Output is correct
38 Correct 38 ms 13740 KB Output is correct
39 Correct 38 ms 14020 KB Output is correct
40 Correct 38 ms 13892 KB Output is correct
41 Correct 38 ms 13868 KB Output is correct
42 Correct 13 ms 3412 KB Output is correct
43 Correct 13 ms 3148 KB Output is correct
44 Correct 13 ms 3312 KB Output is correct
45 Correct 56 ms 30240 KB Output is correct
46 Correct 56 ms 30244 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 1 ms 2764 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 3 ms 3020 KB Output is correct
12 Correct 2 ms 2764 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 3 ms 3020 KB Output is correct
15 Correct 3 ms 3020 KB Output is correct
16 Correct 2 ms 2920 KB Output is correct
17 Correct 4 ms 3788 KB Output is correct
18 Correct 3 ms 3148 KB Output is correct
19 Correct 2 ms 3020 KB Output is correct
20 Correct 4 ms 3276 KB Output is correct
21 Correct 2 ms 2892 KB Output is correct
22 Correct 2 ms 3148 KB Output is correct
23 Correct 3 ms 3148 KB Output is correct
24 Correct 4 ms 3660 KB Output is correct
25 Correct 6 ms 3532 KB Output is correct
26 Correct 3 ms 3276 KB Output is correct
27 Correct 3 ms 3148 KB Output is correct
28 Correct 5 ms 4300 KB Output is correct
29 Correct 10 ms 6988 KB Output is correct
30 Correct 4 ms 4172 KB Output is correct
31 Correct 6 ms 5196 KB Output is correct
32 Correct 5 ms 4452 KB Output is correct
33 Correct 16 ms 10248 KB Output is correct
34 Correct 15 ms 10248 KB Output is correct
35 Correct 28 ms 9544 KB Output is correct
36 Correct 6 ms 3920 KB Output is correct
37 Correct 35 ms 15048 KB Output is correct
38 Correct 42 ms 13708 KB Output is correct
39 Correct 40 ms 13944 KB Output is correct
40 Correct 40 ms 13904 KB Output is correct
41 Correct 38 ms 13896 KB Output is correct
42 Correct 13 ms 3320 KB Output is correct
43 Correct 14 ms 3200 KB Output is correct
44 Correct 12 ms 3276 KB Output is correct
45 Correct 56 ms 30184 KB Output is correct
46 Correct 56 ms 30180 KB Output is correct
47 Correct 118 ms 55116 KB Output is correct
48 Correct 43 ms 18044 KB Output is correct
49 Correct 35 ms 12796 KB Output is correct
50 Correct 27 ms 12372 KB Output is correct
51 Correct 100 ms 27256 KB Output is correct
52 Correct 112 ms 29920 KB Output is correct
53 Correct 48 ms 13288 KB Output is correct
54 Correct 6 ms 5128 KB Output is correct
55 Correct 11 ms 8196 KB Output is correct
56 Correct 32 ms 10972 KB Output is correct
57 Correct 124 ms 51256 KB Output is correct
58 Correct 21 ms 8964 KB Output is correct
59 Correct 28 ms 10476 KB Output is correct
60 Correct 33 ms 14196 KB Output is correct
61 Correct 29 ms 10000 KB Output is correct
62 Correct 94 ms 35652 KB Output is correct
63 Correct 287 ms 138344 KB Output is correct
64 Correct 318 ms 165772 KB Output is correct
65 Correct 439 ms 236300 KB Output is correct
66 Runtime error 262 ms 262148 KB Execution killed with signal 9
67 Halted 0 ms 0 KB -