oj.uz

Submission #60507

# Submission time Handle Problem Language Result Execution time Memory
60507 2018-07-24T09:27:24 Z Eae02 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 129124 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);
	for (int i = 0; i < numBuildings; i++)
		dogesInBuildings[i].reserve(numDoges);
	
	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 && (i == 1 || dogePositions[i] - dogePowers[i] >= 0 || dogePositions[i] + dogePowers[i] < numBuildings))
			dogesInBuildings[dogePositions[i]].push_back(i);
	}
	
	std::queue<QEntry> q;
	
	q.push(QEntry { dogePositions[0], 0, 0, true });
	q.push(QEntry { dogePositions[0], 0, 0, false });
	
	while (!q.empty())
	{
		QEntry entry = q.front();
		q.pop();
		
		if (entry.doge() == 1 || dogePositions[1] == entry.building)
		{
			std::cout << entry.cost << std::endl;
			return 0;
		}
		
		for (int nextDoge : dogesInBuildings[entry.building])
		{
			int pBuilding = (int)entry.building - dogePowers[nextDoge];
			if (pBuilding >= 0)
				q.push(QEntry { pBuilding, nextDoge, entry.cost + 1, true });
			
			int nBuilding = (int)entry.building + dogePowers[nextDoge];
			if (nBuilding < numBuildings)
				q.push(QEntry { nBuilding, nextDoge, entry.cost + 1, false });
		}
		dogesInBuildings[entry.building].clear();
		
		if (entry.left())
		{
			int pBuilding = (int)entry.building - dogePowers[entry.doge()];
			if (pBuilding >= 0)
			{
				q.push(QEntry { pBuilding, entry.doge(), entry.cost + 1, true });
			}
		}
		else
		{
			int nBuilding = (int)entry.building + dogePowers[entry.doge()];
			if (nBuilding < numBuildings)
			{
				q.push(QEntry { nBuilding, entry.doge(), entry.cost + 1, false });
			}
		}
	}
	
	std::cout << "-1" << std::endl;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:52:47: 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(QEntry { dogePositions[0], 0, 0, true });
                                               ^
skyscraper.cpp:53:48: 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(QEntry { dogePositions[0], 0, 0, false });
                                                ^
skyscraper.cpp:70:63: warning: narrowing conversion of 'pBuilding' from 'int' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]
     q.push(QEntry { pBuilding, nextDoge, entry.cost + 1, true });
                                                               ^
skyscraper.cpp:70:63: warning: narrowing conversion of 'nextDoge' from 'int' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]
skyscraper.cpp:74:64: warning: narrowing conversion of 'nBuilding' from 'int' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]
     q.push(QEntry { nBuilding, nextDoge, entry.cost + 1, false });
                                                                ^
skyscraper.cpp:74:64: warning: narrowing conversion of 'nextDoge' from 'int' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]
skyscraper.cpp:83:67: warning: narrowing conversion of 'pBuilding' from 'int' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]
     q.push(QEntry { pBuilding, entry.doge(), entry.cost + 1, true });
                                                                   ^
skyscraper.cpp:91:68: warning: narrowing conversion of 'nBuilding' from 'int' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]
     q.push(QEntry { nBuilding, entry.doge(), entry.cost + 1, false });
                                                                    ^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 548 KB Output is correct
