Submission #1249790

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249790		kduckp	3개의 봉우리 (IOI25_triples)	C++20	8.17 / 100	2092 ms	1860 KiB

triples

#include "triples.h"
#include <vector>
#include <algorithm>

long long count_triples(std::vector<int> H) {
    long long res = 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++) {
                std::vector<int> height = {H[i], H[j], H[k]};
                std::vector<int> dist = {j - i, k - i, k - j};
                std::sort(height.begin(), height.end());
                std::sort(dist.begin(), dist.end());
                if (height == dist) res++;
            }
    return res;
}
std::vector<int> construct_range(int M, int K) {
    return {1, 1, 2};  // Đảm bảo hợp lệ: 3 phần tử, mỗi giá trị ∈ [1, N-1]
}

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