제출 #1344757

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1344757		ElayV13	3개의 봉우리 (IOI25_triples)	C++20	15.21 / 100	2095 ms	1960 KiB

triples

#include "triples.h"
#include "bits/stdc++.h"
using namespace std;

#define ll long long

int N;

long long count_triples(vector<int>H)
{
      int N=H.size();
      int res=0;
      for(int i=0;i<N;i++){
            for(int j=i+1;j<N;j++){
                  for(int k=j+1;k<N;k++){
                        vector<int>D1={abs(i-j),abs(i-k),abs(j-k)};
                        vector<int>D2={H[i],H[j],H[k]};
                        sort(D1.begin(),D1.end());
                        sort(D2.begin(),D2.end());
                        res+=(D1==D2);
                  }
            }
      }
      return res;
}

vector<int>construct_range(int M,int K)
{
      vector<int>H(M);
      vector<int>ord={1,2,1,3,4};
      int p=0;
      for(int i=0;i<M;i++){
            H[i]=ord[p];
            ++p;
            if(p==ord.size()) p=0;
      }
      return H;
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 0 / 6
• Subtask 3: 0 / 10
• Subtask 4: 0 / 11
• Subtask 5: 0 / 16
• Subtask 6: 0 / 19
• Subtask 7: 4 / 5
• Subtask 8: 1.74 / 5
• Subtask 9: 0.6996 / 5
• Subtask 10: 0.3 / 5
• Subtask 11: 0.35 / 5
• Subtask 12: 0.1167 / 5