답안 #30992 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
30992	2017-08-03T05:50:30 Z	szawinis	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	1000 ms	5404 KB

skyscraper

#include <bits/stdc++.h>
using namespace std;
const int MAX = (3e4)+1, INF = 1e9;

int n, m, s, e, a[MAX], b[MAX], d[MAX];
vector<int> ls[MAX];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m;
	for(int i = 0; i < n; i++) d[i] = INF;
	for(int i = 0; i < m; i++) {
		cin >> a[i] >> b[i];
		ls[a[i]].push_back(b[i]);
		if(i == 0) s = a[i];
		if(i == 1) e = a[i];
	}
	for(int i = 0; i < n; i++) {
		sort(ls[i].begin(), ls[i].end());
		ls[i].resize(distance(ls[i].begin(), unique(ls[i].begin(), ls[i].end())));
	}
	priority_queue<pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > > pq;
	pq.emplace(d[s] = 0, s);
	while(!pq.empty()) {
		int dd, u; tie(dd, u) = pq.top();
		pq.pop();
		if(d[u] < dd) continue;
		for(int p: ls[u]) {
			for(int i = 1; u + i*p < n; i++) {
				if(d[u] + i < d[u + i*p]) pq.emplace(d[u + i*p] = d[u] + i, u + i*p);
			//	if(binary_search(ls[u + i*p].begin(), ls[u + i*p].end(), p)) break;
			}
			for(int i = 1; u - i*p >= 0; i++) {
				if(d[u] + i < d[u - i*p]) pq.emplace(d[u - i*p] = d[u] + i, u - i*p);
			//	if(binary_search(ls[u - i*p].begin(), ls[u - i*p].end(), p)) break;
			}
		}
	}
	cout << (d[e] == INF ? -1 : d[e]);
}

Subtask #1
10.0 / 10.0

#	결과	메모리	Grader output
1	Correct	3236 KB	Output is correct
2	Correct	3236 KB	Output is correct
3	Correct	3236 KB	Output is correct
4	Correct	3236 KB	Output is correct
5	Correct	3236 KB	Output is correct
6	Correct	3236 KB	Output is correct
7	Correct	3236 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	메모리	Grader output
1	Correct	3236 KB	Output is correct
2	Correct	3236 KB	Output is correct
3	Correct	3236 KB	Output is correct
4	Correct	3236 KB	Output is correct
5	Correct	3236 KB	Output is correct
6	Correct	3236 KB	Output is correct
7	Correct	3236 KB	Output is correct
8	Correct	3236 KB	Output is correct
9	Correct	3236 KB	Output is correct
10	Correct	3236 KB	Output is correct
11	Correct	3236 KB	Output is correct
12	Correct	3236 KB	Output is correct
13	Correct	3236 KB	Output is correct
14	Correct	3236 KB	Output is correct
15	Correct	3236 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	3236 KB	Output is correct
2	Correct	0 ms	3236 KB	Output is correct
3	Correct	0 ms	3236 KB	Output is correct
4	Correct	0 ms	3236 KB	Output is correct
5	Correct	0 ms	3236 KB	Output is correct
6	Correct	0 ms	3236 KB	Output is correct
7	Correct	0 ms	3236 KB	Output is correct
8	Correct	0 ms	3236 KB	Output is correct
9	Correct	0 ms	3236 KB	Output is correct
10	Correct	0 ms	3236 KB	Output is correct
11	Correct	0 ms	3236 KB	Output is correct
12	Correct	0 ms	3236 KB	Output is correct
13	Correct	0 ms	3236 KB	Output is correct
14	Correct	0 ms	3236 KB	Output is correct
15	Correct	0 ms	3236 KB	Output is correct
16	Correct	0 ms	3236 KB	Output is correct
17	Correct	0 ms	3236 KB	Output is correct
18	Correct	0 ms	3236 KB	Output is correct
19	Correct	0 ms	3236 KB	Output is correct
20	Correct	3 ms	3236 KB	Output is correct
21	Correct	0 ms	3236 KB	Output is correct
22	Correct	0 ms	3236 KB	Output is correct
23	Correct	0 ms	3236 KB	Output is correct
24	Correct	0 ms	3236 KB	Output is correct
25	Correct	0 ms	3372 KB	Output is correct
26	Correct	0 ms	3236 KB	Output is correct
27	Correct	0 ms	3236 KB	Output is correct
28	Correct	0 ms	3236 KB	Output is correct
29	Correct	3 ms	3404 KB	Output is correct
30	Correct	0 ms	3400 KB	Output is correct
31	Correct	0 ms	3400 KB	Output is correct
32	Correct	0 ms	3404 KB	Output is correct
33	Correct	3 ms	3672 KB	Output is correct
34	Correct	6 ms	3672 KB	Output is correct

