# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40715 | IvanC | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1070 ms | 213468 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 MT make_tuple
using namespace std;
typedef tuple<int,int,int> trinca;
const int MAXN = 30010;
const int BUCKET = 175;
vector<trinca> grafo[MAXN][BUCKET];
int processado[MAXN][BUCKET],N,M,origem,destino;
int main(){
scanf("%d %d",&N,&M);
for(int i = 0;i<M;i++){
int B,P;
scanf("%d %d",&B,&P);
if(i == 0) origem = B;
else if(i == 1) destino = B;
if(P < BUCKET){
grafo[B][0].push_back(MT(B,P,0));
}
else{
for(int j = 1;B - j*P >= 0;j++){
grafo[B][0].push_back(MT(B - j*P,0,j));
}
for(int j = 1;B + j*P < N;j++){
grafo[B][0].push_back(MT(B + j*P,0,j));
}
}
}
priority_queue<trinca, vector<trinca>, greater<trinca> > Dijkstra;
Dijkstra.push(MT(0,origem,0));
while(!Dijkstra.empty()){
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... |