Submission #695238

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
695238	2023-02-04T20:10:44 Z	NeroZein	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	36 / 100	27 ms	31968 KB

skyscraper

/*
 *    author: NeroZein
 *    created: 04.02.2023 22:58:06
*/
#include <bits/stdc++.h>
#define int long long
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

const int N = 2003; 

int n, m;
int b[N];
int p[N];
int g[N][N];

inline void minSelf(int& x, int y) {
	x = min(x, y); 
}

int cost[N];
inline void dij() {
	priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq; 
	for (int i = 0; i < n; ++i) {
		cost[i] = 1e15;
	}
	cost[b[0]] = 0;
	pq.emplace(0, b[0]);
	while (!pq.empty()) {
		auto src = pq.top(); 
		pq.pop();
		if (src.second == b[1]) {
			cout << src.first << '\n';
			exit(0);
		}
		if (src.first != cost[src.second]) {
			continue; 
		}
		for (int i = 0; i < n; ++i) {
			if (src.first + g[src.second][i] < cost[i]) {
				cost[i] = src.first + g[src.second][i];
				pq.emplace(cost[i], i); 
			}
		}
	}
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			g[i][j] = 1e15;
		}
	}
	for (int i = 0; i < m; ++i) {
		cin >> b[i] >> p[i];
		for (int j = 1; j < n; ++j) {
			int l = b[i] - j * p[i];
			int r = b[i] + j * p[i];
			if (r < n) {
				minSelf(g[b[i]][r], j);
			}
			if (l >= 0) {
				minSelf(g[b[i]][l], j);
			}
		}
	}
	dij();
	cout << -1 << '\n';
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	0 ms	596 KB	Output is correct
10	Correct	1 ms	724 KB	Output is correct
11	Correct	1 ms	724 KB	Output is correct
12	Correct	1 ms	724 KB	Output is correct
13	Correct	1 ms	724 KB	Output is correct
14	Correct	1 ms	724 KB	Output is correct
15	Correct	1 ms	724 KB	Output is correct
16	Correct	1 ms	1364 KB	Output is correct
17	Correct	6 ms	7636 KB	Output is correct
18	Correct	15 ms	27724 KB	Output is correct
19	Correct	14 ms	31700 KB	Output is correct
20	Correct	27 ms	31792 KB	Output is correct
21	Correct	2 ms	3028 KB	Output is correct
22	Correct	13 ms	28244 KB	Output is correct
23	Correct	15 ms	25416 KB	Output is correct
24	Correct	21 ms	30136 KB	Output is correct
25	Correct	19 ms	31700 KB	Output is correct
26	Correct	22 ms	31720 KB	Output is correct
27	Correct	24 ms	31716 KB	Output is correct
28	Correct	23 ms	31720 KB	Output is correct
29	Correct	19 ms	31964 KB	Output is correct
30	Correct	19 ms	31904 KB	Output is correct
31	Correct	18 ms	31856 KB	Output is correct
32	Correct	19 ms	31876 KB	Output is correct
33	Correct	22 ms	31952 KB	Output is correct
34	Correct	22 ms	31952 KB	Output is correct

Subtask #4
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	0 ms	596 KB	Output is correct
10	Correct	1 ms	724 KB	Output is correct
11	Correct	1 ms	724 KB	Output is correct
12	Correct	1 ms	724 KB	Output is correct
13	Correct	1 ms	724 KB	Output is correct
14	Correct	1 ms	724 KB	Output is correct
15	Correct	1 ms	724 KB	Output is correct
16	Correct	1 ms	1364 KB	Output is correct
17	Correct	5 ms	7648 KB	Output is correct
18	Correct	13 ms	27732 KB	Output is correct
19	Correct	15 ms	31612 KB	Output is correct
20	Correct	23 ms	31700 KB	Output is correct
21	Correct	2 ms	3028 KB	Output is correct
22	Correct	13 ms	28372 KB	Output is correct
23	Correct	15 ms	25464 KB	Output is correct
24	Correct	19 ms	30248 KB	Output is correct
25	Correct	18 ms	31700 KB	Output is correct
26	Correct	23 ms	31700 KB	Output is correct
27	Correct	24 ms	31744 KB	Output is correct
28	Correct	21 ms	31700 KB	Output is correct
29	Correct	19 ms	31960 KB	Output is correct
30	Correct	18 ms	31904 KB	Output is correct
31	Correct	19 ms	31884 KB	Output is correct
32	Correct	18 ms	31912 KB	Output is correct
33	Correct	22 ms	31968 KB	Output is correct
34	Correct	20 ms	31920 KB	Output is correct
35	Incorrect	12 ms	22116 KB	Output isn't correct
36	Halted	0 ms	0 KB	-

Subtask #5
0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	468 KB	Output is correct
9	Correct	0 ms	596 KB	Output is correct
10	Correct	1 ms	724 KB	Output is correct
11	Correct	1 ms	724 KB	Output is correct
12	Correct	1 ms	724 KB	Output is correct
13	Correct	1 ms	724 KB	Output is correct
14	Correct	2 ms	852 KB	Output is correct
15	Correct	1 ms	724 KB	Output is correct
16	Correct	1 ms	1364 KB	Output is correct
17	Correct	6 ms	7636 KB	Output is correct
18	Correct	13 ms	27732 KB	Output is correct
19	Correct	14 ms	31700 KB	Output is correct
20	Correct	22 ms	31756 KB	Output is correct
21	Correct	2 ms	3028 KB	Output is correct
22	Correct	13 ms	28260 KB	Output is correct
23	Correct	14 ms	25428 KB	Output is correct
24	Correct	19 ms	30212 KB	Output is correct
25	Correct	20 ms	31660 KB	Output is correct
26	Correct	21 ms	31732 KB	Output is correct
27	Correct	22 ms	31716 KB	Output is correct
28	Correct	22 ms	31648 KB	Output is correct
29	Correct	19 ms	31968 KB	Output is correct
30	Correct	17 ms	31828 KB	Output is correct
31	Correct	18 ms	31828 KB	Output is correct
32	Correct	19 ms	31836 KB	Output is correct
33	Correct	22 ms	31940 KB	Output is correct
34	Correct	20 ms	31956 KB	Output is correct
35	Incorrect	12 ms	22228 KB	Output isn't correct
36	Halted	0 ms	0 KB	-

Submission #695238

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 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
0 / 21.0

Subtask #5
0 / 43.0