제출 #1250151

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1250151		liamislazy	3개의 봉우리 (IOI25_triples)	C++20	8 / 100	2096 ms	1860 KiB

triples

#include "triples.h"
#include <bits/stdc++.h>
#define el '\n'
typedef long long llo;
#define fn(i,a,b) for (int i = a; i <= b; i++)
#define rn(i,a,b) for (int i = a; i >= b; i--)
using namespace std;

llo count_triples(vector<int> H) {
    int n = H.size();
    llo ans = 0;
    fn(j,0,n-1) {
        fn(a,1,j) {
            int i = j - a;
            if(i < 0) break;
            int max_b = n - 1 - j;
            fn(b,1,max_b) {
                int k = j + b;
                if(k >= n) break;
                vector<int> d = {a, b, a + b};
                vector<int> h = {H[i], H[j], H[k]};
                sort(d.begin(), d.end());
                sort(h.begin(), h.end());
                if(d == h) ans++;
            }
        }
    }
    return ans;
}

std::vector<int> construct_range(int M, int K)
{
    return{};
}

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