제출 #1312934

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1312934		pedreitorzelda	3개의 봉우리 (IOI25_triples)	C++20	5.29 / 100	12 ms	2332 KiB

triples

#include<bits/stdc++.h>
using namespace std;

vector<int>construct_range(int M,int K){
    vector<int>a(M,0);
    a[M-1]=1;
    for(int i=M-2;i>=0;i--){
        a[i]=M-1-i;
    }return a;
}
bool check(int i1,int i2,int i3,vector<int>&H,set<tuple<int,int,int>>&s){
    vector<int>H_i = {H[i1],H[i2],H[i3]};
    sort(H_i.begin(),H_i.end());
    if(i3<i2)swap(i3,i2);
    if(i2<i1)swap(i2,i1);
    if(H_i[0]==i1&&H_i[1]==i2&&H_i[2]==i3){
        if(s.find({i1,i2,i3})!=s.end())return false;
        s.insert({i1,i2,i3});
        return true;
    }else return false;
}
long long count_triples(vector<int>H){
    set<tuple<int,int,int>>s;
    int n = H.size();
    int cant =0 ;
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){//i+H[i],i-H[i],j+H[i],j-H[i]
            if(check(i,j,i+H[i],H,s)){
                cant++;
            }else if(check(i,j,i+H[j],H,s)){
                cant++;
            }else if(check(i,j,i-H[i],H,s)){
                cant++;
            }else if(check(i,j,i-H[j],H,s)){
                cant++;
            }else if(check(i,j,j+H[i],H,s)){
                cant++;
            }else if(check(i,j,j+H[j],H,s)){
                cant++;
            }else if(check(i,j,j-H[i],H,s)){
                cant++;
            }else if(check(i,j,j-H[j],H,s)){
                cant++;
            }
        }
    }return cant;
}
/*

si hay alguno q cuadra --> cuatro para un lado y simetrico y hecho, simulas
si ninguno cuadra-->

4--6----2

*/

• Subtask 0: 0 / 0
• Subtask 1: 0 / 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