Submission #1316655

#TimeUsernameProblemLanguageResultExecution timeMemory
1316655ezzzayTriple Peaks (IOI25_triples)C++17
0 / 100
15 ms1948 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++){ int j=H[i]+i; int k=H[j]+j; 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:25:1: warning: no return statement in function returning non-void [-Wreturn-type]
   25 | }
      | ^
#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...