# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
60477 | Eae02 | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1080 ms | 96796 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 });
break;
}
}
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;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |