제출 #1257073

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1257073		mkkkkkkkk	3개의 봉우리 (IOI25_triples)	C++20	13.29 / 100	2101 ms	192288 KiB

triples

#include "triples.h"
#include <bits/stdc++.h>


using namespace std;

unordered_map<long long,bool> mapa;

bool check(int i,int j,int k,vector<int>& H)
{
    if(i==j || i==k || j==k)
        return false;
    if(k<0 || k>=H.size())
        return false;
        
        vector<int> vec={i,j,k};
        sort(vec.begin(),vec.end());
        if(mapa[i*4000000+j*2000+k]==true)
            return false;
    vector<int> vec1={j-i,k-i,k-j},vec2={H[i],H[j],H[k]};
    sort(vec2.begin(),vec2.end());
    sort(vec1.begin(),vec1.end());
    if(vec1==vec2)
    {
        mapa[i*4000000+j*2000+k]=true;
        return true;
        
    }
    else
        return false;
}

long long count_triples(vector<int> H) {
  if(H.size()<=2000)
  {
      long long cnt=0;
      for(int i=0;i<H.size();i++)
      {
          for(int j=i+1;j<H.size();j++)
          {
                cnt+=check(i,j,j+H[i],H)+check(i,j,i+H[i],H)+check(i,j,j-H[i],H)+check(i,j,i-H[i],H);
                cnt+=check(i,j,j+H[j],H)+check(i,j,i+H[j],H)+check(i,j,j-H[j],H)+check(i,j,i-H[j],H);
          }
      }
      return cnt;
  }
  else
  {

  }
}

vector<int> construct_range(int M, int K) {
  vector<int> res;
  for(int i=0;i<M;i++)
  {
      if((i+1)%3==0)
        res.push_back(2);
      else
        res.push_back(1);
  }
  return res;
}

컴파일 시 표준 에러 (stderr) 메시지

triples.cpp: In function 'long long int count_triples(std::vector<int>)':
triples.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
   51 | }
      | ^

• 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: 3 / 5
• Subtask 8: 1.245 / 5
• Subtask 9: 0.4998 / 5
• Subtask 10: 0.2143 / 5
• Subtask 11: 0.25 / 5
• Subtask 12: 0.0833 / 5