제출 #1249610

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

triples

#include "triples.h"
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,ioi=b;i<ioi;i++)
#define SZ(x) ((ll)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) {for(auto i:v)cout<<i<<" ";cout<<"\n";}
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vv;

long long count_triples(vector<int> __h) {
	ll n=SZ(__h);
	vv h;
	fore(i,0,n)h.pb(__h[i]);
	
	ll fg=1;
	fore(i,0,n-1)fg&=h[i]<=h[i+1];
	
	set<vv> all;
	
	auto good=[&](vv s){
		assert(SZ(s)==3);
		vector<ll> ds,hs;
		fore(i,0,3)fore(j,i+1,3)ds.pb(abs(s[i]-s[j]));
		fore(i,0,3)hs.pb(h[s[i]]);
		sort(ALL(hs));
		sort(ALL(ds));
		return ds==hs;
	};
	
	auto eval=[&](ll i, ll j, ll k){
		vv s={i,j,k}; sort(ALL(s));
		if(s[0]==s[1]||s[1]==s[2])return;
		if(s[0]<0||s[2]>=n)return;
		if(good(s))all.insert(s);
	};
	
	auto doit=[&](ll i, ll j){
		if(j<0||j>=n)return;
		vv ind={i,j};
		fore(wd,0,2)fore(wf,0,2)fore(ws,0,2){
			ll d=h[ind[wd]];
			ll f=ind[wf];
			ll s=ws?1:-1;
			ll k=f+s*d;
			eval(i,j,k);
		}
	};
	
	fore(i,0,n)doit(i,i+h[i]),doit(i,i-h[i]);
	if(fg)return SZ(all);
	
	// faltan las otras
	
	fore(i,0,n){
		ll b=h[i];
		fore(j,max(0ll,i-b+1),i){
			eval(j,i,j+b);
		}
	}
	
	return SZ(all);
}

vector<int> construct_range(int M, int K) {
	ll n=M;
	vv period={1,1,2};
	vector<int> a(n);
	fore(i,0,n){
		a[i]=period[i%SZ(period)];
	}
	return a;
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 6 / 6
• Subtask 3: 10 / 10
• Subtask 4: 11 / 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