Submission #1186595

#	Time	Username	Problem	Language	Result	Execution time	Memory
1186595		YassirSalama	A Difficult(y) Choice (BOI21_books)	C++20	0 / 100	1 ms	1980 KiB

books

#include <bits/stdc++.h>
using namespace std;

#include "books.h"
#ifdef IOI
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }

void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__);
#else
#define dbg(...) 1337;
#endif

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.

/*
skim(index) : 1-indexed
answer(subset) : 1-indexed
impossible()
*/
//

void solve(int n, int k, long long a, int sss) {
    vector<__int128_t> v(n+1);
    for(int i=1;i<=n;i++){
        v[i] = skim(i);
    }
    set<int> s;
    __int128_t ss = 0;
    int i = 1;
    while(i<=n){
        if(s.size()==k&&ss>=a&&ss<=2*a){
            return answer(vector<int>(s.begin(),s.end()));
        }
        if(s.size()<k){
            ss+=v[i];
            s.insert(i);
            i++;
            continue;
        }
        auto j = *s.begin();
        s.erase(j);
        ss-=v[j];
        ss+=v[i];
        s.insert(v[i]);
        i++;
    }
    if(s.size()==k&&ss>=a&&ss<=2*a){
        return answer(vector<int>(s.begin(),s.end()));
    }
    return impossible();
}

• 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