# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1026251 | xnqs | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 690 ms | 69080 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <unordered_map>
int x, dog_cnt;
std::vector<std::pair<int,int>> dogs;
std::unordered_map<int,int> dist[30005];
std::vector<int> dogs_in[30005];
int astar(int pos, int dog) {
std::priority_queue<std::tuple<int,int,int>, std::vector<std::tuple<int,int,int>>, std::greater<std::tuple<int,int,int>>> pq;
pq.emplace(-0x3f3f3f3f+std::abs(pos-dogs[1].first)*3,pos,dog);
dist[pos][dog] = -0x3f3f3f3f;
int iterations = 1500000;
while (!pq.empty()&&iterations--) {
auto [c, pos, dog] = pq.top();
pq.pop();
if (pos-dogs[dog].second>=0) {
if (!dist[pos-dogs[dog].second].count(dog)||dist[pos-dogs[dog].second][dog]>dist[pos][dog]+1) {
dist[pos-dogs[dog].second][dog] = dist[pos][dog]+1;
pq.emplace(dist[pos-dogs[dog].second][dog]+std::abs((pos-dogs[dog].second)-dogs[1].first)*3,
pos-dogs[dog].second,
dog);
}
Compilation message (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... |