제출 #1253667

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

triples

#include <bits/stdc++.h>
using namespace std;

#define nl "\n"
#define nf endl
#define ll long long
#define pb push_back
#define _ << ' ' <<

#define INF (ll)1e18
#define mod 998244353
#define maxn 110

#include "triples.h"

long long count_triples(std::vector<int> H) {
    // subtask 3
    ll n = H.size();

    auto match = [&](ll i, ll j, ll k) {
        if (k >= n) return false;
        if (i >= j || j >= k) return false;
        array<ll, 3> a = {j - i, k - j, k - i};
        array<ll, 3> b = {H[i], H[j], H[k]};
        sort(a.begin(), a.end());
        sort(b.begin(), b.end());
        return a == b;
    };

    ll ans = 0;
    for (ll i = 0; i < n; i++) {
        for (ll j = i + 1; j < n; j++) {
            set<ll> st = {i + H[i], i + H[j], j + H[i], j + H[j]};
            for (auto k : st) {
                ans += match(i, j, k);
            }
        }
    }

    return ans;
}

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

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