# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1171605 | PieArmy | Lightning Conductor (POI11_pio) | C++20 | 64 ms | 21064 KiB |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define int ll
int n;
int arr[500023],pref[500023],ans[500023],spec[500023];
ll kes(int a,int b){
ll x=arr[a]-arr[b];
ll y=(a-b-(x*x)-1ll)/ll(2*x);
return a+max(0ll,min(ll(n-a),y<0?-1ll:(y*y)));
}
void f(){
for(int i=1;i<=n;i++){
pref[i]=pref[i-1];
spec[i]=0;
if(arr[i]>arr[pref[i]])pref[i]=i;
}
int pos=pref[n-1];
while(pos){
spec[pos]=1;
pos=pref[pos-1];
}
deque<int>q;
for(int i=1;i<=n;i++){
while(q.size()>1){
if(kes(q[1],q[0])<i)q.pop_front();
else break;
}
# | 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... |
# | 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... |