# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
537839 | Gurban | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 755 ms | 28224 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;
using ll = long long;
const int maxn=3e4+5;
const int B = 192;
int n,m,st,fn;
int b[maxn],p[maxn];
int dis[maxn * B];
bool vis[maxn * B],done[maxn];
vector<int>doge[maxn];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
int sq = sqrt(n)+1;
for(int i = 0;i < m;i++){
cin >> b[i] >> p[i];
if(i == 0) st = b[i];
if(i == 1) fn = b[i];
doge[b[i]].push_back(p[i]);
}
for(int i = 0;i < n * sq;i++) dis[i] = 1e9;
dis[st * sq] = 0;
priority_queue<pair<int,int>>q;
# | 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... |