제출 #649407

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

books

#include <bits/stdc++.h>

#include "books.h"

using namespace std;
//
void solve(int N,int K,long long A,int S)
{
    int i,n,k,val,sol,j,a;
    n=N;
    k=K;
    a=A;
    vector<int>vec;
    long long v[100005],suma=0,st,dr,mij;
    for(i=1;i<=k-1;i++)
    {
        v[i]=skim(i);
        suma=suma+v[i];
    }
    if(suma>=A)
    {
        v[k]=skim(k);
        suma=suma+v[k];
        if(suma>a*2)
        {
            impossible();
        }
        else
        {
            for(i=1;i<=k;i++)
            {
                vec.push_back(i);
            }
            answer(vec);
        }
    }
    else
    {
        st=k;
        dr=n;
        sol=0;
        while(st<=dr)
        {
            mij=(st+dr)/2;
            val=skim(mij);
            if(val+suma<=2*a && val+suma>=a)
            {
                for(i=1;i<k;i++)
                {
                    vec.push_back(i);
                }
                vec.push_back(mij);
                answer(vec);
            }
            else if(val+suma<a)
            {
                dr=mij-1;
                sol=mij;
            }
            else
            {
                st=mij+1;
            }
        }
        val=skim(k);
        v[k]=val;
        suma=suma+val;
        if(suma>=a && suma<=2*a)
        {
            for(i=1;i<=k;i++)
            {
                vec.push_back(i);
            }
            answer(vec);
        }
        for(i=1;i<=k;i++)
        {
            if(i>=sol)
            {
                impossible();
            }
            suma=suma-v[i];
            suma=suma+skim(sol-i+1);
            if(suma>=a && suma<=2*a)
            {
                for(j=i+1;j<=k;j++)
                {
                    vec.push_back(j);
                }
                for(j=1;j<=i;j++)
                {
                    vec.push_back(sol-j+1);
                }
                answer(vec);
            }
        }
        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