Submission #1250917

#TimeUsernameProblemLanguageResultExecution timeMemory
1250917guymmkTriple Peaks (IOI25_triples)C++20
18 / 100
2096 ms21348 KiB
// Source: https://usaco.guide/general/io #include <bits/stdc++.h> #include "triples.h" using namespace std; vector<int> v; int n; set<vector<int>>s; void is_triple(vector<int>g){ sort(g.begin(),g.end()); if(g[0]==g[1]||g[0]==g[2]||g[1]==g[2]||g[0]<0||g[2]>=n)return; vector<int>a,b; a={g[1]-g[0],g[2]-g[0],g[2]-g[1]}; b={v[g[0]],v[g[1]],v[g[2]]}; sort(a.begin(),a.end()); sort(b.begin(),b.end()); if(a==b)s.insert(g); } long long count_triples(vector<int> hsh) { v=hsh; s.clear(); int ans=0; n=v.size(); for(int i=0;i<n;i++){ for(int j=i+1;j<n;j++){ is_triple({i,j,i+v[i]}); is_triple({i,j,j+v[i]}); is_triple({i,j,i+v[j]}); is_triple({i,j,j+v[j]}); is_triple({i,j,i-v[i]}); is_triple({i,j,j-v[i]}); is_triple({i,j,i-v[j]}); is_triple({i,j,j-v[j]}); } }return s.size(); } vector<int> construct_range(int M, int K) { return {1, 1, 1}; }
#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...