제출 #1307006

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1307006		MunkhErdene	3개의 봉우리 (IOI25_triples)	C++17	11 / 100	14 ms	3500 KiB

triples

#include "triples.h"
#include <bits/stdc++.h>
using namespace std;
#define _ << ' ' <<
using ll = long long;
long long count_triples(std::vector<int> H) {
    vector<ll> a({H.begin(), H.end()});
    ll n = a.size();
    ll ans = 0;
    for(ll j = 2; j < n; j++) {
        if(j - a[j] < 0) continue;
        ll d = a[j];
        ll i = j - d;
        ll mn = a[i];
        ll cand1 = i + mn;
        ll cand2 = j - mn;
        if(cand1 == cand2) {
            if(j - cand1 == a[cand1] && cand1 != j) {ans++;}
            continue;
        }
        if(j - cand1 == a[cand1] && cand1 != j) {ans++;}
        if(cand2 - i == a[cand2] && cand2 != i) {ans++;}
    }
    return ans;
}

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

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 0 / 6
• Subtask 3: 0 / 10
• Subtask 4: 11 / 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