Submission #1251103

#	Time	Username	Problem	Language	Result	Execution time	Memory
1251103		discontinuous	Triple Peaks (IOI25_triples)	C++20	8 / 100	2095 ms	1968 KiB

triples

// Author: Anikait Prasar

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

typedef long long ll;
#define pb push_back


ll count_triples(vector<int> H) {
    int n = H.size();
    ll m = 0;
    for(int i = 0; i<n-2; i++) {
        for(int j = i+1; j<n-1; j++) {
            for(int k = j+1; k<n; k++) {
                vector<int> heights;
                vector<int> dists;

                heights.pb(H[i]);
                heights.pb(H[j]);
                heights.pb(H[k]);

                dists.pb(j-i);
                dists.pb(k-i);
                dists.pb(k-j);

                sort(heights.begin(), heights.end());
                sort(dists.begin(), dists.end());
        
                bool nope = false;
                for(int g = 0; g<3; g++) {
                    if(heights[g] != dists[g]) {
                        nope = true;
                    }
                }

                if(!nope) {
                    m++;
                }
            }
        }
    }

    return m;
}

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

• 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