제출 #1263008

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

triples

#include "triples.h"
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int maxn = 2e5 + 10;
int n;
long long a[maxn];
long long count_triples(std::vector<int> H)
{
    n = H.size();
    for (int i = 1; i <= n; ++ i)
    {
        a[i] = H[i-1];
    }
    long long ans = 0;
    for (int i = 1; i <= n; ++ i)
    {
        for (int j = i+2; j <= min(n, i+10); ++ j)
        {
            for (int k = i+1; k <= j-1; ++ k)
            {
                vector < int > dist, val;
                val.pb(a[i]);
                val.pb(a[j]);
                val.pb(a[k]);
                dist.pb(k - i);
                dist.pb(j - k);
                dist.pb(j - i);
                sort(dist.begin(), dist.end());
                sort(val.begin(), val.end());
                int no = 0;
                for (int id = 0; id < 3; ++ id)
                    if(val[id] != dist[id])no = 1;
                if(!no)ans ++;
            }
        }
    }
  return ans;
}

std::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