제출 #1338657

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1338657		khanhphucscratch	3개의 봉우리 (IOI25_triples)	C++20	6 / 100	19 ms	2748 KiB

triples

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

long long count_triples(vector<int> a) {
    /*Subtask 2*/
    long long ans = 0;
    int n = a.size();
    //Fix the last number
    for(int i = 1; i <= n; i++) a.push_back(0); //Avoid RTE
    for(int i = 0; i < n; i++){
        for(int j = i+2; j < min(n, i+15); j++){
            //Fix two ends
            //Case 1: a[i] = x, a[j] = y
            if(a[i]+a[j] == j-i && a[i+a[i]] == j-i) ans++;
            //Case 2: a[i] = y, a[j] = x
            if(a[i] != a[j] && a[i]+a[j] == j-i && a[i+a[j]] == j-i) ans++;
            //Case 3: a[i] = x+y, a[j] = x
            if(a[i] == j-i && a[j] < a[i] && a[i+a[j]] == (a[i]-a[j])) ans++;
            //Case 4: a[i] = x+y, a[j] = y
            if(a[i] == j-i && a[j] < a[i] && a[i+(a[i]-a[j])] == (a[i]-a[j]) && a[i] != a[j] * 2) ans++;
            //Case 5: a[i] = x, a[j] = x+y
            if(a[j] == j-i && a[i] < a[j] && a[i+a[i]] == (a[j]-a[i])) ans++;
            //Case 6: a[i] = y, a[j] = x+y
            if(a[j] == j-i && a[i] < a[j] && a[i+(a[j] - a[i])] == (a[j]-a[i]) && a[j] != a[i] * 2) 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: 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