제출 #1269299

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1269299		sula2	Triple Peaks (IOI25_triples)	C++20	0 / 100	70 ms	1968 KiB

triples

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

long long count_triples(vector<int> H) {
    int ans = 0, n = H.size();
    auto add = [&](int i, int j, int k) {
        if (multiset<int>{j-i, k-i, k-j} ==
            multiset<int>{H[i], H[j], H[k]}) {
            ans++;
        }
    };
    for (int k = 0; k < n; k++) {
        int i = k - H[k];
        set<int> _ = {i + H[i], k - H[i]};
        for (int j : _) add(i, j, k);
    }
    return ans;
}

vector<int> construct_range(int, int) { return {}; }

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