제출 #1254061

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1254061		vpinx	3개의 봉우리 (IOI25_triples)	C++20	14 / 100	2095 ms	1984 KiB

triples

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

int solve_subtask2(vector<int32_t> &h) {
    int n = h.size(), ans = 0;
    for (int i = 0; i < n - 2; i++) {
        for (int j = i + 1; j < min(i + 12, n - 1); j++) {
            for (int z = j + 1; z < min(j + 12, n); z++) {
                vector<int> v = {h[i], h[j], h[z]};
                vector<int> d = {j - i, z - i, z - j};
                
                sort(v.begin(), v.end());
                sort(d.begin(), d.end());
                if (v == d) ans++;
            }
        }
    }
    return ans;
}

int count_triples(vector<int32_t> h) {
    int n = h.size();
    bool subtask2 = true;
    for (int i = 0; i < n; i++) {
        if (h[i] > 10) {
            subtask2 = false;
            break;
        }
    }
    if (subtask2) return solve_subtask2(h);
    
    int ans = 0;
    for (int i = 0; i < n - 2; i++) {
        for (int j = i + 1; j < n - 1; j++) {
            for (int z = j + 1; z < n; z++) {
                vector<int> v = {h[i], h[j], h[z]};
                vector<int> d = {j - i, z - i, z - j};
                
                sort(v.begin(), v.end());
                sort(d.begin(), d.end());
                if (v == d) ans++;
            }
        }
    }
    return ans;
}

vector<int32_t> construct_range(int32_t m, int32_t k) {
    return {1, 1, 1};
}

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