제출 #1288090

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1288090		nikoloz-ch	3개의 봉우리 (IOI25_triples)	C++20	30.25 / 100	2096 ms	48832 KiB

triples

#include <bits/stdc++.h>
using namespace std;

long long count_triples(std::vector<int> H){
    int N = H.size(), ans = 0;
    if(N <= 5000){
        map<int,vector<int>> mp;
        for(int i = 0; i < N; i++){
            mp[i-H[i]].push_back(i);
        }
        for(int i = 0; i < N; i++){
            for(int j = i+1; j < N; j++){
                const int k = j-i;
                if(k != H[i] and k != H[j]){
                    if(k != abs(H[i]-H[j])) continue;
                    const int p = j+min(H[i],H[j]);
                    if(p >= N or H[p] != k or p <= j) continue;
                    ans++;
                    continue;
                }
                if(k == H[i]){
                    for(auto &t : mp[i]){
                        if(t <= j) continue;
                        if(t-j != H[j]) continue;
                        ans++;
                    }
                    for(auto &t : mp[j]){
                        if(t <= j) continue;
                        if(t-i != H[j]) continue;
                        ans++;
                    }
                    continue;
                }
                for(auto &t : mp[i]){
                    if(t <= j) continue;
                    if(abs(t-j) != H[i]) continue;
                    ans++;
                }
                for(auto &t : mp[j]){
                    if(t <= j) continue;
                    if(abs(t-i) != H[i]) continue;
                    ans++;
                }
                continue;
            }
        }
        return ans;
    }
    int mx = -1e6;
    for(int i = 0; i < N; i++){
        mx = max(mx, H[i]);
    }
    if(mx <= 10){
        for(int i = 0; i < N-10; i++){
            vector<int> a;
            for(int j = i; j <= i+10; j++){
                a.push_back(H[j]);
            }
            ans += count_triples(a);
            a.pop_back();
            ans -= (i > 0 ? count_triples(a) : 0);
        }
        return ans;
    }
    map<int,multiset<int>> m;
    for(int i = 0; i < N; i++){
        m[i-H[i]].insert(i);
    }
    for(int i = 0; i < N; i++){
        auto mp = m;
        mp[i].insert(i+H[i]);
        for(auto &t : mp[i]){
            if(t <= i) continue;
            if(mp[i].count(i+H[i]) == 1 and t == i+H[i]){
            } else mp[t].insert(i+H[i]);
            for(auto &p : mp[t]){
                if(p <= t) continue;
                if(t-i == (t != i+H[i] ? (p != i+H[i] ? H[i] : H[p]) : H[t])) ans++;
            }
        }
    }
    return ans;
}


std::vector<int> construct_range(int M, int K){
    vector<int> a = {2, 1, 1, 2, 3}, ans;
    for(int i = 0; i < M/5; i++){
        for(int j = 0; j < a.size(); j++){
            ans.push_back(a[j]);
        }
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 6 / 6
• Subtask 3: 10 / 10
• Subtask 4: 0 / 11
• Subtask 5: 0 / 16
• Subtask 6: 0 / 19
• Subtask 7: 3.5 / 5
• Subtask 8: 1.4925 / 5
• Subtask 9: 0.5997 / 5
• Subtask 10: 0.2571 / 5
• Subtask 11: 0.3 / 5
• Subtask 12: 0.1 / 5