Submission #482567

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
482567	2021-10-25T15:57:53 Z	beaconmc	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	273 ms	262148 KB

skyscraper

#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});
            }
            sus = k;
            countz = 0;
            
            while ((sus-sussy)>=0){
                sus -= sussy;
                countz++;
                edges[k].push_back({sus, countz});
            }
        }
    }
    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	2 ms	2636 KB	Output is correct
2	Correct	1 ms	2764 KB	Output is correct
3	Correct	1 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	2 ms	2636 KB	Output is correct
7	Correct	2 ms	2636 KB	Output is correct

Subtask #2
12.0 / 12.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	2764 KB	Output is correct
5	Correct	2 ms	2636 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	3276 KB	Output is correct
12	Correct	2 ms	2764 KB	Output is correct
13	Correct	5 ms	3276 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	2636 KB	Output is correct
3	Correct	2 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	2 ms	2636 KB	Output is correct
7	Correct	2 ms	2764 KB	Output is correct
8	Correct	1 ms	2764 KB	Output is correct
9	Correct	1 ms	2764 KB	Output is correct
10	Correct	2 ms	2892 KB	Output is correct
11	Correct	3 ms	3276 KB	Output is correct
12	Correct	2 ms	2764 KB	Output is correct
13	Correct	3 ms	3276 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	4260 KB	Output is correct
18	Correct	2 ms	3148 KB	Output is correct
19	Correct	2 ms	3020 KB	Output is correct
20	Correct	242 ms	224648 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	3276 KB	Output is correct
24	Correct	4 ms	3660 KB	Output is correct
25	Correct	4 ms	3532 KB	Output is correct
26	Correct	4 ms	3524 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	4172 KB	Output is correct
31	Correct	6 ms	5196 KB	Output is correct
32	Correct	5 ms	4460 KB	Output is correct
33	Correct	15 ms	10264 KB	Output is correct
34	Correct	15 ms	10248 KB	Output is correct

Subtask #4
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2636 KB	Output is correct
2	Correct	1 ms	2636 KB	Output is correct
3	Correct	1 ms	2636 KB	Output is correct
4	Correct	2 ms	2636 KB	Output is correct
5	Correct	1 ms	2636 KB	Output is correct
6	Correct	2 ms	2764 KB	Output is correct
7	Correct	1 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	2892 KB	Output is correct
11	Correct	3 ms	3276 KB	Output is correct
12	Correct	2 ms	2764 KB	Output is correct
13	Correct	4 ms	3280 KB	Output is correct
14	Correct	3 ms	3020 KB	Output is correct
15	Correct	3 ms	3020 KB	Output is correct
16	Correct	3 ms	3020 KB	Output is correct
17	Correct	5 ms	4172 KB	Output is correct
18	Correct	3 ms	3148 KB	Output is correct
19	Correct	2 ms	3020 KB	Output is correct
20	Correct	241 ms	224660 KB	Output is correct
21	Correct	2 ms	2892 KB	Output is correct
22	Correct	3 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	3404 KB	Output is correct
27	Correct	3 ms	3148 KB	Output is correct
28	Correct	4 ms	4300 KB	Output is correct
29	Correct	12 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	4452 KB	Output is correct
33	Correct	15 ms	10248 KB	Output is correct
34	Correct	18 ms	10376 KB	Output is correct
35	Correct	29 ms	12416 KB	Output is correct
36	Correct	7 ms	4052 KB	Output is correct
37	Correct	36 ms	21316 KB	Output is correct
38	Correct	40 ms	17960 KB	Output is correct
39	Correct	44 ms	19144 KB	Output is correct
40	Correct	40 ms	18380 KB	Output is correct
41	Correct	39 ms	17732 KB	Output is correct
42	Correct	15 ms	3612 KB	Output is correct
43	Correct	14 ms	3404 KB	Output is correct
44	Correct	263 ms	225000 KB	Output is correct
45	Correct	54 ms	30420 KB	Output is correct
46	Correct	52 ms	30336 KB	Output is correct

Subtask #5
0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2764 KB	Output is correct
2	Correct	2 ms	2636 KB	Output is correct
3	Correct	2 ms	2636 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	2 ms	2764 KB	Output is correct
8	Correct	2 ms	2764 KB	Output is correct
9	Correct	2 ms	2668 KB	Output is correct
10	Correct	2 ms	2892 KB	Output is correct
11	Correct	4 ms	3276 KB	Output is correct
12	Correct	2 ms	2764 KB	Output is correct
13	Correct	3 ms	3276 KB	Output is correct
14	Correct	3 ms	3032 KB	Output is correct
15	Correct	3 ms	3020 KB	Output is correct
16	Correct	2 ms	3020 KB	Output is correct
17	Correct	5 ms	4300 KB	Output is correct
18	Correct	3 ms	3148 KB	Output is correct
19	Correct	2 ms	3020 KB	Output is correct
20	Correct	231 ms	224720 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	3776 KB	Output is correct
25	Correct	6 ms	3532 KB	Output is correct
26	Correct	4 ms	3532 KB	Output is correct
27	Correct	3 ms	3148 KB	Output is correct
28	Correct	4 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	7 ms	5196 KB	Output is correct
32	Correct	4 ms	4452 KB	Output is correct
33	Correct	15 ms	10340 KB	Output is correct
34	Correct	17 ms	10248 KB	Output is correct
35	Correct	31 ms	12492 KB	Output is correct
36	Correct	6 ms	4044 KB	Output is correct
37	Correct	35 ms	21328 KB	Output is correct
38	Correct	40 ms	18032 KB	Output is correct
39	Correct	42 ms	19140 KB	Output is correct
40	Correct	40 ms	18372 KB	Output is correct
41	Correct	42 ms	17732 KB	Output is correct
42	Correct	14 ms	3660 KB	Output is correct
43	Correct	13 ms	3404 KB	Output is correct
44	Correct	254 ms	224896 KB	Output is correct
45	Correct	52 ms	30464 KB	Output is correct
46	Correct	55 ms	30464 KB	Output is correct
47	Correct	126 ms	68220 KB	Output is correct
48	Correct	37 ms	18288 KB	Output is correct
49	Correct	29 ms	12868 KB	Output is correct
50	Correct	25 ms	12556 KB	Output is correct
51	Correct	93 ms	31284 KB	Output is correct
52	Correct	93 ms	34036 KB	Output is correct
53	Correct	43 ms	13560 KB	Output is correct
54	Correct	7 ms	5128 KB	Output is correct
55	Correct	11 ms	8196 KB	Output is correct
56	Runtime error	273 ms	262148 KB	Execution killed with signal 9
57	Halted	0 ms	0 KB	-

Submission #482567

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 21.0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
21.0 / 21.0

Subtask #5
0 / 43.0