제출 #1100554

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

books

#include "bits/stdc++.h"
#include "books.h"
//#define int long long
using namespace std;
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()

void solve(int n, int k, long long A, int s) {
    vector<long long> ilk;
    for(int i=1;i<=k;i++) ilk.push_back(skim(i));
    long long summ=accumulate(all(ilk),0LL);
    if(summ>2*A){
      impossible();
      return;
    }
    if(summ>=A){
      vector<int> lol;
      for(int i=1;i<=k;i++) lol.push_back(i);
      answer(lol);
      return;
    }
    int l=k,r=n;
    while(l<r){
      int mid=(l+r+1)/2;
      if(skim(mid)<A) l=mid;
      else r=mid-1;  
    }
    long long kaydet1=skim(l);
    long long kaydet2=-1;
    if(l+1<=n) kaydet2=skim(l+1);
    summ-=ilk[k-1];
    summ+=kaydet1;
    if(summ>=A && summ<=2*A){
      vector<int> lol;
      for(int i=1;i<k;i++) lol.push_back(i);
      lol.push_back(l);
      answer(lol);
      return;
    }
    if(kaydet2==-1){
      impossible();
      return;
    }
    summ-=kaydet1;
    summ+=kaydet2;
    if(summ>=A && summ<=2*A){
      vector<int> lol;
      for(int i=1;i<k;i++) lol.push_back(i);
      lol.push_back(l+1);
      answer(lol);
      return;
    }
    impossible();
    return;
}

/*
void _(){
  
}

int32_t main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  int tc=1;//cin >> tc;
  while(tc--) _();
}*/

• 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