Submission #1316652

#	Time	Username	Problem	Language	Result	Execution time	Memory
1316652		ezzzay	Triple Peaks (IOI25_triples)	C++17	18 / 100	2095 ms	1948 KiB

triples

//#include "triples.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
long long count_triples(vector<int> H) {
    int n=H.size();
    ll cnt=0;
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            int a=H[i],b=H[j];
            set<int>chk;
            if(i+b>j)chk.insert(i+b);
            chk.insert(j+b);
            if(i+a>j)chk.insert(i+a);
            chk.insert(j+a);
            for(auto k:chk){
                if(k>n)continue;
                multiset<int>st={H[i],H[j],H[k]};
                if(st.find(j-i)!=st.end())st.erase(st.find(j-i));
                if(st.find(k-i)!=st.end())st.erase(st.find(k-i));
                if(st.find(k-j)!=st.end())st.erase(st.find(k-j));
                if(st.empty()){
                    cnt++;
                }
            }
            
        }
    }
    return cnt;
}

vector<int> construct_range(int M, int K) {
    
}

Compilation message (stderr)

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

• 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