답안 #60525 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
60525	2018-07-24T09:55:55 Z	Eae02	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	1000 ms	214268 KB

skyscraper

#include <bits/stdc++.h>

#pragma GCC optimize("O3")

#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)

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

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::set<int> filledBuildings;
	
	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);
			
			filledBuildings.insert(dogePositions[i]);
		}
	}
	
	std::queue<QEntry> q;
	
	q.push(QEntry { dogePositions[0], 0, 0, true });
	q.push(QEntry { dogePositions[0], 0, 0, false });
	
	auto MaybePush = [&] (int b, int d, int c, bool l)
	{
		if (!visited[b][d])
		{
			visited[b][d] = true;
			q.push(QEntry { b, d, c, l });
		}
	};
	
	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;
		}
		
		if (!dogesInBuildings[entry.building].empty())
		{
			for (int nextDoge : dogesInBuildings[entry.building])
			{
				int pBuilding = (int)entry.building - dogePowers[nextDoge];
				if (pBuilding >= 0)
					MaybePush(pBuilding, nextDoge, entry.cost + 1, true);
				
				int nBuilding = (int)entry.building + dogePowers[nextDoge];
				if (nBuilding < numBuildings)
					MaybePush(nBuilding, nextDoge, entry.cost + 1, false);
			}
			dogesInBuildings[entry.building].clear();
			filledBuildings.erase(entry.building);
		}
		
		if (entry.left())
		{
			int pBuilding = (int)entry.building - dogePowers[entry.doge()];
			if (pBuilding >= 0)
			{
				if (*filledBuildings.begin() <= pBuilding)
				{
					MaybePush(pBuilding, entry.doge(), entry.cost + 1, true);
				}
			}
		}
		else
		{
			int nBuilding = (int)entry.building + dogePowers[entry.doge()];
			if (nBuilding < numBuildings)
			{
				if (*std::prev(filledBuildings.end()) >= nBuilding)
				{
					MaybePush(nBuilding, entry.doge(), entry.cost + 1, false);
				}
			}
		}
	}
	
	std::cout << "-1" << std::endl;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:62: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:63: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: In lambda function:
skyscraper.cpp:70:31: warning: narrowing conversion of 'b' from 'int' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]
    q.push(QEntry { b, d, c, l });
                               ^
skyscraper.cpp:70:31: warning: narrowing conversion of 'd' from 'int' to 'uint16_t {aka short unsigned int}' inside { } [-Wnarrowing]

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	248 KB	Output is correct
2	Correct	3 ms	492 KB	Output is correct
3	Correct	3 ms	528 KB	Output is correct
4	Correct	3 ms	528 KB	Output is correct
5	Correct	3 ms	528 KB	Output is correct
6	Correct	2 ms	528 KB	Output is correct
7	Correct	3 ms	528 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	528 KB	Output is correct
2	Correct	3 ms	612 KB	Output is correct
3	Correct	2 ms	612 KB	Output is correct
4	Correct	3 ms	612 KB	Output is correct
5	Correct	4 ms	612 KB	Output is correct
6	Correct	2 ms	612 KB	Output is correct
7	Correct	2 ms	612 KB	Output is correct
8	Correct	3 ms	680 KB	Output is correct
9	Correct	2 ms	680 KB	Output is correct
10	Correct	4 ms	1088 KB	Output is correct
11	Correct	4 ms	1220 KB	Output is correct
12	Correct	7 ms	1280 KB	Output is correct
13	Correct	5 ms	1452 KB	Output is correct
14	Correct	4 ms	1516 KB	Output is correct
15	Correct	5 ms	1516 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	1516 KB	Output is correct
2	Correct	3 ms	1516 KB	Output is correct
3	Correct	3 ms	1516 KB	Output is correct
4	Correct	3 ms	1516 KB	Output is correct
5	Correct	3 ms	1516 KB	Output is correct
6	Correct	3 ms	1516 KB	Output is correct
7	Correct	3 ms	1516 KB	Output is correct
8	Correct	3 ms	1516 KB	Output is correct
9	Correct	3 ms	1516 KB	Output is correct
10	Correct	4 ms	1516 KB	Output is correct
11	Correct	5 ms	1516 KB	Output is correct
12	Correct	4 ms	1516 KB	Output is correct
13	Correct	5 ms	1516 KB	Output is correct
14	Correct	5 ms	1516 KB	Output is correct
15	Correct	6 ms	1516 KB	Output is correct
16	Correct	3 ms	1516 KB	Output is correct
17	Correct	11 ms	6140 KB	Output is correct
18	Correct	9 ms	7420 KB	Output is correct
19	Correct	6 ms	7420 KB	Output is correct
20	Correct	65 ms	16236 KB	Output is correct
21	Correct	4 ms	16236 KB	Output is correct
22	Correct	8 ms	16236 KB	Output is correct
23	Correct	17 ms	16236 KB	Output is correct
24	Correct	20 ms	16236 KB	Output is correct
25	Correct	17 ms	16236 KB	Output is correct
26	Correct	21 ms	16236 KB	Output is correct
27	Correct	22 ms	16236 KB	Output is correct
28	Correct	25 ms	16236 KB	Output is correct
29	Correct	20 ms	16236 KB	Output is correct
30	Correct	14 ms	16236 KB	Output is correct
31	Correct	18 ms	16236 KB	Output is correct
32	Correct	18 ms	16236 KB	Output is correct
33	Correct	24 ms	16236 KB	Output is correct
34	Correct	30 ms	16236 KB	Output is correct

