Submission #773452

#	Time	Username	Problem	Language	Result	Execution time	Memory
773452		Imeon	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	1 ms	336 KiB

books

#include<bits/stdc++.h>
#include"books.h"
using namespace std;
long long x[100000 + 1] = {0};
long long h(int j,int k){
    long long sm1 = 0;
    for (int i = j; i < j + k;i++){
        if (x[i] == 0)x[i] = skim(i);
        sm1 += x[i];
    }
    return sm1;
}
void solve(int N, int K, long long A, int S) {
    long long sm = 0;
    K--;
    for (int i = 1; i <= K;i++){
        x[i] = skim(i);
        if (i <= K)sm += x[i];
      }
        int l = K,r = N + 1;
        while (l + 1 < r){
            int md = (l + r) / 2;
            if (x[md] == 0)x[md] = skim(md);
            if ((x[md] + sm) > 2ll * A)r = md;
            else l = md;
         }
        sm += x[l];
        if (l == K or sm > 2LL * A)impossible();
        if (sm >= A and sm <= 2LL * A){
            vector<int>v;
            for (int j = 1; j <= K; j++){
                v.push_back(j);
            }
            v.push_back(l);
            answer(v);
        } 
        K++;
       // h(1,K);
        l = 0,r = N - K + 2;
        while (l + 1 < r){
            int md = (l + r) / 2; 
            if (h(md,K) > 2ll * A)r = md;
            else l = md;
         }
        int d = 0;
        vector<int>v1;
         for (int i = l; i < l + K;i++){
              if (x[i] == 0)x[i] = skim(i);
              d += x[i];
              v1.push_back(i);
            }
         if (d < A or d > 2LL * A)impossible(); 
         answer(v1);
} 

• 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