Submission #494267

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
494267	2021-12-14T23:14:48 Z	aryan12	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	974 ms	3528 KB

skyscraper

#include <bits/stdc++.h>
using namespace std;
#define int long long

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

const int INF = 1e15;

void Solve() {
	int n, m;
	cin >> n >> m;
	vector<int> pos[n + 1];
	vector<pair<int, int> > doge(m + 1);
	for(int i = 1; i <= m; i++) {
		cin >> doge[i].first >> doge[i].second;
		doge[i].first++;
		pos[doge[i].first].push_back(i);
	}
	priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq;
	int dist[n + 1];
	for(int i = 0; i <= n; i++) {
		dist[i] = INF;
	}
	dist[doge[1].first] = 0;
	pq.push({dist[doge[1].first], doge[1].first});
	while(!pq.empty()) {
		int cur_dist = pq.top().first, cur_skyskraper = pq.top().second;
		pq.pop();
		if(cur_dist > dist[cur_skyskraper]) {
			continue;
		}
		for(int i = 0; i < pos[cur_skyskraper].size(); i++) {
			int jump = doge[pos[cur_skyskraper][i]].second, cnt = 1;
			for(int j = cur_skyskraper - jump; j > 0; j -= jump) {
				if(dist[j] > dist[cur_skyskraper] + cnt) {
					dist[j] = dist[cur_skyskraper] + cnt;
					if(pos[j].size() != 0) {
						pq.push({dist[j], j});
					}
				}
				cnt++;
			}
			cnt = 1;
			for(int j = cur_skyskraper + jump; j <= n; j += jump) {
				if(dist[j] > dist[cur_skyskraper] + cnt) {
					dist[j] = dist[cur_skyskraper] + cnt;
					if(pos[j].size() != 0) {
						pq.push({dist[j], j});
					}
				}
				cnt++;
			}
		}
	}
	if(dist[doge[2].first] == INF) {
		cout << "-1\n";
	}
	else {
		cout << dist[doge[2].first] << "\n";
	}
}

int32_t main() {
	auto begin = std::chrono::high_resolution_clock::now();
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) {
		Solve();
	}
	auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
	return 0;
}

Compilation message

skyscraper.cpp: In function 'void Solve()':
skyscraper.cpp:32:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |   for(int i = 0; i < pos[cur_skyskraper].size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Correct	204 KB	Output is correct
5	Correct	204 KB	Output is correct
6	Correct	204 KB	Output is correct
7	Correct	204 KB	Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	6 ms	528 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	460 KB	Output is correct
25	Correct	1 ms	460 KB	Output is correct
26	Correct	5 ms	332 KB	Output is correct
27	Correct	4 ms	332 KB	Output is correct
28	Correct	1 ms	460 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	0 ms	332 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	6 ms	1228 KB	Output is correct
36	Correct	2 ms	460 KB	Output is correct
37	Correct	5 ms	1180 KB	Output is correct
38	Correct	7 ms	1484 KB	Output is correct
39	Correct	7 ms	1460 KB	Output is correct
40	Correct	7 ms	1484 KB	Output is correct
41	Correct	9 ms	1484 KB	Output is correct
42	Correct	70 ms	1228 KB	Output is correct
43	Correct	66 ms	1228 KB	Output is correct
44	Correct	68 ms	1232 KB	Output is correct
45	Correct	7 ms	1228 KB	Output is correct
46	Correct	5 ms	1228 KB	Output is correct

Subtask #5
43.0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	5 ms	460 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	460 KB	Output is correct
25	Correct	1 ms	460 KB	Output is correct
26	Correct	5 ms	332 KB	Output is correct
27	Correct	7 ms	332 KB	Output is correct
28	Correct	1 ms	460 KB	Output is correct
29	Correct	2 ms	332 KB	Output is correct
30	Correct	0 ms	332 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	7 ms	1228 KB	Output is correct
36	Correct	2 ms	460 KB	Output is correct
37	Correct	6 ms	1100 KB	Output is correct
38	Correct	7 ms	1484 KB	Output is correct
39	Correct	7 ms	1484 KB	Output is correct
40	Correct	7 ms	1484 KB	Output is correct
41	Correct	8 ms	1484 KB	Output is correct
42	Correct	65 ms	1228 KB	Output is correct
43	Correct	68 ms	1228 KB	Output is correct
44	Correct	98 ms	1228 KB	Output is correct
45	Correct	6 ms	1228 KB	Output is correct
46	Correct	5 ms	1228 KB	Output is correct
47	Correct	15 ms	2636 KB	Output is correct
48	Correct	6 ms	1872 KB	Output is correct
49	Correct	5 ms	1868 KB	Output is correct
50	Correct	4 ms	1740 KB	Output is correct
51	Correct	20 ms	3424 KB	Output is correct
52	Correct	19 ms	3528 KB	Output is correct
53	Correct	13 ms	3020 KB	Output is correct
54	Correct	1 ms	1228 KB	Output is correct
55	Correct	1 ms	1228 KB	Output is correct
56	Correct	950 ms	3280 KB	Output is correct
57	Correct	12 ms	1740 KB	Output is correct
58	Correct	974 ms	2216 KB	Output is correct
59	Correct	941 ms	2316 KB	Output is correct
60	Correct	918 ms	2376 KB	Output is correct
61	Correct	831 ms	2340 KB	Output is correct
62	Correct	9 ms	2892 KB	Output is correct
63	Correct	11 ms	2380 KB	Output is correct
64	Correct	11 ms	2376 KB	Output is correct
65	Correct	15 ms	2344 KB	Output is correct
66	Correct	17 ms	2256 KB	Output is correct
67	Correct	17 ms	2384 KB	Output is correct

Submission #494267

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