제출 #1251721

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1251721		LouaiZahran	Triple Peaks (IOI25_triples)	C++20	18 / 100	2096 ms	1860 KiB

triples

#include "triples.h"

long long count_triples(std::vector<int> H) {
  long long ans = 0;

  int n = H.size();
  for(int i=0; i<n; i++){
    for(int j=i+1; j<n; j++){
      for(int k=j+1; k<n; k++){
        int dij = j - i, djk = k - j, dik = k - i;
        if(H[i] == dij && ((H[j] == djk && H[k] == dik) || (H[k] == djk && H[j] == dik)))
          ans++;
        else if(H[j] == dij && ((H[i] == djk && H[k] == dik) || (H[k] == djk && H[i] == dik)))
          ans++;
        else if(H[k] == dij && ((H[i] == djk && H[j] == dik) || (H[j] == djk && H[i] == dik)))
          ans++;
      }
    }
  }

  return ans;
}

std::vector<int> construct_range(int M, int K) {
  return {1, 1, 1};
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 0 / 6
• Subtask 3: 10 / 10
• Subtask 4: 0 / 11
• Subtask 5: 0 / 16
• Subtask 6: 0 / 19
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5