# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
582955 | Justin1 | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 54 ms | 94364 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>
#define f first
#define s second
using namespace std;
using pii = pair<int,int>;
struct edge{
int v, c;
};
int n,m,k,x,y,z;
int pos[4002005], power[4002005];
vector<edge> gph[4002005];
int dis[4002005];
priority_queue<pii,vector<pii>,greater<pii>> nxt;
int f(int i, int j) { //2d to 1d
return (i-1)*n+j;
}
string g(int i) {
if (i > n*n) cout << i-n*n;
else cout << "(" << i/n+1 << "," << i%n << ")";
return "";
}
void dijkstra() {
for (int i = 1; i <= n*n+n; i++) dis[i] = -1;
nxt.push({0,f(pos[1],power[1])});
while (nxt.size()) {
# | 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... |