Submission #675705

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
675705	2022-12-27T18:32:20 Z	vovamr	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	822 ms	3708 KB

skyscraper

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

inline void solve() {
	int n, m;
	cin >> n >> m;

	int fir = -1, sec = -1;

	ve<ve<int>> lst(n);
	for (int i = 0; i < m; ++i) {
		int b, p;
		cin >> b >> p;
		lst[b].pb(p);

		if (!i) fir = b;
		else if (i == 1) sec = b;
	}

	ve<int> d(n, iinf);
	d[fir] = 0;

	set<pii> st;
	st.insert({0, fir});

	while (st.size()) {
		int v = st.begin()->se;
		st.erase(st.begin());

		for (auto &p : lst[v]) {
			int pos, cur;

			pos = v + p, cur = 1;
			while (pos < n) {
				if (d[pos] > d[v] + cur) {
					st.erase({d[pos], pos});
					d[pos] = d[v] + cur;
					st.insert({d[pos], pos});
				}
				pos += p;
				++cur;
			}

			pos = v - p, cur = 1;
			while (pos >= 0) {
				if (d[pos] > d[v] + cur) {
					st.erase({d[pos], pos});
					d[pos] = d[v] + cur;
					st.insert({d[pos], pos});
				}
				pos -= p;
				++cur;
			}
		}
	}
	cout << (d[sec] == iinf ? -1 : d[sec]);
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	328 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	372 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	308 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	5 ms	464 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	2 ms	340 KB	Output is correct
24	Correct	2 ms	468 KB	Output is correct
25	Correct	2 ms	468 KB	Output is correct
26	Correct	4 ms	336 KB	Output is correct
27	Correct	5 ms	452 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	3 ms	456 KB	Output is correct
30	Correct	2 ms	468 KB	Output is correct
31	Correct	3 ms	448 KB	Output is correct
32	Correct	2 ms	452 KB	Output is correct
33	Correct	5 ms	468 KB	Output is correct
34	Correct	4 ms	468 KB	Output is correct

Subtask #4
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	2 ms	336 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	5 ms	468 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	2 ms	468 KB	Output is correct
25	Correct	2 ms	468 KB	Output is correct
26	Correct	4 ms	340 KB	Output is correct
27	Correct	4 ms	336 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	4 ms	468 KB	Output is correct
30	Correct	2 ms	468 KB	Output is correct
31	Correct	2 ms	468 KB	Output is correct
32	Correct	2 ms	468 KB	Output is correct
33	Correct	5 ms	468 KB	Output is correct
34	Correct	4 ms	468 KB	Output is correct
35	Correct	6 ms	724 KB	Output is correct
36	Correct	2 ms	468 KB	Output is correct
37	Correct	6 ms	724 KB	Output is correct
38	Correct	8 ms	852 KB	Output is correct
39	Correct	7 ms	892 KB	Output is correct
40	Correct	8 ms	852 KB	Output is correct
41	Correct	8 ms	936 KB	Output is correct
42	Correct	65 ms	752 KB	Output is correct
43	Correct	60 ms	748 KB	Output is correct
44	Correct	69 ms	852 KB	Output is correct
45	Correct	8 ms	852 KB	Output is correct
46	Correct	7 ms	852 KB	Output is correct

Subtask #5
43.0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	320 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	328 KB	Output is correct
11	Correct	2 ms	360 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	324 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	5 ms	552 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	2 ms	340 KB	Output is correct
24	Correct	2 ms	468 KB	Output is correct
25	Correct	2 ms	468 KB	Output is correct
26	Correct	4 ms	340 KB	Output is correct
27	Correct	5 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	4 ms	488 KB	Output is correct
30	Correct	2 ms	456 KB	Output is correct
31	Correct	2 ms	448 KB	Output is correct
32	Correct	2 ms	468 KB	Output is correct
33	Correct	5 ms	468 KB	Output is correct
34	Correct	4 ms	468 KB	Output is correct
35	Correct	6 ms	724 KB	Output is correct
36	Correct	2 ms	460 KB	Output is correct
37	Correct	6 ms	724 KB	Output is correct
38	Correct	11 ms	852 KB	Output is correct
39	Correct	9 ms	844 KB	Output is correct
40	Correct	8 ms	900 KB	Output is correct
41	Correct	8 ms	888 KB	Output is correct
42	Correct	58 ms	752 KB	Output is correct
43	Correct	57 ms	840 KB	Output is correct
44	Correct	59 ms	884 KB	Output is correct
45	Correct	8 ms	852 KB	Output is correct
46	Correct	8 ms	852 KB	Output is correct
47	Correct	25 ms	1704 KB	Output is correct
48	Correct	6 ms	1620 KB	Output is correct
49	Correct	6 ms	1672 KB	Output is correct
50	Correct	4 ms	1620 KB	Output is correct
51	Correct	50 ms	3412 KB	Output is correct
52	Correct	40 ms	3092 KB	Output is correct
53	Correct	18 ms	3336 KB	Output is correct
54	Correct	5 ms	1748 KB	Output is correct
55	Correct	5 ms	1748 KB	Output is correct
56	Correct	749 ms	3708 KB	Output is correct
57	Correct	87 ms	2720 KB	Output is correct
58	Correct	730 ms	2088 KB	Output is correct
59	Correct	822 ms	2204 KB	Output is correct
60	Correct	727 ms	2184 KB	Output is correct
61	Correct	724 ms	2224 KB	Output is correct
62	Correct	12 ms	2388 KB	Output is correct
63	Correct	58 ms	2964 KB	Output is correct
64	Correct	60 ms	2952 KB	Output is correct
65	Correct	73 ms	2972 KB	Output is correct
66	Correct	94 ms	2900 KB	Output is correct
67	Correct	94 ms	2900 KB	Output is correct

Submission #675705

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