Submission #1263681

#	Time	Username	Problem	Language	Result	Execution time	Memory
1263681		vtnoo	Triple Peaks (IOI25_triples)	C++20	18 / 100	2096 ms	1864 KiB

triples

#include <bits/stdc++.h>

using namespace std;

std::vector<int> construct_range(int M, int K){

}

long long count_triples(std::vector<int> H){
    int n=H.size();
    long long ans=0;
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            vector<int> K={i+H[i], j+H[i], i+H[j], j+H[j]};
            sort(K.begin(), K.end());
            K.erase(unique(K.begin(), K.end()), K.end());
            for(auto k:K){
                if(k>j&&k<n){
                    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){
                        ans++;
                    }
                }
            }
        }
    }
    return ans;
}

Compilation message (stderr)

triples.cpp: In function 'std::vector<int> construct_range(int, int)':
triples.cpp:7:1: warning: no return statement in function returning non-void [-Wreturn-type]
    7 | }
      | ^

• 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