제출 #1251534

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1251534		chr34	3개의 봉우리 (IOI25_triples)	C++20	8 / 100	2095 ms	1864 KiB

triples

#include <vector>
#include <algorithm>

using namespace std;

long long count_triples(vector<int> H) {
    // Your logic for Part I
    int N = H.size();
    long long count = 0;
    for (int i = 0; i < N; ++i)
        for (int j = i + 1; j < N; ++j)
            for (int k = j + 1; k < N; ++k) {
                vector<int> heights = {H[i], H[j], H[k]};
                sort(heights.begin(), heights.end());

                vector<int> distances = {j - i, k - i, k - j};
                sort(distances.begin(), distances.end());

                if (heights == distances)
                    count++;
            }
    return count;
}

vector<int> construct_range(int M, int K) {
    return {}; // Dummy definition to prevent linker errors in Part I
}

• 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 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5