Submission #544921

#TimeUsernameProblemLanguageResultExecution timeMemory
544921cig32Robots (IOI13_robots)C++17
14 / 100
200 ms15188 KiB
#include "robots.h"
#include <algorithm>
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
  // B = 0
  std::sort(W, W + T);
  std::sort(X, X + A);
  if(X[A-1] <= W[T-1]) return -1;
  int lb = 1, rb = T;
  while(lb < rb) {
    int mid = (lb + rb) >> 1;
    bool ok = 1;
    int cur = T - 1;
    for(int i=A-1; i>=0; i--) {
      ok &= (X[i] > W[cur]);
      for(int j=0; j<mid; j++) {
        if(X[i] > W[cur]) {
          cur--;
          if(cur == -1) break;
        }
      }
      if(cur == -1) break;
    }
    if(cur == -1 && ok) rb = mid;
    else lb = mid + 1;
  }
  return lb;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...