제출 #1251150

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

triples

#include "triples.h"

#include <bits/stdc++.h>

#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using namespace std;
using ll = long long;



long long count_triples(std::vector<int> h) {
    int n = sz(h);

    ll cnt = 0;

    for (int i = 0; i < n - 2; ++i) {
        for (int j = i + 1; j < n - 1; ++j) {
            for (int k = j + 1; k < n; ++k) {
                vector<int> a = {j - i, k - i, k - j};
                vector<int> b = {h[i], h[j], h[k]};
                sort(all(a));
                sort(all(b));
                // for (int x : a) cerr << x << " ";
                // cerr << "\n";
                // for (int x : b) cerr << x << " ";
                // cerr << "\n";
                cnt += a == b;
            }
        }
    }

    return cnt;
}

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