oj.uz

Submission #850737

# Submission time Handle Problem Language Result Execution time Memory
850737 2023-09-17T11:19:32 Z d4xn A Difficult(y) Choice (BOI21_books) C++17
20 / 100
 1 ms 1364 KB 
#include <bits/stdc++.h>

#include "books.h"

using namespace std;

#define ll long long

const ll N = 1e5+5;

ll dp[N];

ll sum(ll x, ll y) {
  ll cnt = 0;
  for (ll i = 0; i < y; i++) {
    if (dp[x+i] == -1) dp[x+i] = skim(x+i);
    cnt += dp[x+i];
  }
  return cnt;
}

void solve(int N, int K, long long A, int S) {
    memset(dp, -1, sizeof(dp));

    ll l = 1;
    ll r = N;
    while (l < r) {
      ll mid = (l+r)>>1;
      if (dp[mid] == -1) dp[mid] = skim(mid);
      if (dp[mid] < A) l = mid+1;
      else r = mid;
    }

    vector<int> test = {l};
    ll cnt = dp[l];
    for (ll i = 1; i <= K-1; i++) {
      if (dp[i] == -1) dp[i] = skim(i);
      cnt += dp[i];
      test.push_back(i);
    }
    if (K-1 < l && A <= cnt && cnt <= A*2) answer(test);

    l = 1;
    r = N-K+1;
    while (l < r) {
      ll mid = (l+r)>>1;
      ll x = sum(mid, K);
      if (x < A) l = mid+1;
      else r = mid;
    }

    ll x = sum(l, K);
    if (x < A || A*2 < x) impossible();

    vector<int> ans(K);
    for (ll i = 0; i < K; i++) {
      ans[i] = l+i;
    }
    answer(ans);

/*
    l = L;
    r = N;
    while (l < r) {
      ll mid = (l+r+1)>>1;
      dp[mid] = skim(mid);
      if (pw2(dp[mid], K) > A*2) r = mid-1;
      else l = mid;
      //cerr << mid << " " << dp[mid] << " " << K << " " << A << " " << l << " " << r << endl;
    }
    ll R = l;

    if (R-L+1 >= K) {
      vector<int> ans;
      int cnt = 0;
      for (int i = L; i <= R; i++) {
        ans.push_back(i);
        cnt++;
        if (cnt == K) break;
      }
      answer(ans);
    }
    else impossible();
*/

/*
    ll x = l;
    for (ll i = 1; i < K; i++) {
      if (x+i <= N) dp[x+i] = skim(x+i);
      if (x-i > 0) dp[x-i] = skim(x-i);
    }

    vector<ll> v;
    for (int i = x-K+1; i <= x+K-1; i++) {
      if (0 < i && i <= N) v.push_back(i);
    }
    ll sz = v.size();

    for (ll mask = 0; mask < (1ll << sz); mask++) {
      if (__builtin_popcount(mask) != K) continue;
      vector<int> ans;
      ll sum = 0;
      for (int i = 0; i < sz; i++) {
        if ((mask >> i) & 1ll) {
          ans.push_back(v[i]);
          sum += dp[v[i]];
        }
      }
      if (A <= sum && sum <= A*2) {
        answer(ans);
        return;
      }
    }
    impossible();
    */
}

/*
#include <bits/stdc++.h>
 
#include "books.h"
 
using namespace std;
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
//     books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ books_sample.cpp sample_grader.cpp
// in this folder.
//
 
#define ll long long
 
int n, k, s;
ll a;
vector<ll> v, pre;
vector<int> ans;
bool ended;
 
void generate(int idx, int prev, ll sum) {
    if (ended) return;
 
    if (sum > a*2) return;
 
    if (n-prev < k-idx) return;
 
    if (sum + pre[n] - pre[n-(k-idx)] < a) return;
 
    if (idx == k) {
        if (a <= sum && sum <= a*2) {
            ended = 1;
            return;
        }
        return;
    }
 
    for (int i = prev+1; i <= n; i++) {
        ans[idx] = i;
        generate(idx+1, i, sum + v[i]);
        if (ended) return;
    }
}
 
void solve(int N, int K, long long A, int S) {
    // TODO implement this function
    // impossible()
    // answer()
    // puedo hacer S preguntas
    // hay N libros
    // ordenados de mayor a menor por precio
    // tengo que comprar K
    // y la suma tiene que ser >= A y <= A*2
 
    n = N;
    k = K;
    a = A;
    s = S;
 
    v.resize(n+1);
    pre.resize(n+1, 0);
    for (int i = 1; i <= n; i++) {
        v[i] = skim(i);
        pre[i] = pre[i-1] + v[i];
    }
 
    ended = 0;
    ans.resize(k);
    generate(0, 0, 0ll);
    if (!ended) impossible();
    answer(ans);
}
*/

Compilation message

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:34:25: warning: narrowing conversion of 'l' from 'long long int' to 'int' [-Wnarrowing]
   34 |     vector<int> test = {l};
      |                         ^
books.cpp:34:25: warning: narrowing conversion of 'l' from 'long long int' to 'int' [-Wnarrowing]

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1308 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1112 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 1 ms 1112 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Incorrect 1 ms 1112 KB Incorrect
10 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Incorrect 1 ms 1112 KB Incorrect
10 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Incorrect 1 ms 1112 KB Incorrect
10 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Incorrect 1 ms 1112 KB Incorrect
10 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Incorrect 1 ms 1112 KB Incorrect
10 Halted 0 ms 0 KB -