제출 #444461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
444461		yungyao	A Difficult(y) Choice (BOI21_books)	C++17	5 / 100	194 ms	288 KiB

books

using namespace std;
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <utility>
#include <memory.h>
#include <map>
#include <set>

typedef long long LL;
typedef pair<int,int> pii;

#define pb push_back
#define mkp make_pair
#define iter(x) x.begin(),x.end()

const int maxn = 0;

#include "books.h"
#define mid (LB + RB)/2

void solve(int n,int k,LL a,int s){
    LL v[1010];
    for (int i=1;i<=n;++i) v[i] = skim(i);

    for (int i=1;i<n-1;++i) for (int j=i+1;j<n;++j) for (int k=j+1;k<=n;++k){
        if (v[i] + v[j] + v[k] <= a*2 and v[i] + v[j] + v[k] >= a) answer({i,j,k});
    }
    impossible();
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20