oj.uz

Submission #231956

# Submission time Handle Problem Language Result Execution time Memory
231956 2020-05-15T13:55:34 Z peijar Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 1000 ms 19192 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;
set<pair<int, int>> seen;

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 (seen.count({pos, last_type})) continue;
		seen.insert({pos, last_type});

		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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 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 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory 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 5 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 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 16 ms 1024 KB Output is correct
15 Correct 6 ms 512 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 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 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
8 Correct 5 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 16 ms 1024 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 8 ms 768 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 9 ms 896 KB Output is correct
24 Correct 12 ms 1024 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 7 ms 768 KB Output is correct
27 Correct 8 ms 896 KB Output is correct
28 Correct 26 ms 2560 KB Output is correct
29 Correct 111 ms 7160 KB Output is correct
30 Correct 21 ms 2304 KB Output is correct
31 Correct 41 ms 4096 KB Output is correct
32 Correct 29 ms 3064 KB Output is correct
33 Correct 246 ms 13560 KB Output is correct
34 Correct 112 ms 7416 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory 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 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
8 Correct 5 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 16 ms 1024 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 8 ms 768 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 768 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 9 ms 896 KB Output is correct
24 Correct 12 ms 1024 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 7 ms 768 KB Output is correct
27 Correct 8 ms 896 KB Output is correct
28 Correct 25 ms 2560 KB Output is correct
29 Correct 93 ms 7160 KB Output is correct
30 Correct 22 ms 2304 KB Output is correct
31 Correct 45 ms 4088 KB Output is correct
32 Correct 30 ms 3072 KB Output is correct
33 Correct 274 ms 13560 KB Output is correct
34 Correct 117 ms 7416 KB Output is correct
35 Correct 62 ms 3320 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 2936 KB Output is correct
39 Correct 11 ms 896 KB Output is correct
40 Correct 11 ms 896 KB Output is correct
41 Correct 13 ms 1152 KB Output is correct
42 Correct 11 ms 1152 KB Output is correct
43 Correct 13 ms 1280 KB Output is correct
44 Correct 11 ms 1024 KB Output is correct
45 Execution timed out 1093 ms 18808 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 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 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 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 16 ms 1024 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 8 ms 768 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 10 ms 896 KB Output is correct
24 Correct 12 ms 1024 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 7 ms 768 KB Output is correct
27 Correct 8 ms 896 KB Output is correct
28 Correct 24 ms 2560 KB Output is correct
29 Correct 95 ms 7160 KB Output is correct
30 Correct 21 ms 2304 KB Output is correct
31 Correct 43 ms 4088 KB Output is correct
32 Correct 30 ms 3028 KB Output is correct
33 Correct 288 ms 13560 KB Output is correct
34 Correct 110 ms 7416 KB Output is correct
35 Correct 55 ms 3192 KB Output is correct
36 Correct 6 ms 512 KB Output is correct
37 Correct 23 ms 2176 KB Output is correct
38 Correct 35 ms 3064 KB Output is correct
39 Correct 11 ms 896 KB Output is correct
40 Correct 12 ms 896 KB Output is correct
41 Correct 14 ms 1152 KB Output is correct
42 Correct 11 ms 1152 KB Output is correct
43 Correct 12 ms 1280 KB Output is correct
44 Correct 12 ms 1024 KB Output is correct
45 Execution timed out 1096 ms 19192 KB Time limit exceeded
46 Halted 0 ms 0 KB -