제출 #1316652

#제출 시각아이디문제언어결과실행 시간메모리
1316652ezzzay3개의 봉우리 (IOI25_triples)C++17
18 / 100
2095 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++){ 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) { }

컴파일 시 표준 에러 (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 | }
      | ^
#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...