oj.uz

Submission #961585

# Submission time Handle Problem Language Result Execution time Memory
961585 2024-04-12T08:35:26 Z steveonalex A Difficult(y) Choice (BOI21_books) C++17
0 / 100
 1 ms 1112 KB 
#include <bits/stdc++.h>
 
#include "books.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n"){
        for(auto i: a) cout << i << separator;
        cout << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
 
void solve(int n, int k, long long A, int S) {
    vector<ll> a(n+1);
    for(int i = 1; i<=k-1; ++i) a[i] = skim(i);
    int l = k - 1, r = n;
    while(l < r){
        int mid = (l + r + 1) >> 1;
        a[mid] = skim(mid);
        ll sum = 0;
        for(int i = 1; i<=k-1; ++i) sum += a[i];
        sum += a[mid];
        if (sum <= 2 * A) l = mid;
        else r = mid - 1; 
    }
    int x = l;
 
    if (x == k-1){impossible(); return;}
 
    vector<int> ans;
    for(int i= 1; i<=k-1; ++i) ans.push_back(i); 
    ans.push_back(x);
 
    ll sum = 0;
    for(int i = 1; i<=k-1; ++i) sum += a[i];
    sum += a[l];
    if (sum < A) {
        ans.clear();
        int l = k-1, r = x-1;
        while(l < r){
            int mid = (l + r) >> 1;
            if (a[mid] == 0) a[mid] = skim(mid);
            ll sum = a[mid] * (k - 1) + (k-1) * (k-2) / 2;
            if (sum >= A) r = mid;
            else l = mid + 1;
        }
        int y = l;
        l = max(1, y - k + 1), r = min(x - 1, y + k - 1);
        if (r - l + 1 < k) {impossible(); return;}
        for(int i = l; i<=r; ++i) if (a[i] == 0) a[i]= skim(i);
        for(int i = l; i<=r-k+1; ++i){
            vector<int> ans;
            for(int j = 0; j< k; ++j) ans.push_back(i + j);
 
            ll sum = 0;
            for(int j: ans) sum += a[j];
 
            if (sum >= A && sum <= A * 2){
                answer(ans);
                return;
            } 
        }
        impossible(); return;
    }
    else answer(ans);
}
 
 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
 
//     return 0;
// }

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Incorrect 0 ms 344 KB Incorrect
5 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 0 ms 344 KB Incorrect
5 Halted 0 ms 0 KB -

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 Incorrect 1 ms 1112 KB Incorrect
9 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 Incorrect 1 ms 1112 KB Incorrect
9 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 Incorrect 1 ms 1112 KB Incorrect
9 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 Incorrect 1 ms 1112 KB Incorrect
9 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 Incorrect 1 ms 1112 KB Incorrect
9 Halted 0 ms 0 KB -