oj.uz

Submission #60487

# Submission time Handle Problem Language Result Execution time Memory
60487 2018-07-24T09:02:39 Z Eae02 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 2952 KB 
#include <bits/stdc++.h>

#pragma pack(push, 1)
struct QEntry
{
	uint16_t building;
	uint16_t dogeAndL;
	int cost;
	
	QEntry(uint16_t building, uint16_t doge, int cost, bool left)
	{
		this->building = building;
		this->cost = cost;
		this->dogeAndL = (doge << 1) | (left ? 1 : 0);
	}
	
	bool left()
	{
		return dogeAndL & 0x1;
	}
	
	uint16_t doge()
	{
		return dogeAndL >> 1;
	}
};
#pragma pack(pop)

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];
		
		if (i != 0)
			dogesInBuildings[dogePositions[i]].push_back(i);
	}
	
	std::deque<QEntry> q;
	
	q.push_back(QEntry { dogePositions[0], 0, 0, true });
	q.push_back(QEntry { dogePositions[0], 0, 0, false });
	
	while (!q.empty())
	{
		QEntry entry = q.front();
		q.pop_front();
		
		if (entry.doge() == 1 || dogePositions[1] == entry.building)
		{
			std::cout << entry.cost << std::endl;
			return 0;
		}
		
		if (!dogesInBuildings[entry.building].empty())
		{
			int nextDoge = dogesInBuildings[entry.building].back();
			dogesInBuildings[entry.building].pop_back();
			q.push_front(QEntry { entry.building, nextDoge, entry.cost, true });
			q.push_front(QEntry { entry.building, nextDoge, entry.cost, false });
		}
		
		if (entry.left())
		{
			int pBuilding = (int)entry.building - dogePowers[entry.doge()];
			if (pBuilding >= 0)
			{
				q.push_back(QEntry { pBuilding, entry.doge(), entry.cost + 1, true });
			}
		}
		else
		{
			int nBuilding = (int)entry.building + dogePowers[entry.doge()];
			if (nBuilding < numBuildings)
			{
				q.push_back(QEntry { nBuilding, entry.doge(), entry.cost + 1, false });
			}
		}
	}
	
	std::cout << "-1" << std::endl;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:50:52: 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, true });
                                                    ^
skyscraper.cpp:51:53: 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, false });
                                                     ^
skyscraper.cpp:68:69: warning: narrowing conversion of 'nextDoge' from 'int' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]
    q.push_front(QEntry { entry.building, nextDoge, entry.cost, true });
                                                                     ^
skyscraper.cpp:69:70: warning: narrowing conversion of 'nextDoge' from 'int' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]
    q.push_front(QEntry { entry.building, nextDoge, entry.cost, false });
                                                                      ^
skyscraper.cpp:77:72: 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, true });
                                                                        ^
skyscraper.cpp:85:73: 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, false });
                                                                         ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 356 KB Output is correct
