제출 #1337846

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1337846		spuike	3개의 봉우리 (IOI25_triples)	C++20	0 / 100	2093 ms	1960 KiB

triples

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
long long count_triples(vector<int>a){
    ll ans=0, n=a.size(), ma=0;
    for(int i=0;i<n;i++){
        ma=max(ma, (ll)a[i]);
    }
    for(int i=0;i<n-ma;i++){
        for(int k=i+2;k<n && k-i<=ma;k++){
            if(a[i]>k-i || a[k]>k-i)continue;
            for(int j=i+1;j<k;j++){
                ll r1=j-i, r2=k-j, r3=k-i;
                ll r11=a[i], r12=a[j], r13=a[k];
                if(r11>r12)swap(r11, r12);
                if(r11>r13)swap(r11, r13);
                if(r12>r13)swap(r12, r13);
                if(r1>r2)swap(r1, r2);
                if(r1>r3)swap(r1, r3);
                if(r2>r3)swap(r2, r3);
                if(r1==r11 && r2==r12 && r3==r13)ans++;
            }
        }
    }
    return ans;
}
vector<int> construct_range(int M, int K){
    return{};
};

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