Submission #1364920

#TimeUsernameProblemLanguageResultExecution timeMemory
1364920julia_08A Difficult(y) Choice (BOI21_books)C++20
0 / 100
2 ms448 KiB
#include <bits/stdc++.h>
#include "books.h"

using namespace std;
using ll = long long;

void solve(int n, int k, ll a, int s){

  vector<pair<int, ll>> x;

  for(int i=1; i<=n; i++){

    ll cur = skim(i);
    x.push_back({i, cur});

  }

  vector<int> ans;

  ll sum = 0;

  for(int i=0; i<(k - 1); i++) sum += x[i].second;

  int l = 0;

  for(int i=(k - 1); i<x.size(); i++){

    sum += x[i].second;

    if(a <= sum && sum <= 2 * a){

      for(int j=l; j<=i; j++) ans.push_back(x[j].first);

      answer(ans);
      return;

    }

    sum -= x[l].second;
    l ++;

  }

  impossible();

}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...