Submission #299864

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
299864	2020-09-15T22:04:14 Z	FlashGamezzz	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	951 ms	3700 KB

skyscraper

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <unordered_set>
 
using namespace std;
 
bool done[30000] = {};
int n, m, d0, d1, dists[30000] = {}, ans = -1;
vector<int> doges[30000];
priority_queue<pair<int, int> > pq;
 
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> m;
	for (int i = 0; i < m; i++){
		int a, b; cin >> a >> b;
		if (i == 0) d0 = a;
		if (i == 1) d1 = a;
		doges[a].push_back(b);
	}
	for (int i = 0; i < n; i++){
		dists[i] = 1000000000;
	}
	pq.push(make_pair(0, d0));
	dists[d0] = 0;
	while (pq.size() > 0){
		int i = pq.top().second; pq.pop();
		if (done[i]){
			continue;
		}
		if (i == d1){
			ans = dists[i];
			break;
		}
		for (int p : doges[i]){
            for (int j=i+p, add = 1; j<n; j+= p, add++) if (dists[i]+add < dists[j]) {
                dists[j] = min(dists[j], dists[i]+add);
                pq.push(make_pair(-dists[j], j));
            }
            for (int j=i-p, add = 1; j>= 0; j-= p, add++) if (dists[i]+add < dists[j]) {
                dists[j] = min(dists[j], dists[i]+add);
                pq.push(make_pair(-dists[j], j));
            }
		}
		done[i] = true;
	}
	cout << ans << endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1024 KB	Output is correct
2	Correct	1 ms	1024 KB	Output is correct
3	Correct	1 ms	1024 KB	Output is correct
4	Correct	1 ms	1024 KB	Output is correct
5	Correct	1 ms	1024 KB	Output is correct
6	Correct	1 ms	1024 KB	Output is correct
7	Correct	1 ms	1024 KB	Output is correct
8	Correct	1 ms	1024 KB	Output is correct
9	Correct	1 ms	1024 KB	Output is correct
10	Correct	1 ms	1024 KB	Output is correct
11	Correct	1 ms	1024 KB	Output is correct
12	Correct	1 ms	1024 KB	Output is correct
13	Correct	1 ms	1024 KB	Output is correct
14	Correct	1 ms	1024 KB	Output is correct
15	Correct	1 ms	1024 KB	Output is correct
16	Correct	1 ms	1024 KB	Output is correct
17	Correct	2 ms	1152 KB	Output is correct
18	Correct	1 ms	1152 KB	Output is correct
19	Correct	1 ms	1024 KB	Output is correct
20	Correct	5 ms	1152 KB	Output is correct
21	Correct	1 ms	1024 KB	Output is correct
22	Correct	1 ms	1024 KB	Output is correct
23	Correct	1 ms	1152 KB	Output is correct
24	Correct	2 ms	1152 KB	Output is correct
25	Correct	2 ms	1152 KB	Output is correct
26	Correct	1 ms	1152 KB	Output is correct
27	Correct	1 ms	1152 KB	Output is correct
28	Correct	2 ms	1152 KB	Output is correct
29	Correct	2 ms	1152 KB	Output is correct
30	Correct	2 ms	1152 KB	Output is correct
31	Correct	2 ms	1152 KB	Output is correct
32	Correct	2 ms	1152 KB	Output is correct
33	Correct	2 ms	1152 KB	Output is correct
34	Correct	2 ms	1280 KB	Output is correct

Subtask #4
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1024 KB	Output is correct
2	Correct	1 ms	1024 KB	Output is correct
3	Correct	1 ms	1024 KB	Output is correct
4	Correct	1 ms	1024 KB	Output is correct
5	Correct	1 ms	1024 KB	Output is correct
6	Correct	1 ms	1024 KB	Output is correct
7	Correct	1 ms	1024 KB	Output is correct
8	Correct	1 ms	1024 KB	Output is correct
9	Correct	1 ms	1024 KB	Output is correct
10	Correct	1 ms	1024 KB	Output is correct
11	Correct	1 ms	1024 KB	Output is correct
12	Correct	1 ms	1024 KB	Output is correct
13	Correct	1 ms	1024 KB	Output is correct
14	Correct	1 ms	1024 KB	Output is correct
15	Correct	1 ms	1024 KB	Output is correct
16	Correct	1 ms	1024 KB	Output is correct
17	Correct	2 ms	1152 KB	Output is correct
18	Correct	1 ms	1152 KB	Output is correct
19	Correct	1 ms	1024 KB	Output is correct
20	Correct	5 ms	1152 KB	Output is correct
21	Correct	1 ms	1024 KB	Output is correct
22	Correct	1 ms	1024 KB	Output is correct
23	Correct	1 ms	1152 KB	Output is correct
24	Correct	2 ms	1152 KB	Output is correct
25	Correct	2 ms	1152 KB	Output is correct
26	Correct	1 ms	1152 KB	Output is correct
27	Correct	1 ms	1152 KB	Output is correct
28	Correct	2 ms	1152 KB	Output is correct
29	Correct	3 ms	1152 KB	Output is correct
30	Correct	2 ms	1152 KB	Output is correct
31	Correct	2 ms	1152 KB	Output is correct
32	Correct	3 ms	1184 KB	Output is correct
33	Correct	2 ms	1152 KB	Output is correct
34	Correct	3 ms	1280 KB	Output is correct
35	Correct	7 ms	1568 KB	Output is correct
36	Correct	2 ms	1152 KB	Output is correct
37	Correct	6 ms	1536 KB	Output is correct
38	Correct	10 ms	1664 KB	Output is correct
39	Correct	7 ms	1536 KB	Output is correct
40	Correct	8 ms	1664 KB	Output is correct
41	Correct	9 ms	1664 KB	Output is correct
42	Correct	6 ms	1536 KB	Output is correct
43	Correct	6 ms	1536 KB	Output is correct
44	Correct	46 ms	1536 KB	Output is correct
45	Correct	8 ms	1536 KB	Output is correct
46	Correct	7 ms	1536 KB	Output is correct

