답안 #60480 :: oj.uz

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

skyscraper

#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;
		}
		
		if (!dogesInBuildings[entry.building].empty())
		{
			int nextDoge = dogesInBuildings[entry.building].back();
			dogesInBuildings[entry.building].pop_back();
			visited[entry.building][nextDoge] = true;
			q.push_front(QEntry { entry.building, nextDoge, 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:63: 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 });
                                                               ^
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:67: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

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	488 KB	Output is correct
3	Correct	3 ms	488 KB	Output is correct
4	Correct	3 ms	488 KB	Output is correct
5	Correct	3 ms	596 KB	Output is correct
6	Correct	4 ms	640 KB	Output is correct
7	Correct	3 ms	640 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	640 KB	Output is correct
2	Correct	2 ms	640 KB	Output is correct
3	Correct	3 ms	640 KB	Output is correct
4	Correct	3 ms	640 KB	Output is correct
5	Correct	3 ms	640 KB	Output is correct
6	Correct	3 ms	640 KB	Output is correct
7	Correct	4 ms	640 KB	Output is correct
8	Correct	2 ms	640 KB	Output is correct
9	Correct	5 ms	640 KB	Output is correct
10	Correct	3 ms	852 KB	Output is correct
11	Correct	4 ms	852 KB	Output is correct
12	Correct	6 ms	852 KB	Output is correct
13	Correct	5 ms	980 KB	Output is correct
14	Correct	4 ms	980 KB	Output is correct
15	Correct	5 ms	980 KB	Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	8020 KB	Output is correct
2	Correct	3 ms	8020 KB	Output is correct
3	Correct	2 ms	8020 KB	Output is correct
4	Correct	3 ms	8020 KB	Output is correct
5	Correct	3 ms	8020 KB	Output is correct
6	Correct	3 ms	8020 KB	Output is correct
7	Correct	2 ms	8020 KB	Output is correct
8	Correct	2 ms	8020 KB	Output is correct
9	Correct	3 ms	8020 KB	Output is correct
10	Correct	3 ms	8020 KB	Output is correct
11	Correct	4 ms	8020 KB	Output is correct
12	Correct	4 ms	8020 KB	Output is correct
13	Correct	6 ms	8020 KB	Output is correct
14	Correct	5 ms	8020 KB	Output is correct
15	Correct	5 ms	8020 KB	Output is correct
16	Correct	4 ms	8020 KB	Output is correct
17	Correct	9 ms	8020 KB	Output is correct
18	Correct	4 ms	8020 KB	Output is correct
19	Correct	4 ms	8020 KB	Output is correct
20	Correct	128 ms	8044 KB	Output is correct
21	Correct	3 ms	8044 KB	Output is correct
22	Correct	4 ms	8044 KB	Output is correct
23	Correct	10 ms	8044 KB	Output is correct
24	Correct	12 ms	8044 KB	Output is correct
25	Correct	7 ms	8044 KB	Output is correct
26	Correct	13 ms	8044 KB	Output is correct
27	Correct	14 ms	8044 KB	Output is correct
28	Correct	16 ms	8044 KB	Output is correct
29	Correct	13 ms	8044 KB	Output is correct
30	Correct	16 ms	8044 KB	Output is correct
31	Correct	15 ms	8044 KB	Output is correct
32	Correct	15 ms	8044 KB	Output is correct
33	Correct	16 ms	8044 KB	Output is correct
34	Correct	14 ms	8044 KB	Output is correct
35	Correct	31 ms	8044 KB	Output is correct
36	Correct	11 ms	8044 KB	Output is correct
37	Correct	30 ms	8172 KB	Output is correct
38	Correct	46 ms	8516 KB	Output is correct
39	Correct	39 ms	8516 KB	Output is correct
40	Correct	53 ms	8516 KB	Output is correct
41	Correct	38 ms	8516 KB	Output is correct
42	Correct	28 ms	8516 KB	Output is correct
43	Correct	30 ms	8516 KB	Output is correct
44	Correct	163 ms	8940 KB	Output is correct
45	Correct	64 ms	8940 KB	Output is correct
46	Correct	49 ms	8940 KB	Output is correct

Subtask #5
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	8940 KB	Output is correct
2	Correct	3 ms	8940 KB	Output is correct
3	Correct	3 ms	8940 KB	Output is correct
4	Correct	3 ms	8940 KB	Output is correct
5	Correct	3 ms	8940 KB	Output is correct
6	Correct	3 ms	8940 KB	Output is correct
7	Correct	2 ms	8940 KB	Output is correct
8	Correct	3 ms	8940 KB	Output is correct
9	Correct	2 ms	8940 KB	Output is correct
10	Correct	3 ms	8940 KB	Output is correct
11	Correct	4 ms	8940 KB	Output is correct
12	Correct	5 ms	8940 KB	Output is correct
13	Correct	4 ms	8940 KB	Output is correct
14	Correct	4 ms	8940 KB	Output is correct
15	Correct	4 ms	8940 KB	Output is correct
16	Correct	4 ms	8940 KB	Output is correct
17	Correct	8 ms	8940 KB	Output is correct
18	Correct	4 ms	8940 KB	Output is correct
19	Correct	4 ms	8940 KB	Output is correct
20	Correct	95 ms	8940 KB	Output is correct
21	Correct	3 ms	8940 KB	Output is correct
22	Correct	4 ms	8940 KB	Output is correct
23	Correct	11 ms	8940 KB	Output is correct
24	Correct	14 ms	8940 KB	Output is correct
25	Correct	7 ms	8940 KB	Output is correct
26	Correct	12 ms	8940 KB	Output is correct
27	Correct	14 ms	8940 KB	Output is correct
28	Correct	14 ms	8940 KB	Output is correct
29	Correct	13 ms	8940 KB	Output is correct
30	Correct	13 ms	8940 KB	Output is correct
31	Correct	13 ms	8940 KB	Output is correct
32	Correct	13 ms	8940 KB	Output is correct
33	Correct	18 ms	8940 KB	Output is correct
34	Correct	15 ms	8940 KB	Output is correct
35	Correct	34 ms	8940 KB	Output is correct
36	Correct	8 ms	8940 KB	Output is correct
37	Correct	31 ms	8940 KB	Output is correct
38	Correct	36 ms	8940 KB	Output is correct
39	Correct	32 ms	8940 KB	Output is correct
40	Correct	45 ms	8940 KB	Output is correct
41	Correct	36 ms	8940 KB	Output is correct
42	Correct	34 ms	8940 KB	Output is correct
43	Correct	32 ms	8940 KB	Output is correct
44	Correct	188 ms	8940 KB	Output is correct
45	Correct	75 ms	8940 KB	Output is correct
46	Correct	50 ms	8940 KB	Output is correct
47	Correct	67 ms	33404 KB	Output is correct
48	Correct	28 ms	33404 KB	Output is correct
49	Correct	25 ms	33404 KB	Output is correct
50	Correct	18 ms	33404 KB	Output is correct
51	Correct	179 ms	86908 KB	Output is correct
52	Correct	153 ms	95488 KB	Output is correct
53	Correct	60 ms	95488 KB	Output is correct
54	Correct	79 ms	95488 KB	Output is correct
55	Correct	99 ms	95488 KB	Output is correct
56	Execution timed out	1072 ms	95488 KB	Time limit exceeded
57	Halted	0 ms	0 KB	-

답안 #60480

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