# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1019005 | coolboy19521 | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 1 ms | 468 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 int long long
using namespace std;
const int sz = 3e4 + 12;
bool vi[sz][sz];
int b[sz], p[sz];
int a[sz];
int r, n;
void bfs(int x) {
queue<vector<int>> q;
q.push({0, x, b[x]});
while (!q.empty()) {
auto t = q.front();
q.pop();
int d = t[0];
int v = t[1];
int bs = t[2];
int u = a[bs];
// cout << d << ' ' << v << ' ' << u << '\n';
if (2 == u) {
r = d;
return;
# | 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... |