# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
739458 | Username4132 | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 251 ms | 12424 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<iostream>
#include<vector>
#include<queue>
#include<set>
using namespace std;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define PB push_back
struct node{
int pos, hop, cost;
bool le, ri;
node(int Pos, int Hop, int Cost, bool Le=true, bool Ri=true) : pos(Pos), hop(Hop), cost(Cost), le(Le), ri(Ri) {}
};
const int MAXN=30010, SQ=180;
int n, m, sq, start, target;
bool done[MAXN];
vector<int> ops[MAXN];
bool len[2][MAXN][SQ];
deque<node> Q;
void add(node v, bool mode){
if(v.hop>=sq || !len[mode][v.pos][v.hop]){
if(v.hop<sq) len[mode][v.pos][v.hop]=true;
if(mode) Q.push_back(v);
else Q.push_front(v);
}
}
int main(){
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... |