Subtask #4
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	16236 KB	Output is correct
2	Correct	3 ms	16236 KB	Output is correct
3	Correct	4 ms	16236 KB	Output is correct
4	Correct	3 ms	16236 KB	Output is correct
5	Correct	3 ms	16236 KB	Output is correct
6	Correct	2 ms	16236 KB	Output is correct
7	Correct	3 ms	16236 KB	Output is correct
8	Correct	3 ms	16236 KB	Output is correct
9	Correct	2 ms	16236 KB	Output is correct
10	Correct	4 ms	16236 KB	Output is correct
11	Correct	6 ms	16236 KB	Output is correct
12	Correct	7 ms	16236 KB	Output is correct
13	Correct	4 ms	16236 KB	Output is correct
14	Correct	7 ms	16236 KB	Output is correct
15	Correct	5 ms	16236 KB	Output is correct
16	Correct	4 ms	16236 KB	Output is correct
17	Correct	9 ms	16236 KB	Output is correct
18	Correct	9 ms	16236 KB	Output is correct
19	Correct	6 ms	16236 KB	Output is correct
20	Correct	58 ms	16236 KB	Output is correct
21	Correct	5 ms	16236 KB	Output is correct
22	Correct	7 ms	16236 KB	Output is correct
23	Correct	15 ms	16236 KB	Output is correct
24	Correct	19 ms	16236 KB	Output is correct
25	Correct	12 ms	16236 KB	Output is correct
26	Correct	18 ms	16236 KB	Output is correct
27	Correct	18 ms	16236 KB	Output is correct
28	Correct	23 ms	16236 KB	Output is correct
29	Correct	15 ms	16236 KB	Output is correct
30	Correct	12 ms	16236 KB	Output is correct
31	Correct	18 ms	16236 KB	Output is correct
32	Correct	16 ms	16236 KB	Output is correct
33	Correct	26 ms	16236 KB	Output is correct
34	Correct	25 ms	16236 KB	Output is correct
35	Correct	36 ms	16236 KB	Output is correct
36	Correct	12 ms	16236 KB	Output is correct
37	Correct	53 ms	16252 KB	Output is correct
38	Correct	70 ms	17036 KB	Output is correct
39	Correct	41 ms	17036 KB	Output is correct
40	Correct	44 ms	17036 KB	Output is correct
41	Correct	70 ms	17036 KB	Output is correct
42	Correct	40 ms	17036 KB	Output is correct
43	Correct	38 ms	17036 KB	Output is correct
44	Correct	79 ms	17276 KB	Output is correct
45	Correct	81 ms	17276 KB	Output is correct
46	Correct	70 ms	17276 KB	Output is correct

Subtask #5
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	17276 KB	Output is correct
2	Correct	3 ms	17276 KB	Output is correct
3	Correct	2 ms	17276 KB	Output is correct
4	Correct	3 ms	17276 KB	Output is correct
5	Correct	4 ms	17276 KB	Output is correct
6	Correct	3 ms	17276 KB	Output is correct
7	Correct	2 ms	17276 KB	Output is correct
8	Correct	4 ms	17276 KB	Output is correct
9	Correct	3 ms	17276 KB	Output is correct
10	Correct	3 ms	17276 KB	Output is correct
11	Correct	6 ms	17276 KB	Output is correct
12	Correct	5 ms	17276 KB	Output is correct
13	Correct	6 ms	17276 KB	Output is correct
14	Correct	6 ms	17276 KB	Output is correct
15	Correct	6 ms	17276 KB	Output is correct
16	Correct	4 ms	17276 KB	Output is correct
17	Correct	11 ms	17276 KB	Output is correct
18	Correct	10 ms	17276 KB	Output is correct
19	Correct	9 ms	17276 KB	Output is correct
20	Correct	76 ms	17276 KB	Output is correct
21	Correct	7 ms	17276 KB	Output is correct
22	Correct	8 ms	17276 KB	Output is correct
23	Correct	19 ms	17276 KB	Output is correct
24	Correct	25 ms	17276 KB	Output is correct
25	Correct	13 ms	17276 KB	Output is correct
26	Correct	18 ms	17276 KB	Output is correct
27	Correct	18 ms	17276 KB	Output is correct
28	Correct	21 ms	17276 KB	Output is correct
29	Correct	16 ms	17276 KB	Output is correct
30	Correct	12 ms	17276 KB	Output is correct
31	Correct	14 ms	17276 KB	Output is correct
32	Correct	18 ms	17276 KB	Output is correct
33	Correct	21 ms	17276 KB	Output is correct
34	Correct	21 ms	17276 KB	Output is correct
35	Correct	38 ms	17276 KB	Output is correct
36	Correct	12 ms	17276 KB	Output is correct
37	Correct	54 ms	17276 KB	Output is correct
38	Correct	46 ms	17276 KB	Output is correct
39	Correct	34 ms	17276 KB	Output is correct
40	Correct	38 ms	17276 KB	Output is correct
41	Correct	48 ms	17276 KB	Output is correct
42	Correct	35 ms	17276 KB	Output is correct
43	Correct	38 ms	17276 KB	Output is correct
44	Correct	74 ms	17276 KB	Output is correct
45	Correct	59 ms	17276 KB	Output is correct
46	Correct	52 ms	17276 KB	Output is correct
47	Correct	174 ms	91884 KB	Output is correct
48	Correct	144 ms	98940 KB	Output is correct
49	Correct	121 ms	107644 KB	Output is correct
50	Correct	118 ms	116648 KB	Output is correct
51	Correct	329 ms	204668 KB	Output is correct
52	Correct	334 ms	214268 KB	Output is correct
53	Correct	178 ms	214268 KB	Output is correct
54	Correct	7 ms	214268 KB	Output is correct
55	Correct	107 ms	214268 KB	Output is correct
56	Execution timed out	1091 ms	214268 KB	Time limit exceeded
57	Halted	0 ms	0 KB	-

답안 #60525

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 21.0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
21.0 / 21.0

Subtask #5
0 / 43.0