제출 #1265434

#제출 시각아이디문제언어결과실행 시간메모리
1265434thenpc3개의 봉우리 (IOI25_triples)C++20
6 / 100
937 ms3552 KiB
#include <bits/stdc++.h> #include "triples.h" using namespace std; #define ll long long ll n,a[200005]; ll count_triples(vector<int> v){ ll n=v.size(); for(int i=1;i<=n;i++){ a[i]=v[i-1]; } ll ans=0; for(int i=1;i<=n;i++){ ll srt=max((ll)i-11,(ll)1); ll ed=min((ll)i+11,n); for(int j=srt;j<=ed;j++){ for(int k=j+1;k<=ed;k++){ ll b[4]={k-j,k-i,j-i}; ll c[4]={a[i],a[j],a[k]}; sort(b,b+3); sort(c,c+3); int sol=1; for(int l=0;l<3;l++){ if(b[l]!=c[l]){ sol=0; } } ans+=sol; } } } return ans; } vector<int> construct_range(int m,int k){ return {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...