Submission #482791

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
482791	2021-10-26T10:48:57 Z	beaconmc	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	100 / 100	206 ms	67500 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<pair<int, int>> edges[30000];
set <int> stuff[30000];
 
int dists[30001];
 
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    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(make_pair(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(make_pair(sus, countz));
                if (stuff[sus].find(i) != stuff[sus].end()) break;
            }
        }
    }
    int src=imposter;
    
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    dists[src] = 0;
    pq.push({0, src});
 
	while (pq.size()) {
        int cdist, node;
        pair<int, int> suz = pq.top();
        cdist = suz.first; node=suz.second;
        pq.pop();
		if (cdist != dists[node]) continue;
 
		for (auto& i : edges[node]) {
			if (cdist+i.second < dists[i.first]) {
				pq.push({dists[i.first] = cdist+i.second, i.first});
			}
		}
	}
    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	2520 KB	Output is correct
3	Correct	2 ms	2504 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

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	1 ms	2508 KB	Output is correct
8	Correct	2 ms	2516 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	2636 KB	Output is correct
12	Correct	3 ms	2508 KB	Output is correct
13	Correct	3 ms	2508 KB	Output is correct
14	Correct	2 ms	2636 KB	Output is correct
15	Correct	2 ms	2636 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	2 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	2508 KB	Output is correct
8	Correct	1 ms	2508 KB	Output is correct
9	Correct	2 ms	2536 KB	Output is correct
10	Correct	2 ms	2508 KB	Output is correct
11	Correct	2 ms	2636 KB	Output is correct
12	Correct	3 ms	2508 KB	Output is correct
13	Correct	2 ms	2508 KB	Output is correct
14	Correct	2 ms	2636 KB	Output is correct
15	Correct	2 ms	2636 KB	Output is correct
16	Correct	1 ms	2508 KB	Output is correct
17	Correct	2 ms	2764 KB	Output is correct
18	Correct	2 ms	2636 KB	Output is correct
19	Correct	1 ms	2508 KB	Output is correct
20	Correct	2 ms	2636 KB	Output is correct
21	Correct	3 ms	2508 KB	Output is correct
22	Correct	3 ms	2636 KB	Output is correct
23	Correct	2 ms	2636 KB	Output is correct
24	Correct	3 ms	2764 KB	Output is correct
25	Correct	3 ms	2764 KB	Output is correct
26	Correct	2 ms	2636 KB	Output is correct
27	Correct	2 ms	2636 KB	Output is correct
28	Correct	3 ms	2764 KB	Output is correct
29	Correct	6 ms	3276 KB	Output is correct
30	Correct	2 ms	2764 KB	Output is correct
31	Correct	3 ms	3020 KB	Output is correct
32	Correct	2 ms	2892 KB	Output is correct
33	Correct	6 ms	4044 KB	Output is correct
34	Correct	6 ms	4044 KB	Output is correct

Subtask #4
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2508 KB	Output is correct
2	Correct	2 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	2 ms	2508 KB	Output is correct
6	Correct	2 ms	2508 KB	Output is correct
7	Correct	2 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	1 ms	2508 KB	Output is correct
11	Correct	2 ms	2636 KB	Output is correct
12	Correct	1 ms	2508 KB	Output is correct
13	Correct	2 ms	2508 KB	Output is correct
14	Correct	3 ms	2636 KB	Output is correct
15	Correct	3 ms	2636 KB	Output is correct
16	Correct	2 ms	2520 KB	Output is correct
17	Correct	2 ms	2764 KB	Output is correct
18	Correct	2 ms	2636 KB	Output is correct
19	Correct	2 ms	2508 KB	Output is correct
20	Correct	3 ms	2636 KB	Output is correct
21	Correct	2 ms	2508 KB	Output is correct
22	Correct	1 ms	2636 KB	Output is correct
23	Correct	2 ms	2636 KB	Output is correct
24	Correct	3 ms	2764 KB	Output is correct
25	Correct	3 ms	2764 KB	Output is correct
26	Correct	2 ms	2636 KB	Output is correct
27	Correct	3 ms	2636 KB	Output is correct
28	Correct	2 ms	2764 KB	Output is correct
29	Correct	5 ms	3276 KB	Output is correct
30	Correct	2 ms	2764 KB	Output is correct
31	Correct	3 ms	3020 KB	Output is correct
32	Correct	3 ms	2892 KB	Output is correct
33	Correct	6 ms	4044 KB	Output is correct
34	Correct	7 ms	4044 KB	Output is correct
35	Correct	15 ms	4828 KB	Output is correct
36	Correct	3 ms	2892 KB	Output is correct
37	Correct	16 ms	5508 KB	Output is correct
38	Correct	25 ms	5708 KB	Output is correct
39	Correct	26 ms	5668 KB	Output is correct
40	Correct	18 ms	5644 KB	Output is correct
41	Correct	19 ms	5668 KB	Output is correct
42	Correct	5 ms	2636 KB	Output is correct
43	Correct	5 ms	2636 KB	Output is correct
44	Correct	5 ms	2596 KB	Output is correct
45	Correct	21 ms	8460 KB	Output is correct
46	Correct	21 ms	8364 KB	Output is correct

