# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
824070 | lprochniak | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 259 ms | 231992 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;
#define pb push_back
#define ll long long
const int max_ans = 5000000;
const int maxN = 30005;
const int maxSqrtN = 200;
int n,m;
int zero,one;
int root;
vector<int> powers[maxN];
vector<ll> q[max_ans];
bool done[maxN][maxSqrtN];
ll Encode(int building,int power){
assert(power <= maxSqrtN);
return building + n*power;
}
int dijkstra(){
int curr_ans = 0;
int best_ans = -1;
q[0].pb(Encode(zero,0));
while(curr_ans < max_ans){
if(q[curr_ans].empty()){
curr_ans++;
continue;
}
ll top = q[curr_ans].back();
# | 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... |