Submission #41496

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
41496	2018-02-17T10:56:43 Z	cmaster	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	24 ms	1388 KB

skyscraper

#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>*/
 
#define pb push_back
#define mp make_pair
#define sz(s) ((int)(s.size()))
#define all(s) s.begin(), s.end()
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define per(i, n, a) for (int i = n; i >= a; --i)
#define onlycin ios_base::sync_with_stdio(false); cin.tie(0) 
#define F first
#define S second
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
/*typedef tree<
pair < int, int >,
null_type,
less< pair < int, int > >,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;*/
// find_by_order() order_of_key()
const int MAXN = (int)5e5+228;
const char nxtl = '\n';
const int mod = (int)1e9+7;
const double eps = (double)1e-7;
template<typename T> inline bool updmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<typename T> inline bool updmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}

int n, m, b[MAXN], p[MAXN], d[2020];
vector < pair < int, int > > g[2020];
vector < int > divs[2020], have[2020];

int main() {
	#ifdef accepted
		freopen(".in", "r", stdin);
		freopen(".out", "w", stdout);
	#endif
	onlycin;
	cin >> n >> m;
	rep(i, 1, m) {
		cin >> b[i] >> p[i];
		have[++b[i]].pb(p[i]);
	}
	rep(i, 1, n) {
		sort(all(have[i])); have[i].resize(unique(all(have[i]))-have[i].begin());
	}
	memset(d, 0x3f, sizeof d);
	d[b[1]] = 0;
	set < pair < int, int > > S; S.insert(mp(0, b[1]));
	while(!S.empty()) {
		int v = S.begin()->second;
		S.erase(S.begin());
		for(auto &to : have[v]) {
			int cnt = 0;
			for(int go = v + to; go <= n; go += to) {
				cnt++;
				if(cnt + d[v] < d[go]) {
					S.erase(mp(d[go], go));
					d[go] = d[v]+cnt;
					S.insert(mp(d[go], go));
				}
				if(binary_search(all(have[go]), to)) break;
			}
			cnt = 0;
			for(int go = v - to; go > 0; go -= to) {
				cnt++;
				if(cnt + d[v] < d[go]) {
					S.erase(mp(d[go], go));
					d[go] = d[v]+cnt;
					S.insert(mp(d[go], go));
				}
				if(binary_search(all(have[go]), to)) break;
			}
		}
	}
	if(d[b[2]] == d[0]) d[b[2]] = -1;
	cout << d[b[2]] << nxtl;
	
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1260 KB	Output is correct
2	Correct	2 ms	1260 KB	Output is correct
3	Correct	2 ms	1260 KB	Output is correct
4	Correct	1 ms	1260 KB	Output is correct
5	Correct	2 ms	1260 KB	Output is correct
6	Correct	1 ms	1260 KB	Output is correct
7	Correct	2 ms	1260 KB	Output is correct
8	Correct	2 ms	1260 KB	Output is correct
9	Correct	2 ms	1260 KB	Output is correct
10	Correct	2 ms	1260 KB	Output is correct
11	Correct	2 ms	1260 KB	Output is correct
12	Correct	2 ms	1260 KB	Output is correct
13	Correct	3 ms	1260 KB	Output is correct
14	Correct	3 ms	1260 KB	Output is correct
15	Correct	3 ms	1260 KB	Output is correct
16	Correct	2 ms	1260 KB	Output is correct
17	Correct	3 ms	1260 KB	Output is correct
18	Correct	2 ms	1260 KB	Output is correct
19	Correct	2 ms	1260 KB	Output is correct
20	Correct	2 ms	1260 KB	Output is correct
21	Correct	2 ms	1260 KB	Output is correct
22	Correct	2 ms	1260 KB	Output is correct
23	Correct	3 ms	1260 KB	Output is correct
24	Correct	3 ms	1260 KB	Output is correct
25	Correct	4 ms	1260 KB	Output is correct
26	Correct	2 ms	1260 KB	Output is correct
27	Correct	3 ms	1260 KB	Output is correct
28	Correct	3 ms	1260 KB	Output is correct
29	Correct	6 ms	1260 KB	Output is correct
30	Correct	4 ms	1260 KB	Output is correct
31	Correct	4 ms	1260 KB	Output is correct
32	Correct	3 ms	1260 KB	Output is correct
33	Correct	8 ms	1260 KB	Output is correct
34	Correct	9 ms	1260 KB	Output is correct
35	Correct	17 ms	1260 KB	Output is correct
36	Correct	5 ms	1260 KB	Output is correct
37	Correct	12 ms	1260 KB	Output is correct
38	Correct	14 ms	1264 KB	Output is correct
39	Correct	15 ms	1264 KB	Output is correct
40	Correct	14 ms	1324 KB	Output is correct
41	Correct	15 ms	1324 KB	Output is correct
42	Correct	8 ms	1324 KB	Output is correct
43	Correct	7 ms	1324 KB	Output is correct
44	Correct	8 ms	1324 KB	Output is correct
45	Correct	20 ms	1324 KB	Output is correct
46	Correct	15 ms	1324 KB	Output is correct
47	Runtime error	3 ms	1388 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
48	Halted	0 ms	0 KB	-

Submission #41496

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 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
0 / 43.0