# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66658 | tincamatei | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 201 ms | 112820 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 <bits/stdc++.h>
using namespace std;
const int MAX_N = 30000;
bitset<MAX_N> doges[MAX_N];
vector<int> scrapers[MAX_N];
int dist[MAX_N];
int doggoB[MAX_N], doggoP[MAX_N];
int dijkstra(int n, int src, int dest) {
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq;
memset(dist, 0x3f3f3f3f, sizeof(dist));
dist[src] = 0;
pq.push(make_pair(0, src));
while(!pq.empty()) {
int nod = pq.top().second, distNod = pq.top().first;
pq.pop();
if(distNod == dist[nod]) {
if(nod == dest)
return distNod;
for(auto dog: scrapers[nod]) {
int it = nod - dog, cost = 1;
while(it >= 0) {
if(dist[nod] + cost < dist[it]) {
dist[it] = dist[nod] + cost;
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... |