Submission #550307

#	Time	Username	Problem	Language	Result	Execution time	Memory
550307		Zhora_004	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	2 ms	1084 KiB

books

#include "books.h"
 
using namespace std;
 
 
void solve(int n, int k, long long a, int s) {
    vector<long long> x(n);
    for (int i = 0; i < n; i++) x[i] = skim(i + 1);
    vector<int> v;
    for (int i = 0; i < n; i++)
    {
        for (int j = i + 1; j < n - 1; j++)
        {
            long long sum = x[i] + x[j];
            if (sum >= a * 2) break;
            // sum + x >= a
            // x >= a - sum
            auto it = lower_bound(x.begin() + j + 1, x.end(), a - sum);
            if (it == x.end()) continue;
            int id = *it;
            sum += x[id];
            v = { i + 1, j + 1, id + 1 };
            if (sum <= 2 * a) answer(v);
        }
    }
    impossible();
}

• Subtask 1: 0 / 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