Subtask #5
43.0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1024 KB	Output is correct
2	Correct	1 ms	1024 KB	Output is correct
3	Correct	1 ms	1024 KB	Output is correct
4	Correct	1 ms	1024 KB	Output is correct
5	Correct	1 ms	1024 KB	Output is correct
6	Correct	1 ms	1024 KB	Output is correct
7	Correct	1 ms	1024 KB	Output is correct
8	Correct	1 ms	1024 KB	Output is correct
9	Correct	1 ms	1024 KB	Output is correct
10	Correct	1 ms	1024 KB	Output is correct
11	Correct	1 ms	1024 KB	Output is correct
12	Correct	1 ms	1024 KB	Output is correct
13	Correct	1 ms	1024 KB	Output is correct
14	Correct	1 ms	1024 KB	Output is correct
15	Correct	2 ms	1024 KB	Output is correct
16	Correct	1 ms	1024 KB	Output is correct
17	Correct	2 ms	1152 KB	Output is correct
18	Correct	1 ms	1280 KB	Output is correct
19	Correct	1 ms	1024 KB	Output is correct
20	Correct	5 ms	1152 KB	Output is correct
21	Correct	1 ms	1024 KB	Output is correct
22	Correct	1 ms	1024 KB	Output is correct
23	Correct	2 ms	1152 KB	Output is correct
24	Correct	2 ms	1152 KB	Output is correct
25	Correct	2 ms	1152 KB	Output is correct
26	Correct	1 ms	1152 KB	Output is correct
27	Correct	1 ms	1152 KB	Output is correct
28	Correct	2 ms	1152 KB	Output is correct
29	Correct	2 ms	1152 KB	Output is correct
30	Correct	2 ms	1152 KB	Output is correct
31	Correct	2 ms	1152 KB	Output is correct
32	Correct	2 ms	1152 KB	Output is correct
33	Correct	2 ms	1152 KB	Output is correct
34	Correct	2 ms	1280 KB	Output is correct
35	Correct	7 ms	1536 KB	Output is correct
36	Correct	2 ms	1152 KB	Output is correct
37	Correct	6 ms	1496 KB	Output is correct
38	Correct	9 ms	1708 KB	Output is correct
39	Correct	8 ms	1536 KB	Output is correct
40	Correct	8 ms	1700 KB	Output is correct
41	Correct	9 ms	1664 KB	Output is correct
42	Correct	6 ms	1536 KB	Output is correct
43	Correct	6 ms	1536 KB	Output is correct
44	Correct	46 ms	1536 KB	Output is correct
45	Correct	8 ms	1536 KB	Output is correct
46	Correct	7 ms	1536 KB	Output is correct
47	Correct	10 ms	2300 KB	Output is correct
48	Correct	8 ms	1792 KB	Output is correct
49	Correct	7 ms	1792 KB	Output is correct
50	Correct	5 ms	1664 KB	Output is correct
51	Correct	17 ms	3192 KB	Output is correct
52	Correct	18 ms	2684 KB	Output is correct
53	Correct	11 ms	2304 KB	Output is correct
54	Correct	2 ms	1440 KB	Output is correct
55	Correct	3 ms	1408 KB	Output is correct
56	Correct	782 ms	2804 KB	Output is correct
57	Correct	4 ms	2420 KB	Output is correct
58	Correct	951 ms	1784 KB	Output is correct
59	Correct	8 ms	1792 KB	Output is correct
60	Correct	8 ms	1792 KB	Output is correct
61	Correct	8 ms	1792 KB	Output is correct
62	Correct	12 ms	2432 KB	Output is correct
63	Correct	24 ms	2808 KB	Output is correct
64	Correct	23 ms	2808 KB	Output is correct
65	Correct	26 ms	2808 KB	Output is correct
66	Correct	36 ms	3700 KB	Output is correct
67	Correct	28 ms	3700 KB	Output is correct

Submission #299864

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