제출 #1254219

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1254219		TrendBattles	Triple Peaks (IOI25_triples)	C++17	51.17 / 100	2093 ms	16196 KiB

triples

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

long long count_triples(vector <int> H) {
    int N = (int) H.size();

    lli ans = 0;
    for (int iter = 1; iter <= 2; ++iter) {
        for (int i = 0; i < N; ++i) {
            if (i < H[i]) continue;
            int p = i - H[i];

            if (H[p] >= H[i]) continue;

            ans += H[p + H[p]] == H[i] - H[p];

            if (H[i] != H[p] * 2) ans += H[i - H[p]] == H[i] - H[p];
        }

        reverse(H.begin(), H.end());
    }

    if (is_sorted(H.begin(), H.end())) return ans;

    for (int i = 0; i < N; ++i) {
        if (i + H[i] >= N) continue;
        
        int j = i + H[i];
        if (H[j] > H[i] and j + H[j] - H[i] < N) ans += H[j + H[j] - H[i]] == H[j] - H[i];
    }

    //j - i = H[j] - H[i]
    vector <vector <int>> pos_vector(2 * N + 1);
    for (int i = 0; i < N; ++i) {
        int diff = i - H[i] + N;

        for (int p : pos_vector[diff]) {
            if (i + H[p] < N) ans += H[i + H[p]] == H[i] - H[p];
        }

        pos_vector[diff].push_back(i);
    } 

    for (int i = 0; i < N; ++i) {
        if (H[i] % 2) continue;

        int half_len = H[i] / 2;
        ans -= i >= half_len and H[i - half_len] == half_len and i + half_len < N and H[i + half_len] == half_len;
    }


    return ans;
}

vector<int> construct_range(int M, int K) {
  return {1, 1, 2};
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 6 / 6
• Subtask 3: 10 / 10
• Subtask 4: 11 / 11
• Subtask 5: 16 / 16
• Subtask 6: 0 / 19
• Subtask 7: 0.1667 / 5
• Subtask 8: 0.0025 / 5
• Subtask 9: 0.0001 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5