oj.uz

Submission #955150

# Submission time Handle Problem Language Result Execution time Memory
955150 2024-03-29T13:29:36 Z edogawa_something Sparklers (JOI17_sparklers) C++17
0 / 100
 0 ms 348 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef long double ld;
typedef pair<ll,ll> pii;
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(v) v.begin(),v.end()
#define pow poww
const ll M=1e6+10;
const ll inf=2e18;
const ll mod=1e9+7;
ll pow(ll x,ll y){
  ll res=1;
  x%=mod; 
  while(y>0){
    if((y&1))
    res*=x,res%=mod;
    x*=x,x%=mod;
    y=(y>>1);
  }
  return res;
}
ll n,t,k;
ld a[M];
bool chk(ld x){
  vector<ld>v,vv;
  for(int i=k;i<n;i++){
    v.pb(((a[i]-a[i-1])/ld(2))-x);
  }
  reverse(all(v));
  for(int i=k-2;i>=0;i--){
    vv.pb(((a[i+1]-a[i])/ld(2))-x);
  }
  reverse(all(vv));
  ld cur=0;
  while(v.size()>0||vv.size()>0){
    if(v.size()>0&&vv.size()>0){
      if(v.back()<vv.back()){
        if(v.back()>0)
        cur-=v.back();
        else
        cur-=v.back();
        v.pop_back();
      }
      else{
        if(vv.back()>0)
        cur-=vv.back();
        else
        cur-=vv.back();
        vv.pop_back();
      }
    }
    else if(v.size()>0){
      if(v.back()>0)
      cur-=v.back();
      else
      cur-=v.back();
      v.pop_back();
    }
    else{
      if(vv.back()>0)
      cur-=vv.back();
      else
      cur-=vv.back();
      vv.pop_back();
    }
    if(cur<0){
    return 0;
    }
  }
  return 1;
}
int main(){
  ios_base::sync_with_stdio(0),cin.tie(0);
  int TC=1;
  //cin>>TC;
  while(TC--){
    cin>>n>>k>>t;
    for(int i=0;i<n;i++){
      cin>>a[i];
    }
    ld l=1,r=mod,mid;
    for(int i=0;i<100;i++){
      mid=((l+r)/ld(2));
      if(chk(mid))
      r=mid;
      else
      l=mid;
    }
    ld x=ll(mid);
    if(x!=mid)
    x=x+1;
    ll y=x;
    cout<<fixed<<(y+t-1)/t<<'\n';
  }
  return 0;
}
/*
 
*/

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Halted 0 ms 0 KB -