oj.uz

Submission #864571

# Submission time Handle Problem Language Result Execution time Memory
864571 2023-10-23T08:56:52 Z mychecksedad Measures (CEOI22_measures) C++17
0 / 100
 1500 ms 580 KB 
/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;
const double eps = 1e-5;

int n, m;
ll D;
bool check(ll m, vector<ll> &v){
  ll last = 1e18;
  for(int i = v.size() - 1; i >= 0; --i){
    if(last < v[i] - m){
      return 0;
    }
    last = min(last - D, v[i] + m - D);
  }
  return 1;
}
ll solv(vector<ll> &v){
  sort(all(v));
  ll l = 0, r = 1e18, ans = 1e18;
  while(l <= r){
    ll m = l+r>>1;
    if(check(m, v)){
      ans = m;
      r = m - 1;
    }else l = m + 1;
  }
  return ans;
}
void solve(){
  cin >> n >> m >> D;
  D *= 2;
  vector<ll> pos(n);
  for(int i = 0; i < n; ++i){
    cin >> pos[i];
    pos[i] *= 2;
  }
  for(int i = 1; i <= m; ++i){
    ll x; cin >> x;
    pos.pb(2*x);
    cout << solv(pos) / (double) 2 << '\n';
  }
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
}

Compilation message

Main.cpp: In function 'long long int solv(std::vector<long long int>&)':
Main.cpp:29:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |     ll m = l+r>>1;
      |            ~^~
Main.cpp: In function 'int main()':
Main.cpp:55:15: warning: unused variable 'aa' [-Wunused-variable]
   55 |   int tt = 1, aa;
      |               ^~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1554 ms 580 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1554 ms 580 KB Time limit exceeded
2 Halted 0 ms 0 KB -