Submission #1771625

---

Source Code Expand

#include <cstdio>
using namespace std;
void quick_sort(long numbers[], long length){
  if (length == 1 || length == 0){
    return;
  }
  long border = numbers[0];
  long left[length];
  long right[length];
  long i = 0;
  long j = 0;
  for (long k = 1; k < length; k++){
    if (numbers[k] < border){
      left[i] = numbers[k];
      i++;
    }
    else {
      right[j] = numbers[k];
      j++;
    }
  }
  quick_sort(left, i);
  quick_sort(right, j);
  for (long l = 0; l < i; l++){
    numbers[l] = left[l];
  }
  numbers[i] = border;
  for(long l = i + 1; l < length; l++){
    numbers[l] = right[l - i - 1];
  }
}
int main(){
  long index;
  scanf("%ld", &index);
  long *difficulties = new long[index];
  for(long i = 0; i < index; i++){
    scanf("%ld", difficulties + i);
  }
  quick_sort(difficulties, index);
  long *multi_indexes = new long[index];
  long current_polonger = 0;
  for(long i = 0; i < index; i++){
    while(true){
      if (current_polonger == index){
        break;
      }
      if (difficulties[current_polonger] >= difficulties[i] * 2){
        multi_indexes[i] = current_polonger;
        break;
      }
      else{
        current_polonger++;
      }
    }
    if (current_polonger == index){
      for (long j = i; j < index; j++){
        multi_indexes[j] = -1;
      }
      break;
    }
  }
  delete[] difficulties;
  long *two_choice = new long[index];
  for(long i = 0; i < index; i++){
    if(multi_indexes[i] >= 0){
      two_choice[i] = index - multi_indexes[i];
    }
    else{
      two_choice[i] = 0;
    }
  }
  current_polonger = index - 1;
  long *three_choice = new long[index];
  long sum = 0;
  for(long i = index - 1; i >= 0; i--){
    if(multi_indexes[i] < 0){
      three_choice[i] = 0;
    }
    else{
      while(current_polonger >= multi_indexes[i]){
        sum += two_choice[current_polonger] % 1000000007;
        current_polonger--;
        sum = sum % 1000000007;
      }
      three_choice[i] = sum;
    }
  }
  delete[] two_choice;
  current_polonger = index - 1;
  long *four_choice = new long[index];
  sum = 0;
  for(long i = index - 1; i >= 0; i--){
    if(multi_indexes[i] < 0){
      four_choice[i] = 0;
    }
    else{
      while(current_polonger >= multi_indexes[i]){
        sum += three_choice[current_polonger] % 1000000007;
        current_polonger--;
        sum = sum % 1000000007;
      }
      four_choice[i] = sum;
    }
  }
  delete[] multi_indexes;
  delete[] three_choice;
  long result = 0;
  for(long i = 0; i < index; i++){
    result += four_choice[i];
    result = result % 1000000007;
  }
    printf("%ld\n", result % 1000000007);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:34:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%ld", &index);
                       ^
./Main.cpp:37:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%ld", difficulties + i);
                                   ^

Judge Result