Submission #1249858

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249858		kduckp	3개의 봉우리 (IOI25_triples)	C++20	6.17 / 100	2094 ms	1972 KiB

triples

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

long long count_triples(vector<int> H) {
    int n = H.size();
    long long res = 0;

    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> h = {H[i], H[j], H[k]};
                    vector<int> d = {j - i, k - i, k - j};
                    sort(h.begin(), h.end());
                    sort(d.begin(), d.end());
                    if (h == d) res++;
                }
        return res;
    }
    bool small_value = true;
    for (int h : H)
        if (h > 10) {
            small_value = false;
            break;
        }

    if (small_value) {
        for (int i = 0; i < n; ++i)
            for (int j = i + 1; j < min(n, i + 11); ++j)
                for (int k = j + 1; k < min(n, i + 22); ++k) {
                    vector<int> h = {H[i], H[j], H[k]};
                    vector<int> d = {j - i, k - i, k - j};
                    sort(h.begin(), h.end());
                    sort(d.begin(), d.end());
                    if (h == d) res++;
                }
        return res;
    }
    bool increasing = true;
    for (int i = 1; i < n; ++i)
        if (H[i] < H[i - 1]) {
            increasing = false;
            break;
        }

    if (increasing) {
        for (int i = 0; i < n; ++i)
            for (int j = i + 1; 2 * j - i < n; ++j) {
                int k = 2 * j - i;
                vector<int> h = {H[i], H[j], H[k]};
                vector<int> d = {j - i, k - j, k - i};
                sort(h.begin(), h.end());
                sort(d.begin(), d.end());
                if (h == d) res++;
            }
        return res;
    }

    return 0;
}

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

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 6 / 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