Submission #1316654

#TimeUsernameProblemLanguageResultExecution timeMemory
1316654ezzzayTriple Peaks (IOI25_triples)C++17
6 / 100
823 ms1968 KiB
//#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<min(n,i+11);j++){
            for(int k=j+1;k<min(n,i+11);k++){
                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:27:1: warning: no return statement in function returning non-void [-Wreturn-type]
   27 | }
      | ^
#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...