# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
329484 | dolphingarlic | Circus (Balkan15_CIRCUS) | C++14 | 3073 ms | 524292 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 "circus.h"
#include <bits/stdc++.h>
using namespace std;
struct State {
int cost, idx, change_cnt;
bool dir; // Left = 0
};
bool operator<(State A, State B) { return A.cost > B.cost; }
int n, m, p[100001], mn[100000];
void init(int N, int M, int P[]){
n = N, m = M;
memcpy(p, P, sizeof p);
sort(p, p + n);
p[n] = m;
memset(mn, 0x3f, sizeof mn);
priority_queue<State> pq;
pq.push({mn[n] = 0, n, 0, false});
while (pq.size()) {
State curr = pq.top();
pq.pop();
if (curr.cost != mn[curr.idx]) continue;
for (int i = 0; i < n; i++) {
if (curr.change_cnt == 2 && i > curr.idx) break;
if (abs(p[curr.idx] - p[i]) >= curr.cost && abs(p[curr.idx] - p[i]) < mn[i]) {
bool dir = p[i] > p[curr.idx];
pq.push({mn[i] = abs(p[curr.idx] - p[i]), i, curr.change_cnt + (curr.dir ^ dir), dir});
}
}
}
}
int minLength(int D) {
int ans = m - D;
for (int i = 0; i < n; i++) if (abs(D - p[i]) >= mn[i]) {
ans = min(ans, abs(D - p[i]));
}
return ans;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |