제출 #1351165

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1351165		trideser	3개의 봉우리 (IOI25_triples)	C++20	8 / 100	2096 ms	2024 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) {
	vector<vector<int>> triples;
	int N = H.size();
	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)) triples.push_back({i, j, k});
			}
		}
	}
	sort(triples.begin(), triples.end());
	long long ret = 0;
	if(triples.size() != 0) ret = 1;
	for(int i = 1; i < triples.size(); i++) if(triples[i] != triples[i - 1]) 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