제출 #1224451

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1224451		lkateris	A Difficult(y) Choice (BOI21_books)	C++20	0 / 100	1 ms	424 KiB

books

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

using namespace std;
int B[100005];
const int INF = 1e8;

void solve(int N, int K, long long A, int S) {

    for(int i=1;i<=N;++i) {
        B[i] = skim(i);
    }

    for(int i=1;i<=N;++i) {
        for(int j=i+1;j<=N;++j) {
            int bi = B[i];
            int bj = B[j];
            if (i == 1) B[i] = -INF;
            else B[i] = B[i-1];
            if (j == N) B[j] = INF;
            else B[j] = B[j+1];

            int low = A-B[i]-B[j];
            int high = 2*A - B[i] - B[j];
            int l,r;
            while (l <= r) {
                int mid = (l+r)/2;
                if (low <= B[mid] and B[mid] <= high) {
                    if (mid == i) mid--;
                    if (mid == j) mid++;
                    vector<int> ans = {i,j,mid};
                    answer(ans);
                }
                else if (B[mid] < low) {
                    l = mid+1;
                }
                else r = mid-1;
            }
            B[i] = bi;
            B[j] = bj;
        }
    }
    impossible();


    return;
}

• 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