제출 #1288050

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1288050		nikoloz-ch	3개의 봉우리 (IOI25_triples)	C++20	19.88 / 100	497 ms	8980 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;
    }
    for(int i = 0; i < N-9; i++){
        vector<int> a, b;
        for(int j = i; j <= i+9; j++){
            a.push_back(H[j]);
            if(j < i+9) b.push_back(H[j]);
        }
        ans += count_triples(a)-count_triples(b);
    }
    return ans;
}


std::vector<int> construct_range(int M, int K){
    vector<int> a = {4, 1, 4, 3, 2, 6, 4, 1, 4, 3, 2, 6, 4, 1, 4, 3, 2, 6, 1, 2};
    if(M == 20) return a;
    if(M == 500){
        for(int i = 0; i < 24; i++){
            auto op = a;
            for(int j = 0; j < 20; j++) a.push_back(op[j]);
        }
        return a;
    }
    if(M == 5000){
        for(int i = 0; i < 245; i++){
            auto op = a;
            for(int j = 0; j < 20; j++) a.push_back(op[j]);
        }
        return a;
    }
    if(M == 30000){
        for(int i = 0; i < 1200; i++){
            auto op = a;
            for(int j = 0; j < 20; j++) a.push_back(op[j]);
        }
        return a;
    }
    for(int i = 0; i < 2000; i++){
        auto op = a;
        for(int j = 0; j < 20; j++) a.push_back(op[j]);
    }
    return a;
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 0 / 6
• Subtask 3: 10 / 10
• Subtask 4: 0 / 11
• Subtask 5: 0 / 16
• Subtask 6: 0 / 19
• Subtask 7: 1.1667 / 5
• Subtask 8: 0.4375 / 5
• Subtask 9: 0.1722 / 5
• Subtask 10: 0.0601 / 5
• Subtask 11: 0.035 / 5
• Subtask 12: 0.0058 / 5