Submission #984850

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
984850	2024-05-17T07:01:54 Z	Nurislam	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	422 ms	8400 KB

skyscraper

///*                                                    __                    __                        __                    */
///*        ======     _      /| /|  __   _            /   |  |   /|  |   *  |    |  |  | /   /| |\  | /   |  |  * | /        */
///* \-       ||  |_| |_     / |/ | |  | |_  |-        |   |--|  /-|  |   |  \ \  |==|  |-   /=| | \ | |   |--|  | |-         */
///*          ||  | | |_    /     | |__|  _| |_        \__ |  | /  |  |__ |  __|  |  |  | \ /  | |  \| \__ |  |  | | \        */
///* 
// autor :: Rick Prime
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define Mp make_pair
#define double double long
typedef vector<int> vi;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef vector<pii> vii;
const int N = 1e6, inf = 2e18, mod = 1e9+7;

void solve(){
	int n, m;
	cin >> n >> m;
	vii v(m);
	for(auto &[i, j]:v)cin >> i >> j;
	int dp[n];
	for(int &i:dp)i = inf;
	dp[v[0].ff] = 0;
	vi r[n];
	for(auto [i, j]:v)r[i].pb(j);
	priority_queue<pii, vii, greater<pii>> q;
	q.push({0, v[0].ff});
	while(!q.empty()){
		auto [dist, b] = q.top();
		q.pop();
		if(dp[b] < dist)continue;
		
		for(auto x:r[b]){
			int cnt = 0;
            for (int i = b; i >= 0; i -= x) {
                if (dp[i] > dist + cnt) {
                    dp[i] = dist + cnt;
                    q.push({dp[i], i});
                }
                cnt++;
            }
 
            cnt = 0;
            for (int i = b; i < n; i += x) {
                if (dp[i] > dist + cnt) {
                    dp[i] = dist + cnt;
                    q.push({dp[i], i});
                }
                cnt++;
            }
		}
	}
	//for(auto i:dp)cout << i << ' ';
	//cout << '\n';
	cout << (dp[v[1].ff]==inf?-1:dp[v[1].ff]) << '\n';
}
 
signed main(){
	ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
	int test = 1;
	//cin >> test;
	while(test--){
		solve();
	}
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	2 ms	604 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	2 ms	348 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	2 ms	860 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	604 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	2 ms	860 KB	Output is correct
34	Correct	2 ms	860 KB	Output is correct
35	Correct	5 ms	1384 KB	Output is correct
36	Correct	2 ms	600 KB	Output is correct
37	Correct	4 ms	1116 KB	Output is correct
38	Correct	5 ms	1444 KB	Output is correct
39	Correct	6 ms	1624 KB	Output is correct
40	Correct	6 ms	1628 KB	Output is correct
41	Correct	5 ms	1628 KB	Output is correct
42	Correct	31 ms	1368 KB	Output is correct
43	Correct	33 ms	1624 KB	Output is correct
44	Correct	30 ms	1380 KB	Output is correct
45	Correct	5 ms	1628 KB	Output is correct
46	Correct	5 ms	1628 KB	Output is correct

Subtask #5
43.0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	352 KB	Output is correct
5	Correct	0 ms	352 KB	Output is correct
6	Correct	0 ms	600 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	352 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	544 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	2 ms	604 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	3 ms	600 KB	Output is correct
27	Correct	3 ms	348 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	2 ms	860 KB	Output is correct
30	Correct	1 ms	600 KB	Output is correct
31	Correct	1 ms	600 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	2 ms	860 KB	Output is correct
34	Correct	2 ms	916 KB	Output is correct
35	Correct	5 ms	1372 KB	Output is correct
36	Correct	1 ms	604 KB	Output is correct
37	Correct	4 ms	1112 KB	Output is correct
38	Correct	6 ms	1628 KB	Output is correct
39	Correct	5 ms	1628 KB	Output is correct
40	Correct	6 ms	1624 KB	Output is correct
41	Correct	6 ms	1628 KB	Output is correct
42	Correct	31 ms	1372 KB	Output is correct
43	Correct	29 ms	1368 KB	Output is correct
44	Correct	30 ms	1372 KB	Output is correct
45	Correct	5 ms	1628 KB	Output is correct
46	Correct	5 ms	1708 KB	Output is correct
47	Correct	13 ms	2780 KB	Output is correct
48	Correct	5 ms	2140 KB	Output is correct
49	Correct	5 ms	2140 KB	Output is correct
50	Correct	4 ms	1884 KB	Output is correct
51	Correct	21 ms	4820 KB	Output is correct
52	Correct	20 ms	3800 KB	Output is correct
53	Correct	11 ms	3992 KB	Output is correct
54	Correct	2 ms	1760 KB	Output is correct
55	Correct	2 ms	1760 KB	Output is correct
56	Correct	367 ms	3552 KB	Output is correct
57	Correct	37 ms	7636 KB	Output is correct
58	Correct	288 ms	2524 KB	Output is correct
59	Correct	422 ms	2648 KB	Output is correct
60	Correct	322 ms	2652 KB	Output is correct
61	Correct	343 ms	2648 KB	Output is correct
62	Correct	7 ms	2904 KB	Output is correct
63	Correct	25 ms	4536 KB	Output is correct
64	Correct	26 ms	7888 KB	Output is correct
65	Correct	31 ms	8140 KB	Output is correct
66	Correct	46 ms	8400 KB	Output is correct
67	Correct	43 ms	6864 KB	Output is correct

Submission #984850

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