제출 #1251255

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1251255		guymmk	Triple Peaks (IOI25_triples)	C++20	11.68 / 100	109 ms	21340 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++){
      int l=i-v[i],r=i+v[i];
      is_triple({i,r,r+v[i]});
      is_triple({i,l,l-v[i]});
      if(r<n){
        is_triple({i,r,r-v[r]});
        is_triple({i,r,i+v[r]});
      }
      if(l>=0){
        is_triple({i,l,l+v[l]});
        is_triple({i,l,i-v[l]});
      }
             
            
        
    }return s.size();
}

vector<int> construct_range(int M, int K) {
  vector<int>v;
  for(int i=1;i<=M/2;i++){
    v.push_back(i);
    v.push_back(i);
  }return v;
}

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