Submission #991948

#	Time	Username	Problem	Language	Result	Execution time	Memory
991948		12345678	A Difficult(y) Choice (BOI21_books)	C++17	5 / 100	148 ms	908 KiB

books

#include <bits/stdc++.h>
#include "books.h"

using namespace std;

const int nx=1e5+5;

long long n, k, a[nx], t;

void solve(int N, int K, long long A, int S) {
    n=N, k=K, t=A;
    for (int i=1; i<=n; i++) a[i]=skim(i);
    for (int i=k; i<=n; i++)
    {
        for (int j=2; j<i; j++)
        {
            if (t<=a[i]+a[j]+a[j-1]&&a[i]+a[j]+a[j-1]<=2*t) answer(vector<int> {j-1, j, i});    
        }
    }
    impossible();
}

/*
5 3 10 5
1 2 9 10 100
*/

• 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