Subtask #5
43.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	2 ms	2508 KB	Output is correct
4	Correct	1 ms	2508 KB	Output is correct
5	Correct	2 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	1 ms	2508 KB	Output is correct
10	Correct	2 ms	2508 KB	Output is correct
11	Correct	2 ms	2636 KB	Output is correct
12	Correct	1 ms	2508 KB	Output is correct
13	Correct	2 ms	2508 KB	Output is correct
14	Correct	2 ms	2636 KB	Output is correct
15	Correct	2 ms	2636 KB	Output is correct
16	Correct	1 ms	2508 KB	Output is correct
17	Correct	2 ms	2764 KB	Output is correct
18	Correct	2 ms	2636 KB	Output is correct
19	Correct	2 ms	2508 KB	Output is correct
20	Correct	2 ms	2636 KB	Output is correct
21	Correct	2 ms	2508 KB	Output is correct
22	Correct	3 ms	2636 KB	Output is correct
23	Correct	2 ms	2584 KB	Output is correct
24	Correct	4 ms	2764 KB	Output is correct
25	Correct	2 ms	2764 KB	Output is correct
26	Correct	3 ms	2636 KB	Output is correct
27	Correct	2 ms	2636 KB	Output is correct
28	Correct	2 ms	2764 KB	Output is correct
29	Correct	4 ms	3276 KB	Output is correct
30	Correct	3 ms	2860 KB	Output is correct
31	Correct	3 ms	3148 KB	Output is correct
32	Correct	2 ms	2892 KB	Output is correct
33	Correct	6 ms	4044 KB	Output is correct
34	Correct	6 ms	4044 KB	Output is correct
35	Correct	15 ms	4940 KB	Output is correct
36	Correct	3 ms	2892 KB	Output is correct
37	Correct	16 ms	5452 KB	Output is correct
38	Correct	19 ms	5612 KB	Output is correct
39	Correct	19 ms	5688 KB	Output is correct
40	Correct	19 ms	5684 KB	Output is correct
41	Correct	22 ms	5700 KB	Output is correct
42	Correct	7 ms	2636 KB	Output is correct
43	Correct	5 ms	2636 KB	Output is correct
44	Correct	5 ms	2636 KB	Output is correct
45	Correct	21 ms	8420 KB	Output is correct
46	Correct	20 ms	8368 KB	Output is correct
47	Correct	50 ms	12744 KB	Output is correct
48	Correct	16 ms	5936 KB	Output is correct
49	Correct	13 ms	4940 KB	Output is correct
50	Correct	9 ms	4752 KB	Output is correct
51	Correct	33 ms	8008 KB	Output is correct
52	Correct	46 ms	8352 KB	Output is correct
53	Correct	16 ms	5496 KB	Output is correct
54	Correct	3 ms	3020 KB	Output is correct
55	Correct	4 ms	3400 KB	Output is correct
56	Correct	10 ms	4812 KB	Output is correct
57	Correct	31 ms	11600 KB	Output is correct
58	Correct	7 ms	3524 KB	Output is correct
59	Correct	9 ms	3912 KB	Output is correct
60	Correct	10 ms	4488 KB	Output is correct
61	Correct	9 ms	3916 KB	Output is correct
62	Correct	21 ms	9032 KB	Output is correct
63	Correct	71 ms	26444 KB	Output is correct
64	Correct	72 ms	29540 KB	Output is correct
65	Correct	95 ms	39220 KB	Output is correct
66	Correct	206 ms	67500 KB	Output is correct
67	Correct	176 ms	67496 KB	Output is correct

Submission #482791

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 43.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
43.0 / 43.0