제출 #1338653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1338653		khanhphucscratch	Triple Peaks (IOI25_triples)	C++20	11 / 100	13 ms	1960 KiB

triples

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

long long count_triples(vector<int> a) {
    /*Subtask 4*/
    long long ans = 0, n = a.size();
    //Fix the last number
    for(int i = 0; i < n; i++){
        int l = i - a[i];
        if(l < 0 || l >= i-1 || a[l] >= a[i]) continue;
        //Case 1: a[l] = x
        if(l+a[l] < i && a[l] + a[l+a[l]] == a[i]) ans++;
        //Case 2: a[l] = y
        if(i-a[l] > l && a[l] + a[i-a[l]] == a[i] && a[i] != 2*a[l]) ans++;
    }
    return ans;
}

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