Subtask #4
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	3236 KB	Output is correct
2	Correct	0 ms	3236 KB	Output is correct
3	Correct	0 ms	3236 KB	Output is correct
4	Correct	0 ms	3236 KB	Output is correct
5	Correct	0 ms	3236 KB	Output is correct
6	Correct	0 ms	3236 KB	Output is correct
7	Correct	0 ms	3236 KB	Output is correct
8	Correct	0 ms	3236 KB	Output is correct
9	Correct	0 ms	3236 KB	Output is correct
10	Correct	0 ms	3236 KB	Output is correct
11	Correct	0 ms	3236 KB	Output is correct
12	Correct	0 ms	3236 KB	Output is correct
13	Correct	0 ms	3236 KB	Output is correct
14	Correct	0 ms	3236 KB	Output is correct
15	Correct	0 ms	3236 KB	Output is correct
16	Correct	0 ms	3236 KB	Output is correct
17	Correct	0 ms	3236 KB	Output is correct
18	Correct	0 ms	3236 KB	Output is correct
19	Correct	0 ms	3236 KB	Output is correct
20	Correct	6 ms	3236 KB	Output is correct
21	Correct	0 ms	3236 KB	Output is correct
22	Correct	0 ms	3236 KB	Output is correct
23	Correct	0 ms	3236 KB	Output is correct
24	Correct	0 ms	3236 KB	Output is correct
25	Correct	0 ms	3372 KB	Output is correct
26	Correct	0 ms	3236 KB	Output is correct
27	Correct	0 ms	3236 KB	Output is correct
28	Correct	0 ms	3236 KB	Output is correct
29	Correct	3 ms	3404 KB	Output is correct
30	Correct	0 ms	3400 KB	Output is correct
31	Correct	0 ms	3400 KB	Output is correct
32	Correct	0 ms	3404 KB	Output is correct
33	Correct	3 ms	3672 KB	Output is correct
34	Correct	3 ms	3672 KB	Output is correct
35	Correct	6 ms	3500 KB	Output is correct
36	Correct	0 ms	3236 KB	Output is correct
37	Correct	6 ms	3520 KB	Output is correct
38	Correct	13 ms	3500 KB	Output is correct
39	Correct	9 ms	3500 KB	Output is correct
40	Correct	6 ms	3500 KB	Output is correct
41	Correct	9 ms	3500 KB	Output is correct
42	Correct	6 ms	3400 KB	Output is correct
43	Correct	6 ms	3400 KB	Output is correct
44	Correct	13 ms	3396 KB	Output is correct
45	Correct	16 ms	3840 KB	Output is correct
46	Correct	9 ms	3836 KB	Output is correct

Subtask #5
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	3236 KB	Output is correct
2	Correct	0 ms	3236 KB	Output is correct
3	Correct	0 ms	3236 KB	Output is correct
4	Correct	0 ms	3236 KB	Output is correct
5	Correct	0 ms	3236 KB	Output is correct
6	Correct	0 ms	3236 KB	Output is correct
7	Correct	0 ms	3236 KB	Output is correct
8	Correct	0 ms	3236 KB	Output is correct
9	Correct	0 ms	3236 KB	Output is correct
10	Correct	0 ms	3236 KB	Output is correct
11	Correct	0 ms	3236 KB	Output is correct
12	Correct	0 ms	3236 KB	Output is correct
13	Correct	0 ms	3236 KB	Output is correct
14	Correct	0 ms	3236 KB	Output is correct
15	Correct	0 ms	3236 KB	Output is correct
16	Correct	0 ms	3236 KB	Output is correct
17	Correct	0 ms	3236 KB	Output is correct
18	Correct	0 ms	3236 KB	Output is correct
19	Correct	0 ms	3236 KB	Output is correct
20	Correct	6 ms	3236 KB	Output is correct
21	Correct	0 ms	3236 KB	Output is correct
22	Correct	0 ms	3236 KB	Output is correct
23	Correct	0 ms	3236 KB	Output is correct
24	Correct	0 ms	3236 KB	Output is correct
25	Correct	0 ms	3372 KB	Output is correct
26	Correct	0 ms	3236 KB	Output is correct
27	Correct	0 ms	3236 KB	Output is correct
28	Correct	0 ms	3236 KB	Output is correct
29	Correct	3 ms	3404 KB	Output is correct
30	Correct	0 ms	3400 KB	Output is correct
31	Correct	0 ms	3400 KB	Output is correct
32	Correct	0 ms	3404 KB	Output is correct
33	Correct	3 ms	3672 KB	Output is correct
34	Correct	3 ms	3672 KB	Output is correct
35	Correct	9 ms	3500 KB	Output is correct
36	Correct	0 ms	3236 KB	Output is correct
37	Correct	6 ms	3520 KB	Output is correct
38	Correct	6 ms	3500 KB	Output is correct
39	Correct	9 ms	3500 KB	Output is correct
40	Correct	9 ms	3500 KB	Output is correct
41	Correct	9 ms	3500 KB	Output is correct
42	Correct	6 ms	3400 KB	Output is correct
43	Correct	6 ms	3400 KB	Output is correct
44	Correct	16 ms	3396 KB	Output is correct
45	Correct	19 ms	3840 KB	Output is correct
46	Correct	13 ms	3836 KB	Output is correct
47	Correct	19 ms	4388 KB	Output is correct
48	Correct	9 ms	3632 KB	Output is correct
49	Correct	6 ms	3632 KB	Output is correct
50	Correct	0 ms	3500 KB	Output is correct
51	Correct	43 ms	5404 KB	Output is correct
52	Correct	36 ms	4640 KB	Output is correct
53	Correct	13 ms	4640 KB	Output is correct
54	Correct	3 ms	3396 KB	Output is correct
55	Correct	0 ms	3396 KB	Output is correct
56	Execution timed out	1000 ms	4592 KB	Execution timed out
57	Halted	0 ms	0 KB	-

답안 #30992

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