# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105293 | DystoriaX | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 929 ms | 24576 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 eb emplace_back
using namespace std;
int n, m;
int b[30010], p[30010];
vector<int> doge[30010];
const int sq = sqrt(30000) + 3;
const int INF = 1e9;
int dist[sq + 1][30010];
priority_queue<tuple<int, int, int> > pq;
int main(){
scanf("%d%d", &n, &m);
for(int i = 0; i < m; i++){
scanf("%d%d", &b[i], &p[i]);
doge[b[i]].eb(p[i]);
}
for(int i = 0; i < n; i++)
for(int j = 0; j <= sq; j++)
dist[j][i] = INF;
dist[p[0] > sq ? 0 : p[0]][b[0]] = 0;
pq.push({0, b[0], p[0]});
while(!pq.empty()){
int d, pos, pow;
tie(d, pos, pow) = pq.top(); pq.pop();
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... |