제출 #529034

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
529034		mjhmjh1104	A Difficult(y) Choice (BOI21_books)	C++17	10 / 100	1 ms	280 KiB

books

#include <map>
#include "books.h"
using namespace std;

map<int, long long> m;

long long get(int x, int K) {
    long long ret = 0;
    for (int i = 0; i < K; i++) {
        if (m.find(x + i + 1) == m.end()) m[x + i + 1] = skim(x + i + 1);
        ret += m[x + i + 1];
    }
    return ret;
}

void solve(int N, int K, long long A, int S) {
    /*int L = 0, R = N - 1;
    while (L < R) {
        int m = (L + R) / 2;
        long long t = get(m, 1);
        if (t < A) L = m + 1;
        else R = m;
    }
    if (L + 1 >= K) {
        long long t = get(L, 1) + get(0, K - 1);
        if (t >= A && t <= 2 * A) {
            vector<int> v;
            for (int i = 0; i < K - 1; i++) v.push_back(i + 1);
            v.push_back(L + 1);
            answer(v);
            return;
        }
    }*/
    long long lt = 2 * A / K, rt = (A + K - 1) / K;
    int l = 0, r = N - K + 1;
    while (l < r) {
        int m = (l + r) / 2;
        long long left = get(m, 1), right = get(m + K - 1, 1);
        if (left > lt) r = m;
        else if (right < rt) l = m + 1;
        else {
            long long t = get(m, K);
            if (t < A) l = m + 1;
            else r = m;
        }
    }
    long long t = get(l, K);
    if (t > 2 * A || t < A) {
        int l = K, r = N - 1;
        while (l < r) {
            int m = (l + r) / 2;
            long long t = get(0, K - 1) + get(m, 1);
            if (t < A) l = m + 1;
            else if (t > 2 * A) r = m - 1;
            else {
                vector<int> v;
                for (int i = 0; i < K - 1; i++) v.push_back(i + 1);
                v.push_back(m + 1);
                answer(v);
                return;
            }
        }
        impossible();
    } else {
        vector<int> v;
        for (int i = 0; i < K; i++) v.push_back(l + i + 1);
        answer(v);
    }
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 10 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20