oj.uz

Submission #60475

# Submission time Handle Problem Language Result Execution time Memory
60475 2018-07-24T08:40:55 Z Eae02 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 12620 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 });
	visited[dogePositions[0]][0] = true;
	
	while (!q.empty())
	{
		QEntry entry = q.front();
		q.pop_front();
		
		if (entry.doge == 1)
		{
			std::cout << entry.cost << std::endl;
			return 0;
		}
		
		for (int d : dogesInBuildings[entry.building])
		{
			if (!visited[entry.building][d])
			{
				visited[entry.building][d] = true;
				q.push_front(QEntry { entry.building, d, entry.cost });
			}
		}
		
		int pBuilding = (int)entry.building - dogePowers[entry.doge];
		if (pBuilding >= 0 && !visited[pBuilding][entry.doge])
		{
			visited[pBuilding][entry.doge] = true;
			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])
		{
			visited[nBuilding][entry.doge] = true;
			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:53:57: 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:61: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:68: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 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 3 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 3 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 3 ms 876 KB Output is correct
11 Correct 5 ms 1004 KB Output is correct
12 Correct 11 ms 1004 KB Output is correct
13 Correct 12 ms 1004 KB Output is correct
14 Correct 5 ms 1004 KB Output is correct
15 Correct 5 ms 1004 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8376 KB Output is correct
2 Correct 3 ms 8376 KB Output is correct
3 Correct 3 ms 8376 KB Output is correct
4 Correct 3 ms 8376 KB Output is correct
5 Correct 2 ms 8376 KB Output is correct
6 Correct 3 ms 8376 KB Output is correct
7 Correct 2 ms 8376 KB Output is correct
8 Correct 3 ms 8376 KB Output is correct
9 Correct 3 ms 8376 KB Output is correct
10 Correct 4 ms 8376 KB Output is correct
11 Correct 4 ms 8376 KB Output is correct
12 Correct 12 ms 8376 KB Output is correct
13 Correct 12 ms 8376 KB Output is correct
14 Correct 5 ms 8376 KB Output is correct
15 Correct 5 ms 8376 KB Output is correct
16 Correct 4 ms 8376 KB Output is correct
17 Correct 11 ms 8376 KB Output is correct
18 Correct 5 ms 8376 KB Output is correct
19 Correct 5 ms 8376 KB Output is correct
20 Correct 141 ms 8392 KB Output is correct
21 Correct 5 ms 8392 KB Output is correct
22 Correct 3 ms 8392 KB Output is correct
23 Correct 10 ms 8392 KB Output is correct
24 Correct 14 ms 8392 KB Output is correct
25 Correct 7 ms 8392 KB Output is correct
26 Correct 13 ms 8392 KB Output is correct
27 Correct 17 ms 8392 KB Output is correct
28 Correct 19 ms 8536 KB Output is correct
29 Correct 14 ms 8536 KB Output is correct
30 Correct 15 ms 8536 KB Output is correct
31 Correct 16 ms 8536 KB Output is correct
32 Correct 14 ms 8536 KB Output is correct
33 Correct 18 ms 8536 KB Output is correct
34 Correct 17 ms 8548 KB Output is correct
35 Correct 49 ms 8548 KB Output is correct
36 Correct 10 ms 8548 KB Output is correct
37 Correct 37 ms 9076 KB Output is correct
38 Correct 44 ms 9788 KB Output is correct
39 Correct 35 ms 9788 KB Output is correct
40 Correct 49 ms 9788 KB Output is correct
41 Correct 51 ms 10284 KB Output is correct
42 Correct 36 ms 10284 KB Output is correct
43 Execution timed out 1072 ms 10500 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

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