oj.uz

Submission #60473

# Submission time Handle Problem Language Result Execution time Memory
60473 2018-07-24T08:37:46 Z Eae02 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 263168 KB 
#include <bits/stdc++.h>

#pragma pack(push, 1)
struct QEntry
{
	uint16_t building;
	uint16_t doge;
	int cost;
};
#pragma pack(pop)

std::bitset<30000> visited[30000];

int main()
{
	int numBuildings, numDoges;
	std::cin >> numBuildings;
	std::cin >> numDoges;
	
	std::vector<std::vector<int>> dogesInBuildings(numBuildings);
	
	std::vector<int> dogePositions(numDoges);
	std::vector<int> dogePowers(numDoges);
	for (int i = 0; i < numDoges; i++)
	{
		std::cin >> dogePositions[i];
		std::cin >> dogePowers[i];
		
		dogesInBuildings[dogePositions[i]].push_back(i);
	}
	
	std::deque<QEntry> q;
	
	q.push_back(QEntry { dogePositions[0], 0, 0 });
	while (!q.empty())
	{
		QEntry entry = q.front();
		q.pop_front();
		
		if (visited[entry.building][entry.doge])
			continue;
		if (entry.doge == 1)
		{
			std::cout << entry.cost << std::endl;
			return 0;
		}
		
		visited[entry.building][entry.doge] = true;
		
		for (int d : dogesInBuildings[entry.building])
		{
			if (visited[entry.building][d])
				continue;
			q.push_front(QEntry { entry.building, d, entry.cost });
		}
		
		int pBuilding = (int)entry.building - dogePowers[entry.doge];
		if (pBuilding >= 0 && !visited[pBuilding][entry.doge])
		{
			q.push_back(QEntry { pBuilding, entry.doge, entry.cost + 1 });
		}
		
		int nBuilding = (int)entry.building + dogePowers[entry.doge];
		if (nBuilding < numBuildings && !visited[nBuilding][entry.doge])
		{
			q.push_back(QEntry { nBuilding, entry.doge, entry.cost + 1 });
		}
	}
	
	std::cout << "-1" << std::endl;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:34:46: warning: narrowing conversion of 'dogePositions.std::vector<int>::operator[](0)' from '__gnu_cxx::__alloc_traits<std::allocator<int> >::value_type {aka int}' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]
  q.push_back(QEntry { dogePositions[0], 0, 0 });
                                              ^
skyscraper.cpp:54:56: warning: narrowing conversion of 'd' from 'int' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]
    q.push_front(QEntry { entry.building, d, entry.cost });
                                                        ^
skyscraper.cpp:60:63: warning: narrowing conversion of 'pBuilding' from 'int' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]
    q.push_back(QEntry { pBuilding, entry.doge, entry.cost + 1 });
                                                               ^
skyscraper.cpp:66:63: warning: narrowing conversion of 'nBuilding' from 'int' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]
    q.push_back(QEntry { nBuilding, entry.doge, entry.cost + 1 });
                                                               ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 3 ms 544 KB Output is correct
4 Correct 2 ms 544 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 2 ms 600 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 620 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 4 ms 620 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 5 ms 748 KB Output is correct
12 Correct 32 ms 17156 KB Output is correct
13 Correct 34 ms 17156 KB Output is correct
14 Correct 5 ms 17156 KB Output is correct
15 Correct 5 ms 17156 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 21952 KB Output is correct
2 Correct 3 ms 21952 KB Output is correct
3 Correct 3 ms 21952 KB Output is correct
4 Correct 1 ms 21952 KB Output is correct
5 Correct 3 ms 21952 KB Output is correct
6 Correct 3 ms 21952 KB Output is correct
7 Correct 3 ms 21952 KB Output is correct
8 Correct 2 ms 21952 KB Output is correct
9 Correct 3 ms 21952 KB Output is correct
10 Correct 3 ms 21952 KB Output is correct
11 Correct 5 ms 21952 KB Output is correct
12 Correct 40 ms 21952 KB Output is correct
13 Correct 41 ms 21952 KB Output is correct
14 Correct 5 ms 21952 KB Output is correct
15 Correct 6 ms 21952 KB Output is correct
16 Correct 3 ms 21952 KB Output is correct
17 Correct 9 ms 21952 KB Output is correct
18 Correct 4 ms 21952 KB Output is correct
19 Correct 4 ms 21952 KB Output is correct
20 Correct 135 ms 21952 KB Output is correct
21 Correct 5 ms 21952 KB Output is correct
22 Correct 3 ms 21952 KB Output is correct
23 Correct 11 ms 21952 KB Output is correct
24 Correct 14 ms 21952 KB Output is correct
25 Correct 7 ms 21952 KB Output is correct
26 Correct 14 ms 21952 KB Output is correct
27 Correct 42 ms 22252 KB Output is correct
28 Correct 18 ms 22252 KB Output is correct
29 Correct 15 ms 22252 KB Output is correct
30 Correct 11 ms 22252 KB Output is correct
31 Correct 16 ms 22252 KB Output is correct
32 Correct 14 ms 22252 KB Output is correct
33 Correct 20 ms 22252 KB Output is correct
34 Correct 15 ms 22252 KB Output is correct
35 Correct 44 ms 22252 KB Output is correct
36 Correct 7 ms 22252 KB Output is correct
37 Correct 27 ms 22252 KB Output is correct
38 Correct 32 ms 22252 KB Output is correct
39 Correct 30 ms 22252 KB Output is correct
40 Correct 42 ms 22252 KB Output is correct
41 Correct 44 ms 22252 KB Output is correct
42 Correct 29 ms 22252 KB Output is correct
43 Execution timed out 1097 ms 263168 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 263168 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2 Halted 0 ms 0 KB -