제출 #1009295

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1009295		alexdd	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	1 ms	344 KiB

books

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

map<long long,long long> mp;
int ramase;
long long query(long long x)
{
    if(mp[x]==0)
    {
        if(ramase==0)
        {
            while(1);
        }
        ramase--;
        mp[x] = skim(x);
    }
    return mp[x];
}

pair<long long,long long> aproximativ(int st, int K)
{
    int dr = st+K-1;
    long long x = query(st);
    long long y = query(dr);
    pair<long long,long long> aux = {x+y,x+y};
    for(int i=2;i<K;i++)
    {
        aux.first += x+i-1;
        aux.second += y-i+1;
    }
    return aux;
}
long long exact(int st, int K)
{
    int dr = st+K-1;
    long long sum=0;
    for(int i=st;i<=dr;i++)
        sum += query(i);
    return sum;
}
long long pref[15];
void solve(int N, int K, long long A, int S)
{
    ramase = S;
    for(int i=1;i<=K;i++)
        pref[i] = pref[i-1] + query(i);
    vector<int> sol;
    long long sumsol=0;
    for(int i=N;i>0;i--)
    {
        long long x = skim(i);
        if((int)sol.size()<K && sumsol + x + pref[K-(int)sol.size()-1] <= 2LL*A)
        {
            sol.push_back(i);
            sumsol += x;
        }
    }
    if(sumsol>=A && sumsol<=2LL*A)
    {
        answer(sol);
        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