oj.uz

Submission #550678

# Submission time Handle Problem Language Result Execution time Memory
550678 2022-04-18T19:35:51 Z NaimSS Sparklers (JOI17_sparklers) C++14
0 / 100
 0 ms 304 KB 
    // modified from model solution to test a thing
    #include<iostream>
    #include<algorithm>
     
    using namespace std;
    typedef long long Int;
    Int n, t, k;
    Int x[108000];
    Int X[108000];
    bool dp[2][108000];
    Int cnt;
     
    bool check(Int v){
      for(Int i = 0;i < n;i++)X[i] = x[i] - 2 * v * t * i;
     
      Int gl = k, gr = k;
      for(Int i = k;i >= 0;i--){
        if(X[gl] <= X[i])gl = i;
      }
      for(Int i = k;i < n;i++){
        if(X[gr] >= X[i])gr = i;
      }


      for(int i=k;i>gl;i--){
        if(X[i-1] < X[i])return 0;
      }
      for(int i=0;i<gl;i++){
        if(X[i + 1] < X[i])return 0;
      }

      for(int i=k;i<gr;i++){
        if(X[i+1] > X[i])return 0;
      }
      for(int i=n-1;i>gr;i--){
        if(X[i-1] > X[i])return 0;
      }
     
      Int l = k, r = k;
      while(true){
        bool change = false;
        Int nl = l;
        while(true){
          if(nl - 1 >= gl && X[nl - 1] >= X[r])nl--;
          else break;
          if(X[nl] >= X[l] || nl == gl)break;
        }
        if(X[nl] >= X[l] && l != nl){
          l = nl;
          change = true;
        }
     
        Int nr = r;
        while(true){
          if(nr + 1 <= gr && X[nr + 1] <= X[l])nr++;
          else break;
          if(X[nr] <= X[r] || nr == gr)break;
        }
        if(X[nr] <= X[r] && r != nr){
          r = nr;
          change = true;
        }
        if(!change)break;
      }
     
     
      if(l != gl || r != gr)return false;
     
      l = 0;
      r = n-1;
      
      if(X[l] < X[r])return false;
      while(true){
        bool change = false;
        
        Int nl = l;
        while(true){
          if(nl + 1 <= gl && X[nl + 1] >= X[r])nl++;
          else break;
          if(X[nl] >= X[l] || nl == gl)break;
        }
        if(X[nl] >= X[l] && nl != l){
          l = nl;
          change = true;
        }
     
        Int nr = r;
        while(true){
          if(nr - 1 >= gr && X[nr - 1] <= X[l])nr--;
          else break;
          if(X[nr] <= X[r] || nr == gr)break;
        }
        if(X[nr] <= X[r] && nr != r){
          r = nr;
          change = true;
        }
     
        if(!change)break;
      }
     
      return (r == gr && l == gl);
    }
     
    int main(){
      cin >> n >> k >> t;
      k--;
      for(Int i = 0;i < n;i++){
        cin >> x[i];
      }
     
      bool same_check = true;
      for(int i = 0;i < n;i++){
        if(x[i] != x[0])same_check = false;
      }
      if(same_check){
        cout << 0 << endl;
        return 0;
      }
      
      Int bottom = 0, top = x[n-1];
     
      while(top - bottom > 1){
        Int mid = (top + bottom) / 2;
        if(check(mid))top = mid;
        else bottom = mid;
      }
      cout << top << endl;
      return 0;
    }

Subtask #1
0 / 30.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 50.0

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