# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
786120 | makanhulia | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 1095 ms | 31068 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;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll MAXN = 3e4 + 5;
ll n, m, ans = -1, awal, tujuan;
vector<ll> baris[MAXN];
// bool visited[MAXN][MAXN];
map<pll, bool> visited;
void bfs() {
queue<pair<pll, ll>> que;
// {{Idx Baris, Lompat}, Dist}
for (int i = 0; i < baris[awal].size(); ++i)
{
que.push({{awal, baris[awal][i]}, 0});
}
while(!que.empty()) {
pair<pll, ll> now = que.front();
// {{Idx Baris, Lompat}, Dist}
que.pop();
if (visited[now.first])
{
continue ;
}
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... |