# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
35171 | cheater2k | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 929 ms | 124940 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;
const int N = 30005;
const int inf = 1e9;
int n, m;
int b[N], p[N];
vector<int> G[N], a[N];
vector< pair<int,int> > imp;
int *f[N];
int pt[N], *le[N], *ri[N];
int pos(int val, int d) {
int it = lower_bound(G[d].begin(), G[d].end(), val) - G[d].begin();
assert(G[d][it] == val);
return it;
}
int bfs() {
for (int i = 1; i < N; ++i) {
f[i] = new int[G[i].size()];
for (int j = 0; j < G[i].size(); ++j) f[i][j] = inf;
}
deque < pair<int,int> > q;
f[p[0]][pos(b[0], p[0])] = 0;
q.push_back(make_pair(p[0], pos(b[0], p[0])));
while(!q.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... |