Submission #1251073

#	Time	Username	Problem	Language	Result	Execution time	Memory
1251073		somefolk	3개의 봉우리 (IOI25_triples)	C++20	14 / 100	2095 ms	1984 KiB

triples

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;

#define endl "\n"
#define ll long long

const int INF = 1e9+7;
const int MOD = 1e9+7;

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

bool check(int d1, int d2, int d3, int h1, int h2, int h3){
    return (((d1 == h1 && d2 == h2 && d3 == h3) ||
        (d1 == h1 && d2 == h3 && d3 == h2) ||
        (d1 == h2 && d2 == h1 && d3 == h3) ||
        (d1 == h2 && d2 == h3 && d3 == h1) ||
        (d1 == h3 && d2 == h1 && d3 == h2) ||
        (d1 == h3 && d2 == h2 && d3 == h1)));
}

ll sb12(int n, vector<int> &a){
    ll cnt = 0;
    int mx = *max_element(a.begin(), a.end());
    for(int i = 0; i < n; i++){
        for(int j = i+1; j <= min(i+mx, n-1); j++){
            for(int k = j; k <= min(j+mx, n-1); k++){
                cnt += check(j-i, k-j, k-i, a[i], a[j], a[k]);
            }
        }
    }
    return cnt;
}

ll count_triples(vector<int> a){
    int n = (int)a.size();

    return sb12(n, a);
}

• 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