Submission #1250308

#	Time	Username	Problem	Language	Result	Execution time	Memory
1250308		alex0152	Triple Peaks (IOI25_triples)	C++20	14 / 100	2095 ms	1984 KiB

triples

#include <bits/stdc++.h>
using namespace std;
const int nMax=2e5+5;

long long count_triples(std::vector<int> H)
{
    int n=H.size(),a[3],b[3];
    long long ans=0;
    bool ok=1;
    for(int i=0; i<n; ++i)
        if(H[i]>10)
            ok=0;
    if(!ok)
    {
        for(int i=0; i<n-2; ++i)
            for(int j=i+1; j<n-1; ++j)
                for(int p=j+1; p<n; ++p)
                {
                    a[0]=H[i],a[1]=H[j],a[2]=H[p];
                    b[0]=j-i,b[1]=p-i,b[2]=p-j;
                    sort(a,a+3);
                    sort(b,b+3);
                    if(a[0]==b[0] && a[1]==b[1] && a[2]==b[2])
                        ans++;
                }
    }
    else
    {
        for(int i=0; i<n-2; ++i)
            for(int j=i+1; j<min(i+10,n-1); ++j)
                for(int p=j+1; p<min(i+11,n); ++p)
                {
                    a[0]=H[i],a[1]=H[j],a[2]=H[p];
                    b[0]=j-i,b[1]=p-i,b[2]=p-j;
                    sort(a,a+3);
                    sort(b,b+3);
                    if(a[0]==b[0] && a[1]==b[1] && a[2]==b[2])
                        ans++;
                }
    }
        
    return ans;
}
std::vector<int> construct_range(int M, int K)
{
    return{};
}

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