oj.uz

답안 #231954

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
231954 2020-05-15T13:53:37 Z peijar Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 1000 ms 16224 KB 
#include <bits/stdc++.h>
using namespace std;

#define SZ(v) ((int)(v).size())
using ll = long long;

const int MAX = 2000;

map<pair<int, int>, int> dis;
vector<int> types[MAX];

struct Etat
{
	int pos, last_type;

	int get() const
	{
		return dis[{pos, last_type}];
	}

};

int main(void)
{
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	int nb_doge, len_route;
	cin >> len_route >> nb_doge;
	vector<pair<int, int> > doge(nb_doge);
	for (auto &[building, skip] : doge)
	{
		cin >> building >> skip;
		types[building].push_back(skip);
	}

	int target = doge[1].first;

	queue<Etat> pq;
	dis[{doge[0].first, doge[0].second}] = 0;
	pq.push({doge[0].first, doge[0].second});

	while (SZ(pq))
	{
		Etat cur = pq.front(); pq.pop();
		auto [pos, last_type] = cur;

		if (pos == target)
		{
			cout << cur.get() << endl;
			return 0;
		}
		types[pos].push_back(last_type);
		for (auto type : types[pos])
		{
			if (pos >= type and !dis.count({pos-type, type}))
			{
				dis[{pos - type, type}] = 1 + cur.get();
				pq.push({pos - type, type});
			}
			if (pos + type < len_route and !dis.count({pos+type, type}))
			{
				dis[{pos+type, type}] = 1 + cur.get();
				pq.push({pos+type, type});
			}
		}
		types[pos].pop_back();
	}

	cout << -1 << endl;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 14 ms 768 KB Output is correct
15 Correct 6 ms 512 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 14 ms 768 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 8 ms 640 KB Output is correct
24 Correct 9 ms 768 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 6 ms 640 KB Output is correct
27 Correct 7 ms 768 KB Output is correct
28 Correct 19 ms 1664 KB Output is correct
29 Correct 55 ms 4344 KB Output is correct
30 Correct 15 ms 1536 KB Output is correct
31 Correct 27 ms 2552 KB Output is correct
32 Correct 20 ms 1920 KB Output is correct
33 Correct 141 ms 7928 KB Output is correct
34 Correct 67 ms 4472 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 14 ms 768 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 8 ms 640 KB Output is correct
24 Correct 9 ms 896 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 6 ms 640 KB Output is correct
27 Correct 7 ms 768 KB Output is correct
28 Correct 18 ms 1664 KB Output is correct
29 Correct 56 ms 4216 KB Output is correct
30 Correct 15 ms 1536 KB Output is correct
31 Correct 28 ms 2560 KB Output is correct
32 Correct 20 ms 1920 KB Output is correct
33 Correct 137 ms 7928 KB Output is correct
34 Correct 69 ms 4472 KB Output is correct
35 Correct 48 ms 2812 KB Output is correct
36 Correct 6 ms 512 KB Output is correct
37 Correct 22 ms 2176 KB Output is correct
38 Correct 33 ms 2808 KB Output is correct
39 Correct 11 ms 896 KB Output is correct
40 Correct 11 ms 896 KB Output is correct
41 Correct 14 ms 1280 KB Output is correct
42 Correct 10 ms 1024 KB Output is correct
43 Correct 11 ms 1024 KB Output is correct
44 Correct 11 ms 896 KB Output is correct
45 Execution timed out 1099 ms 15480 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 14 ms 768 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 8 ms 640 KB Output is correct
24 Correct 9 ms 768 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 6 ms 640 KB Output is correct
27 Correct 7 ms 768 KB Output is correct
28 Correct 18 ms 1664 KB Output is correct
29 Correct 55 ms 4220 KB Output is correct
30 Correct 15 ms 1536 KB Output is correct
31 Correct 28 ms 2560 KB Output is correct
32 Correct 20 ms 1920 KB Output is correct
33 Correct 136 ms 7928 KB Output is correct
34 Correct 67 ms 4600 KB Output is correct
35 Correct 47 ms 2808 KB Output is correct
36 Correct 6 ms 512 KB Output is correct
37 Correct 22 ms 2176 KB Output is correct
38 Correct 32 ms 2808 KB Output is correct
39 Correct 10 ms 896 KB Output is correct
40 Correct 10 ms 896 KB Output is correct
41 Correct 14 ms 1152 KB Output is correct
42 Correct 11 ms 1024 KB Output is correct
43 Correct 11 ms 1152 KB Output is correct
44 Correct 11 ms 896 KB Output is correct
45 Execution timed out 1091 ms 16224 KB Time limit exceeded
46 Halted 0 ms 0 KB -