Submission #1351167

#	Time	Username	Problem	Language	Result	Execution time	Memory
1351167		trideser	Triple Peaks (IOI25_triples)	C++20	8 / 100	2095 ms	1960 KiB

triples

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

bool check_triple(int a, int b, int c, int N, vector<int>& H) {
	if(a < 0 || a >= N || b < 0 || b >= N || c < 0 || c >= N) return false;
	vector<int> distances = {abs(a - b), abs(b - c), abs(c - a)};
	sort(distances.begin(), distances.end());
	vector<int> heights = {H[a], H[b], H[c]};
	sort(heights.begin(), heights.end());
	return distances == heights;
}

long long count_triples(vector<int> H) {
	int N = H.size();
	long long ret = 0;
	for(int i = 0; i < N; i++) {
		for(int j = min(i - H[i], 0); j < i - 1; j++) {
			for(int k = j + 1; k < i; k++) {
				if(check_triple(i, j, k, N, H)) ret++;
			}
		}
	}
	return ret;
}

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: 0 / 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