제출 #1250917

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1250917		guymmk	3개의 봉우리 (IOI25_triples)	C++20	18 / 100	2096 ms	21348 KiB

triples

// 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};
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 0 / 6
• Subtask 3: 10 / 10
• Subtask 4: 0 / 11
• Subtask 5: 0 / 16
• Subtask 6: 0 / 19
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5