Submission #846785

#	Time	Username	Problem	Language	Result	Execution time	Memory
846785		Ahmed57	A Difficult(y) Choice (BOI21_books)	C++17	5 / 100	117 ms	1216 KiB

books

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

void solve(int N,int K,long long A,int S){
    long long arr[N];
    for(int i = 0;i<N;i++){
        arr[i] = skim(i+1);
    }
    for(int i = 0;i<N;i++){
        for(int j = i+1;j<N;j++){
            int it = lower_bound(arr+j+1,arr+N,A-arr[i]-arr[j])-arr;
            if(it==N)continue;
            if(arr[i]+arr[j]+arr[it]<=2*A){
                answer({i+1,j+1,it+1});
            }
        }
    }
    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