Submission #1269297

#TimeUsernameProblemLanguageResultExecution timeMemory
1269297sula2Triple Peaks (IOI25_triples)C++20
18 / 100
2095 ms1864 KiB
#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 (0 <= k && k < n && multiset<int>{j-i, k-i, k-j} ==
            multiset<int>{H[i], H[j], H[k]}) {
            ans++;
        }
    };
    for (int i = 0; i < n; i++) {
        for (int j = i+1; j < n; j++) {
            set<int> k{
                i + H[i],
                i + H[j],
                j + H[i],
                j + H[j]
            };
            for (int _ : k) add(i, j, _);
        }
    }
    return ans;
}

vector<int> construct_range(int, int) { return {}; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...