Submission #557515

#	Time	Username	Problem	Language	Result	Execution time	Memory
557515		Mounir	A Difficult(y) Choice (BOI21_books)	C++14	0 / 100	3 ms	288 KiB

books

#include <bits/stdc++.h>
#include "books.h"
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define pb push_back
#define pii pair<int, int>
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
#define print(x) cout << #x << " est " << x << endl;
#define x first
#define y second
#define int long long
using namespace std;

void solve(signed nLivres, signed aPrendre, long long borneInf, signed S) {
    map<int, int> vals;
    int sum = 0;
    for (int i = 0; i < aPrendre; ++i)
        vals[i] = skim(i + 1), sum += vals[i];
    if (sum > 2 * borneInf)
        impossible();
    vector<signed> ans = {};
    if (sum >= borneInf){
        for (int i = 1; i <= aPrendre; ++i)
            ans.pb(i);
        answer(ans);
        return;
    }

    for (int i = aPrendre; i < nLivres; ++i){
        vals[i] = skim(i + 1);
       /* sum += vals[i] - vals[i - aPrendre];
        if (sum >= borneInf){
            if (sum > 2 * borneInf){
                for (int j = 0; j < aPrendre - 1; ++j)
                    ans.pb(i - 1 - j);
                ans.pb(i + 1);
                answer(ans);
            }
            else {
                for (int j = 0; j < aPrendre; ++j)
                    ans.pb(i + 1 - j);
                answer(ans);
            }
        }*/
    }
    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