제출 #1253823

#제출 시각아이디문제언어결과실행 시간메모리
1253823TINTriple Peaks (IOI25_triples)C++20
0 / 100
12 ms1860 KiB
#include "triples.h" #include <algorithm> long long count_triples(std::vector<int> H) { int N = (int) H.size(); if (N <= 100) { long long ans = 0; int A[3], B[3]; for (int i = 0; i < N; i++) { A[0] = H[i]; for (int j = i + 1; j < N; j++) { A[1] = H[j]; B[0] = j - i; for (int k = j + 1; k < N; k++) { B[1] = k - j, B[2] = k - i; std::sort(A, A + 3); std::sort(B, B + 3); bool ok = true; for (int i = 0; i < 3; i++) if (A[i] != B[i]) ok = false; if (ok) ++ans; } } } return ans; } return 0LL; } std::vector<int> construct_range(int M, int K) { return {1, 1, 1}; }
#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...
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...