제출 #1249796

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

triples

#include "triples.h"
#include <vector>
#include <algorithm>
using namespace std;

long long count_triples(std::vector<int> H) {
    long long res = 0;
    int n = H.size();
    if (n <= 100) {
        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> height = {H[i], H[j], H[k]};
            vector<int> dist = {j - i, k - i, k - j};
            sort(height.begin(), height.end());
            sort(dist.begin(), dist.end());
            if (height == dist) res++;
        }
        return res;
    }

    bool small_value = true;
    for (int h : H) {
        if (h > 10) {
            small_value = false;
            break;
        }
    }

    if (small_value) {
        vector<vector<int>> pos(11);
        for (int i = 0; i < n; ++i) {
            pos[H[i]].push_back(i);
        }

        for (int a = 1; a <= 10; ++a)
        for (int b = 1; b <= 10; ++b)
        for (int c = 1; c <= 10; ++c) {
            vector<int> h = {a, b, c};
            sort(h.begin(), h.end());
            vector<int> d = h;
            for (int i : pos[a])
            for (int j : pos[b])
            for (int k : pos[c]) {
                if (i < j && j < k) {
                    vector<int> height = {H[i], H[j], H[k]};
                    vector<int> dist = {j - i, k - i, k - j};
                    sort(height.begin(), height.end());
                    sort(dist.begin(), dist.end());
                    if (height == dist) res++;
                }
            }
        }
        return res;
    }

    return 0;
}

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

• 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