Submission #1253824

#	Time	Username	Problem	Language	Result	Execution time	Memory
1253824		TIN	Triple Peaks (IOI25_triples)	C++20	8 / 100	12 ms	1864 KiB

triples

#include "triples.h"
#include <algorithm>

long long count_triples(std::vector<int> H) {
	int N = (int) H.size();
	if (N <= 100) {
		long long ans = 0;
		for (int i = 0; i < N; i++) {
			for (int j = i + 1; j < N; j++) {
				for (int k = j + 1; k < N; k++) {
					if (H[i] == j - i && H[j] == k - j && H[k] == k - i) ++ans;
					else if (H[i] == j - i && H[k] == k - j && H[j] == k - i) ++ans;
					else if (H[j] == j - i && H[i] == k - j && H[k] == k - i) ++ans;
					else if (H[j] == j - i && H[k] == k - j && H[i] == k - i) ++ans;
					else if (H[k] == j - i && H[i] == k - j && H[j] == k - i) ++ans;
					else if (H[k] == j - i && H[j] == k - j && H[i] == k - i) ++ans;
				}
			}
		}
		return ans;
	}
	return 0LL;
}

std::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