제출 #1352201

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

triples

#include "triples.h"
#include <bits/stdc++.h>
using ll = long long;

using namespace std;

long long count_triples(std::vector<int> h) {
    int n = h.size();
    ll ans = 0;
    //cout << n << endl;
    for (int i = 0; i < n; i++) {
        //cout << "i is " << i << " " << h[i] << endl;
        for (int j = i+1; j < i+11; j++) {
            for (int k = j+1; k < i+11; k++) {
                if (j>=n or k>= n) {
                    break;
                }
                vector <int> v1, v2;
                v1.push_back(j-i);
                v1.push_back(k-i);
                v1.push_back(k-j);
                v2.push_back(h[i]);
                v2.push_back(h[j]);
                v2.push_back(h[k]);
                sort(v1.begin(), v1.end());
                sort(v2.begin(), v2.end());
                if (v1[0]==v2[0] and v1[1]==v2[1] and v1[2]==v2[2]) {
                    //cout << i << " " << j << " " << k << endl;
                    ans++;
                }
            }
        }
    }
    return ans;
}

int maxn = 5, big = 0;
vector <int> ans;

void call(vector <int> v) {
    if (v.size()==maxn) {
        int num = 0;
        for (int i = 0; i < maxn; i++) {
            for (int j = i+1; j < maxn; j++) {
                for (int k = j+1; k < maxn; k++) {
                    if (j>=maxn or k>= maxn) {
                        break;
                    }
                    vector <int> v1, v2;
                    v1.push_back(j-i);
                    v1.push_back(k-i);
                    v1.push_back(k-j);
                    v2.push_back(v[i]);
                    v2.push_back(v[j]);
                    v2.push_back(v[k]);
                    sort(v1.begin(), v1.end());
                    sort(v2.begin(), v2.end());
                    if (v1[0]==v2[0] and v1[1]==v2[1] and v1[2]==v2[2]) {
                        num++;
                    }
                }
            }
        }
        if (num>big) {
            ans=vector <int> (maxn);
            for (int i = 0; i < maxn; i++) {
                ans[i]=v[i];
            }
            big = num;
        }
    } else {
        for (int i = 1; i <= maxn-1; i++) {
            vector <int> vs;
            for (int j = 0; j < v.size(); j++) {
                vs.push_back(v[j]);
            }
            vs.push_back(i);
            call(vs);
        }
    }
}

std::vector<int> construct_range(int m, int k) {
    call({});
    cout << big << endl;
    for (int i = 0; i < maxn; i++) {
        cout << ans[i] << " ";
    }
    cout << endl;
    return {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