Submission #1364426

#	Time	Username	Problem	Language	Result	Execution time	Memory
1364426		activedeltorre	3개의 봉우리 (IOI25_triples)	C++20	29.29 / 100	2095 ms	1948 KiB

triples

#include "triples.h"
#include <cassert>
#include <cstdio>
#include <vector>

using namespace std;
long long count_triples(std::vector<int> H)
{
    int n=H.size(),hmax=0,z;
    for(int i=1; i<=n; i++)
    {
        hmax=max(hmax,H[i-1]);
    }
    int cnt=0;
    for(int i=1; i<=n; i++)
    {
        for(int j=i+1; j<=min(n,i+hmax); j++)
        {
            int j1=H[i-1];
            int j2=H[j-1];
            if(j1==j2)
            {
                z=j+j2;
                if(z<=n)
                {
                    if(j-i==j1 && H[z-1]==j1+j2)
                    {
                        cnt++;
                    }
                }
            }
            else
            {
                if(j1<j2)
                {
                    swap(j1,j2);
                }
                if(j2==j-i)
                {
                    z=j+j1;
                    if(z<=n)
                    {
                        if(H[z-1]==j1+j2)
                        {
                            cnt++;
                        }
                    }
                    z=i+j1;
                    if(z<=n)
                    {
                        if(H[z-1]==z-j)
                        {
                            cnt++;
                        }
                    }
                }
                else if(j1==j-i)
                {
                    z=j+j2;
                    if(z<=n)
                    {
                        if(H[z-1]==j1+j2)
                        {
                            cnt++;
                        }
                    }
                }
                else if(j1==j2+j-i)
                {
                    z=i+j1;
                    if(z<=n)
                    {
                        if(H[z-1]==j-i)
                        {
                            cnt++;
                        }
                    }
                }
            }
        }
    }
    return cnt;
}

std::vector<int> construct_range(int M, int K)
{
    vector<int>rasp;
    for(int i=0; i<M; i++)
    {
        if(i%3==1)
            rasp.push_back(2);
        else
            rasp.push_back(1);
    }
    return rasp;
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 6 / 6
• Subtask 3: 10 / 10
• Subtask 4: 0 / 11
• Subtask 5: 0 / 16
• Subtask 6: 0 / 19
• Subtask 7: 3 / 5
• Subtask 8: 1.245 / 5
• Subtask 9: 0.4998 / 5
• Subtask 10: 0.2143 / 5
• Subtask 11: 0.25 / 5
• Subtask 12: 0.0833 / 5