3 Correct 3 ms 520 KB Output is correct
4 Correct 3 ms 520 KB Output is correct
5 Correct 3 ms 520 KB Output is correct
6 Correct 3 ms 520 KB Output is correct
7 Correct 0 ms 520 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 520 KB Output is correct
2 Correct 3 ms 520 KB Output is correct
3 Correct 3 ms 520 KB Output is correct
4 Correct 2 ms 544 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 2 ms 616 KB Output is correct
9 Correct 3 ms 616 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 4 ms 620 KB Output is correct
12 Correct 3 ms 620 KB Output is correct
13 Correct 4 ms 620 KB Output is correct
14 Correct 5 ms 620 KB Output is correct
15 Correct 4 ms 624 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 748 KB Output is correct
2 Correct 3 ms 748 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 3 ms 748 KB Output is correct
7 Correct 2 ms 748 KB Output is correct
8 Correct 2 ms 748 KB Output is correct
9 Correct 4 ms 748 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 4 ms 748 KB Output is correct
12 Correct 5 ms 748 KB Output is correct
13 Correct 4 ms 748 KB Output is correct
14 Correct 4 ms 748 KB Output is correct
15 Correct 4 ms 748 KB Output is correct
16 Correct 3 ms 748 KB Output is correct
17 Correct 5 ms 748 KB Output is correct
18 Correct 4 ms 748 KB Output is correct
19 Correct 3 ms 748 KB Output is correct
20 Correct 47 ms 876 KB Output is correct
21 Correct 5 ms 876 KB Output is correct
22 Correct 3 ms 876 KB Output is correct
23 Correct 3 ms 876 KB Output is correct
24 Correct 5 ms 876 KB Output is correct
25 Correct 3 ms 876 KB Output is correct
26 Correct 4 ms 876 KB Output is correct
27 Correct 4 ms 876 KB Output is correct
28 Correct 4 ms 876 KB Output is correct
29 Correct 4 ms 876 KB Output is correct
30 Correct 3 ms 876 KB Output is correct
31 Correct 4 ms 876 KB Output is correct
32 Correct 3 ms 876 KB Output is correct
33 Correct 7 ms 876 KB Output is correct
34 Correct 6 ms 876 KB Output is correct
35 Correct 24 ms 1152 KB Output is correct
36 Correct 7 ms 1152 KB Output is correct
37 Correct 19 ms 1152 KB Output is correct
38 Correct 38 ms 1308 KB Output is correct
39 Correct 25 ms 1308 KB Output is correct
40 Correct 27 ms 1308 KB Output is correct
41 Correct 28 ms 1308 KB Output is correct
42 Correct 23 ms 1308 KB Output is correct
43 Correct 24 ms 1308 KB Output is correct
44 Correct 67 ms 1660 KB Output is correct
45 Correct 31 ms 1660 KB Output is correct
46 Correct 25 ms 1660 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1660 KB Output is correct
2 Correct 2 ms 1660 KB Output is correct
3 Correct 3 ms 1660 KB Output is correct
4 Correct 3 ms 1660 KB Output is correct
5 Correct 3 ms 1660 KB Output is correct
6 Correct 3 ms 1660 KB Output is correct
7 Correct 3 ms 1660 KB Output is correct
8 Correct 4 ms 1660 KB Output is correct
9 Correct 3 ms 1660 KB Output is correct
10 Correct 3 ms 1660 KB Output is correct
11 Correct 4 ms 1660 KB Output is correct
12 Correct 4 ms 1660 KB Output is correct
13 Correct 4 ms 1660 KB Output is correct
14 Correct 4 ms 1660 KB Output is correct
15 Correct 4 ms 1660 KB Output is correct
16 Correct 4 ms 1660 KB Output is correct
17 Correct 5 ms 1660 KB Output is correct
18 Correct 3 ms 1660 KB Output is correct
19 Correct 3 ms 1660 KB Output is correct
20 Correct 43 ms 1660 KB Output is correct
21 Correct 3 ms 1660 KB Output is correct
22 Correct 4 ms 1660 KB Output is correct
23 Correct 4 ms 1660 KB Output is correct
24 Correct 5 ms 1660 KB Output is correct
25 Correct 5 ms 1660 KB Output is correct
26 Correct 5 ms 1660 KB Output is correct
27 Correct 5 ms 1660 KB Output is correct
28 Correct 5 ms 1660 KB Output is correct
29 Correct 4 ms 1660 KB Output is correct
30 Correct 3 ms 1660 KB Output is correct
31 Correct 4 ms 1660 KB Output is correct
32 Correct 4 ms 1660 KB Output is correct
33 Correct 7 ms 1660 KB Output is correct
34 Correct 4 ms 1660 KB Output is correct
35 Correct 23 ms 1660 KB Output is correct
36 Correct 8 ms 1660 KB Output is correct
37 Correct 25 ms 1660 KB Output is correct
38 Correct 25 ms 1660 KB Output is correct
39 Correct 26 ms 1660 KB Output is correct
40 Correct 23 ms 1660 KB Output is correct
41 Correct 36 ms 1660 KB Output is correct
42 Correct 36 ms 1660 KB Output is correct
43 Correct 22 ms 1660 KB Output is correct
44 Correct 65 ms 1660 KB Output is correct
45 Correct 36 ms 1660 KB Output is correct
46 Correct 30 ms 1660 KB Output is correct
47 Correct 28 ms 1660 KB Output is correct
48 Correct 36 ms 1804 KB Output is correct
49 Correct 28 ms 1804 KB Output is correct
50 Correct 30 ms 1804 KB Output is correct
51 Correct 49 ms 2220 KB Output is correct
52 Correct 46 ms 2220 KB Output is correct
53 Correct 31 ms 2220 KB Output is correct
54 Correct 3 ms 2220 KB Output is correct
55 Correct 5 ms 2220 KB Output is correct
56 Execution timed out 1049 ms 2952 KB Time limit exceeded
57 Halted 0 ms 0 KB -