제출 #540422

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

books

#include <bits/stdc++.h>
#include "books.h"
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;

const int MAX_N = 1005;

ll books[MAX_N];

void solve(int n, int k, long long a, int s) {
    for (int i = 1; i <= n; i++) {
        books[i] = skim(i);
    }
    for (int i = 1; i <= n; i++) {
        for (int l = i + 1, r = n; l < r;) {
            ll sum = books[i] + books[l] + books[r];
            if (a <= sum && sum <= 2 * a) {
                answer({i, l, r});
                return;
            }
            if (sum < a) l++;
            else r--;
        }
    }
    impossible();
}
//15 3 42 8

• 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