Submission #1342311

#	Time	Username	Problem	Language	Result	Execution time	Memory
1342311		nickolasarapidis	3개의 봉우리 (IOI25_triples)	C++17	5.29 / 100	22 ms	1960 KiB

triples

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

#define ll long long
#define F first
#define S second

ll count_triples(std::vector<int> H){
    int N = H.size();
    ll ans = 0;
    for(int i = 10; i < N - 10; i++){
        for(int j = i + 1; j <= i + 10; j++){
            for(int k = j + 1; k <= i + 10; k++){
                int dij = j - i, dik = k - i, djk = k - j;
                if((H[i] == dij and H[j] == dik and H[k] == djk) or (H[i] == dij and H[j] == djk and H[k] == dik) or (H[i] == dik and H[j] == dij and H[k] == djk) or (H[i] == dik and H[j] == djk and H[k] == dij) or (H[i] == djk and H[j] == dik and H[k] == dij) or (H[i] == djk and H[j] == dij and H[k] == dik)) ans++;
            }
        }
    }
    return ans;
}

vector<int> construct_range(int M, int K){
    vector<int> ans(M);
    int cnt = 1;
    for(int i = 0; i < M; i++){
        if(cnt == 1 or cnt == 3){
            ans[i] = 1;
        }
        else{
            ans[i] = 2;
        }
        if(cnt == 3) cnt = 1;
        else cnt++;
    }
    return ans;
}

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