# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
646167 | eNGy | Circus (Balkan15_CIRCUS) | C++17 | 13 ms | 2508 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>
#define c(x) (cerr << __LINE__ << ": " << #x << ' ' << (x) << endl, (x))
#define vis() (cerr << __LINE__ << endl)
#define ll long long
#define f first
#define s second
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using namespace std;
vector<int> X, L;
int n;
void init(int N, int M, int P[]){
n = N;
for(int i=0; i<N; i++){
X.pb(P[i]);
}
X.pb(M);
for(int x: X){
L.pb(X[n] - x);
}
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
L.resize(N+1, 1e9);
L[N] = 0;
while(!pq.empty()){
int n = pq.top().s, l = pq.top().f;
pq.pop();
if(L[n] != l) continue;
for(int i=0; i<n; i++){
if(abs(X[i] - X[n]) >= L[n]){
if(L[i] > abs(X[i] - X[n])){
L[i] = abs(X[i] - X[n]);
pq.push({L[i], i});
}
}
}
}
}
int minLength(int D) {
int l = X[n] - D;
for(int i=0; i<n; i++){
if(X[i] == D)
return L[i];
if(abs(X[i] - D) >= L[i]){
l = min(l, abs(X[i] - D));
}
}
return l;
}
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... |