제출 #1254619

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1254619		garam1732	3개의 봉우리 (IOI25_triples)	C++20	8.93 / 100	14 ms	1860 KiB

triples

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

#define ff first
#define ss second
#define bl ' '
#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define comp(v) (v).erase(unique(all(v)), (v).end())
#define lbd(v,x) lower_bound(all(v), (x))-(v).begin()
#define ubd(v,x) upper_bound(all(v), (x))-(v).begin()

typedef long long ll;
typedef pair<int, int> pi;
typedef pair<pi, int> pii;
typedef pair<int, pi> ipi;
typedef pair<pi, pi> pipi;
typedef pair<ll, ll> pll;

const int MAXN = 100100*2;
const ll MOD = 1e9+7;
const ll INF = 1e9+10;

long long count_triples(std::vector<int> H) {
    return 0;
}

std::vector<int> construct_range(int M, int K) {
    vector<int> v;

    vector<int> tmp = {3,1,2,1,4,3,2};
    for(int i=0;i<M;i++) v.push_back(tmp[i%7]);
    return v;
}

• 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: 5 / 5
• Subtask 8: 2.13 / 5
• Subtask 9: 0.8568 / 5
• Subtask 10: 0.3673 / 5
• Subtask 11: 0.4286 / 5
• Subtask 12: 0.1429 / 5