Submission #447550

#	Time	Username	Problem	Language	Result	Execution time	Memory
447550		wiwiho	A Difficult(y) Choice (BOI21_books)	C++14	100 / 100	2 ms	252 KiB

books

#include "books.h"

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

void solve(int n, int k, long long A, int _s){

    int l = 1, r = n;
    while(l < r){
        int m = (l + r) / 2;
        if(skim(m) < A) l = m + 1;
        else r = m;
    }
    ll tmp = skim(l);
    if(tmp <= A) l++;

    if(l <= k - 1) impossible();

    vector<ll> x;
    vector<int> pos;
    for(int i = 1; i < l; i++){
        if(i <= k || l - i <= k){
            x.eb(skim(i));
            pos.eb(i);
        }
    }

    if(l <= n){
        ll sum = tmp;
        for(int i = 0; i < k - 1; i++) sum += x[i];
        if(sum <= 2 * A){
            vector<int> v;
            for(int i = 0; i < k - 1; i++) v.eb(pos[i]);
            v.eb(l);
            answer(v);
        }
    }

    for(int i = 0; i + k - 1 < x.size(); i++){
        ll sum = 0;
        for(int j = 0; j < k; j++) sum += x[i + j];
        if(sum < A || sum > 2 * A) continue;
        vector<int> v;
        for(int j = 0; j < k; j++) v.eb(pos[i + j]);
        answer(v);
    }

    impossible();

}

Compilation message (stderr)

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:98:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |     for(int i = 0; i + k - 1 < x.size(); i++){
      |                    ~~~~~~~~~~^~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 10 / 10
• Subtask 4: 15 / 15
• Subtask 5: 15 / 15
• Subtask 6: 20 / 20
• Subtask 7: 20 / 20