2 Correct 3 ms 548 KB Output is correct
3 Correct 3 ms 548 KB Output is correct
4 Correct 3 ms 548 KB Output is correct
5 Correct 4 ms 548 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 3 ms 548 KB Output is correct
8 Correct 6 ms 548 KB Output is correct
9 Correct 3 ms 572 KB Output is correct
10 Correct 4 ms 748 KB Output is correct
11 Correct 3 ms 1004 KB Output is correct
12 Correct 4 ms 1004 KB Output is correct
13 Correct 4 ms 1004 KB Output is correct
14 Correct 4 ms 1004 KB Output is correct
15 Correct 3 ms 1008 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8700 KB Output is correct
2 Correct 2 ms 8700 KB Output is correct
3 Correct 2 ms 8700 KB Output is correct
4 Correct 2 ms 8700 KB Output is correct
5 Correct 2 ms 8700 KB Output is correct
6 Correct 2 ms 8700 KB Output is correct
7 Correct 2 ms 8700 KB Output is correct
8 Correct 3 ms 8700 KB Output is correct
9 Correct 3 ms 8700 KB Output is correct
10 Correct 2 ms 8700 KB Output is correct
11 Correct 5 ms 8700 KB Output is correct
12 Correct 3 ms 8700 KB Output is correct
13 Correct 5 ms 8700 KB Output is correct
14 Correct 4 ms 8700 KB Output is correct
15 Correct 4 ms 8700 KB Output is correct
16 Correct 4 ms 8700 KB Output is correct
17 Correct 6 ms 8700 KB Output is correct
18 Correct 9 ms 8700 KB Output is correct
19 Correct 7 ms 8700 KB Output is correct
20 Correct 70 ms 8744 KB Output is correct
21 Correct 6 ms 8744 KB Output is correct
22 Correct 7 ms 8744 KB Output is correct
23 Correct 8 ms 8744 KB Output is correct
24 Correct 13 ms 8744 KB Output is correct
25 Correct 13 ms 8744 KB Output is correct
26 Correct 12 ms 8744 KB Output is correct
27 Correct 9 ms 8744 KB Output is correct
28 Correct 11 ms 8828 KB Output is correct
29 Correct 8 ms 8828 KB Output is correct
30 Correct 6 ms 8828 KB Output is correct
31 Correct 7 ms 8828 KB Output is correct
32 Correct 6 ms 8828 KB Output is correct
33 Correct 14 ms 8828 KB Output is correct
34 Correct 13 ms 8828 KB Output is correct
35 Correct 29 ms 8828 KB Output is correct
36 Correct 9 ms 8828 KB Output is correct
37 Correct 25 ms 9084 KB Output is correct
38 Correct 38 ms 9596 KB Output is correct
39 Correct 32 ms 9596 KB Output is correct
40 Correct 48 ms 9596 KB Output is correct
41 Correct 42 ms 9648 KB Output is correct
42 Correct 33 ms 9648 KB Output is correct
43 Correct 33 ms 9648 KB Output is correct
44 Correct 76 ms 9980 KB Output is correct
45 Correct 48 ms 9980 KB Output is correct
46 Correct 45 ms 9980 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9980 KB Output is correct
2 Correct 3 ms 9980 KB Output is correct
3 Correct 2 ms 9980 KB Output is correct
4 Correct 3 ms 9980 KB Output is correct
5 Correct 3 ms 9980 KB Output is correct
6 Correct 3 ms 9980 KB Output is correct
7 Correct 3 ms 9980 KB Output is correct
8 Correct 3 ms 9980 KB Output is correct
9 Correct 3 ms 9980 KB Output is correct
10 Correct 3 ms 9980 KB Output is correct
11 Correct 5 ms 9980 KB Output is correct
12 Correct 3 ms 9980 KB Output is correct
13 Correct 4 ms 9980 KB Output is correct
14 Correct 4 ms 9980 KB Output is correct
15 Correct 5 ms 9980 KB Output is correct
16 Correct 4 ms 9980 KB Output is correct
17 Correct 7 ms 9980 KB Output is correct
18 Correct 9 ms 9980 KB Output is correct
19 Correct 8 ms 9980 KB Output is correct
20 Correct 54 ms 9980 KB Output is correct
21 Correct 4 ms 9980 KB Output is correct
22 Correct 7 ms 9980 KB Output is correct
23 Correct 10 ms 9980 KB Output is correct
24 Correct 10 ms 9980 KB Output is correct
25 Correct 10 ms 9980 KB Output is correct
26 Correct 12 ms 9980 KB Output is correct
27 Correct 10 ms 9980 KB Output is correct
28 Correct 12 ms 9980 KB Output is correct
29 Correct 9 ms 9980 KB Output is correct
30 Correct 4 ms 9980 KB Output is correct
31 Correct 7 ms 9980 KB Output is correct
32 Correct 6 ms 9980 KB Output is correct
33 Correct 12 ms 9980 KB Output is correct
34 Correct 12 ms 9980 KB Output is correct
35 Correct 26 ms 9980 KB Output is correct
36 Correct 8 ms 9980 KB Output is correct
37 Correct 24 ms 9980 KB Output is correct
38 Correct 47 ms 9980 KB Output is correct
39 Correct 28 ms 9980 KB Output is correct
40 Correct 29 ms 9980 KB Output is correct
41 Correct 33 ms 9980 KB Output is correct
42 Correct 33 ms 9980 KB Output is correct
43 Correct 27 ms 9980 KB Output is correct
44 Correct 68 ms 9980 KB Output is correct
45 Correct 37 ms 9980 KB Output is correct
46 Correct 33 ms 9980 KB Output is correct
47 Correct 78 ms 53020 KB Output is correct
48 Correct 137 ms 98320 KB Output is correct
49 Correct 127 ms 107132 KB Output is correct
50 Correct 105 ms 116220 KB Output is correct
51 Correct 136 ms 128720 KB Output is correct
52 Correct 166 ms 128720 KB Output is correct
53 Correct 140 ms 128720 KB Output is correct
54 Correct 7 ms 128720 KB Output is correct
55 Correct 8 ms 128720 KB Output is correct
56 Execution timed out 1098 ms 129124 KB Time limit exceeded
57 Halted 0 ms 0 KB -