# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
111044 | aleksam | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1048 ms | 2240 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.
//Jakarta skysrcapers
#include <bits/stdc++.h>
#define INF MOD
#define MOD 100000007
#define MAX_N 30005
#define MAX_M 30005
#define mg 7000
using namespace std;
int N, M;
int source, dest;
struct edge{
int d, w;
};
vector<int> soli[MAX_N];
int dist[MAX_N];
bool mark[MAX_N];
void dijkstra(int s){
memset(dist, INF, sizeof(dist));
memset(mark, 0, sizeof(mark));
dist[s]=0;
priority_queue<pair<int, int> > pq;
pq.emplace(0, s);
while(!pq.empty()){
auto cur=pq.top();
pq.pop();
int v=cur.second;
# | 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... |