oj.uz

Submission #482592

# Submission time Handle Problem Language Result Execution time Memory
482592 2021-10-25T17:58:53 Z beaconmc Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 406 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];
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 2508 KB Output is correct
2 Correct 1 ms 2508 KB Output is correct
3 Correct 2 ms 2508 KB Output is correct
4 Correct 2 ms 2508 KB Output is correct
5 Correct 1 ms 2508 KB Output is correct
6 Correct 2 ms 2508 KB Output is correct
7 Correct 1 ms 2508 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2508 KB Output is correct
2 Correct 1 ms 2508 KB Output is correct
3 Correct 1 ms 2508 KB Output is correct
4 Correct 1 ms 2456 KB Output is correct
5 Correct 2 ms 2508 KB Output is correct
6 Correct 1 ms 2508 KB Output is correct
7 Correct 1 ms 2508 KB Output is correct
8 Correct 2 ms 2508 KB Output is correct
9 Correct 1 ms 2508 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 3 ms 2764 KB Output is correct
12 Correct 2 ms 2508 KB Output is correct
13 Correct 2 ms 2508 KB Output is correct
14 Correct 3 ms 2892 KB Output is correct
15 Correct 3 ms 2892 KB Output is correct
16 Correct 3 ms 2764 KB Output is correct
17 Correct 4 ms 3532 KB Output is correct
18 Correct 2 ms 2892 KB Output is correct
19 Correct 2 ms 2764 KB Output is correct
20 Correct 3 ms 2764 KB Output is correct
21 Correct 2 ms 2636 KB Output is correct
22 Correct 2 ms 2764 KB Output is correct
23 Correct 3 ms 2892 KB Output is correct
24 Correct 4 ms 3404 KB Output is correct
25 Correct 4 ms 3148 KB Output is correct
26 Correct 3 ms 3148 KB Output is correct
27 Correct 3 ms 2892 KB Output is correct
28 Correct 5 ms 3916 KB Output is correct
29 Correct 10 ms 6792 KB Output is correct
30 Correct 4 ms 3916 KB Output is correct
31 Correct 6 ms 4940 KB Output is correct
32 Correct 4 ms 4300 KB Output is correct
33 Correct 17 ms 10632 KB Output is correct
34 Correct 17 ms 10632 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2508 KB Output is correct
2 Correct 2 ms 2508 KB Output is correct
3 Correct 1 ms 2416 KB Output is correct
4 Correct 1 ms 2508 KB Output is correct
5 Correct 1 ms 2508 KB Output is correct
6 Correct 1 ms 2508 KB Output is correct
7 Correct 1 ms 2508 KB Output is correct
8 Correct 1 ms 2508 KB Output is correct
9 Correct 1 ms 2508 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 3 ms 2764 KB Output is correct
12 Correct 2 ms 2508 KB Output is correct
13 Correct 2 ms 2508 KB Output is correct
14 Correct 3 ms 2892 KB Output is correct
15 Correct 3 ms 2892 KB Output is correct
16 Correct 2 ms 2764 KB Output is correct
17 Correct 4 ms 3532 KB Output is correct
18 Correct 2 ms 2892 KB Output is correct
19 Correct 2 ms 2764 KB Output is correct
20 Correct 3 ms 2764 KB Output is correct
21 Correct 2 ms 2636 KB Output is correct
22 Correct 2 ms 2764 KB Output is correct
23 Correct 5 ms 2924 KB Output is correct
24 Correct 6 ms 3404 KB Output is correct
25 Correct 4 ms 3148 KB Output is correct
26 Correct 3 ms 3040 KB Output is correct
27 Correct 3 ms 2892 KB Output is correct
28 Correct 4 ms 3916 KB Output is correct
29 Correct 13 ms 6792 KB Output is correct
30 Correct 4 ms 3916 KB Output is correct
31 Correct 6 ms 4940 KB Output is correct
32 Correct 7 ms 4300 KB Output is correct
33 Correct 17 ms 10632 KB Output is correct
34 Correct 17 ms 10632 KB Output is correct
35 Correct 32 ms 9444 KB Output is correct
36 Correct 5 ms 3660 KB Output is correct
37 Correct 37 ms 14788 KB Output is correct
38 Correct 42 ms 13636 KB Output is correct
39 Correct 46 ms 13824 KB Output is correct
40 Correct 43 ms 13700 KB Output is correct
41 Correct 40 ms 13668 KB Output is correct
42 Correct 13 ms 3048 KB Output is correct
43 Correct 13 ms 2920 KB Output is correct
44 Correct 12 ms 2812 KB Output is correct
45 Correct 76 ms 30748 KB Output is correct
46 Correct 74 ms 30784 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2508 KB Output is correct
2 Correct 1 ms 2508 KB Output is correct
3 Correct 1 ms 2508 KB Output is correct
4 Correct 2 ms 2508 KB Output is correct
5 Correct 1 ms 2508 KB Output is correct
6 Correct 1 ms 2508 KB Output is correct
7 Correct 2 ms 2508 KB Output is correct
8 Correct 2 ms 2508 KB Output is correct
9 Correct 2 ms 2508 KB Output is correct
10 Correct 3 ms 2508 KB Output is correct
11 Correct 3 ms 2764 KB Output is correct
12 Correct 2 ms 2508 KB Output is correct
13 Correct 2 ms 2508 KB Output is correct
14 Correct 3 ms 2892 KB Output is correct
15 Correct 3 ms 2892 KB Output is correct
16 Correct 2 ms 2764 KB Output is correct
17 Correct 4 ms 3532 KB Output is correct
18 Correct 2 ms 2892 KB Output is correct
19 Correct 2 ms 2764 KB Output is correct
20 Correct 3 ms 2840 KB Output is correct
21 Correct 2 ms 2648 KB Output is correct
22 Correct 2 ms 2764 KB Output is correct
23 Correct 3 ms 2892 KB Output is correct
24 Correct 4 ms 3404 KB Output is correct
25 Correct 4 ms 3148 KB Output is correct
26 Correct 3 ms 3148 KB Output is correct
27 Correct 3 ms 2892 KB Output is correct
28 Correct 5 ms 3916 KB Output is correct
29 Correct 9 ms 6792 KB Output is correct
30 Correct 4 ms 3916 KB Output is correct
31 Correct 6 ms 4940 KB Output is correct
32 Correct 5 ms 4300 KB Output is correct
33 Correct 19 ms 10584 KB Output is correct
34 Correct 19 ms 10644 KB Output is correct
35 Correct 29 ms 9424 KB Output is correct
36 Correct 7 ms 3632 KB Output is correct
37 Correct 42 ms 14864 KB Output is correct
38 Correct 41 ms 13632 KB Output is correct
39 Correct 42 ms 13736 KB Output is correct
40 Correct 41 ms 13672 KB Output is correct
41 Correct 41 ms 13716 KB Output is correct
42 Correct 13 ms 3148 KB Output is correct
43 Correct 13 ms 2920 KB Output is correct
44 Correct 13 ms 2868 KB Output is correct
45 Correct 62 ms 30736 KB Output is correct
46 Correct 62 ms 30776 KB Output is correct
47 Correct 120 ms 54164 KB Output is correct
48 Correct 37 ms 16584 KB Output is correct
49 Correct 29 ms 11176 KB Output is correct
50 Correct 23 ms 11140 KB Output is correct
51 Correct 92 ms 25464 KB Output is correct
52 Correct 92 ms 28020 KB Output is correct
53 Correct 40 ms 11416 KB Output is correct
54 Correct 6 ms 5000 KB Output is correct
55 Correct 10 ms 7940 KB Output is correct
56 Correct 23 ms 7692 KB Output is correct
57 Correct 103 ms 50656 KB Output is correct
58 Correct 21 ms 8592 KB Output is correct
59 Correct 27 ms 10012 KB Output is correct
60 Correct 31 ms 13728 KB Output is correct
61 Correct 27 ms 9468 KB Output is correct
62 Correct 69 ms 32204 KB Output is correct
63 Correct 266 ms 141428 KB Output is correct
64 Correct 314 ms 168892 KB Output is correct
65 Correct 406 ms 235916 KB Output is correct
66 Runtime error 234 ms 262148 KB Execution killed with signal 9
67 Halted 0 ms 0 KB -