제출 #942919

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

books

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



bool checkers(int x, int K, vector<pair<int,int>> &ans, int currsum, int A) 
//return false if adding would make it too large
//return true if not and insert x into the vector
//ans : {index, value} pair
{
    int temp1 = skim(x);
    int cantake = (2 * A) - currsum;

    if ((currsum + (temp1 - ans[K].second)) > (2 * A))
    {
        return false;
    }
    else
    {
        int hi = K, lo = 1, mid;
        while (hi > lo)
        {
            mid = (hi + lo)/2;
            if (((temp1 - ans[mid].second) <= cantake)) //won't exceed : go lower
            {
                hi = mid;
            }
            else
            {
                lo = mid + 1;
            }
        }
        ans[lo] = {x,temp1};
    }
    return true;
}


void solve(int N, int K, long long A, int S) 
{
    int currsum = 0;
    vector<pair<int,int>>ans(K + 1);
    int temp1,temp2;
    for (int a = 1; a <= K; a++)
    {
        temp2 = skim(a);
        ans[a] = {a,temp2};
        currsum += temp2;
    }

    if (currsum > (2 * A))
    {
        impossible();
    }

    int hi = N,lo = K + 1,mid;
    vector<int>kokonut;

    while (hi > lo)
    {
        mid = (hi + lo)/2;
        if (checkers(mid, K, ans, currsum, A))
        {
            lo = mid;
        }
        else
        {
            hi = mid - 1;
        }
        if ((currsum >= A) && (currsum <= (2 * A)))
        {
            for (int a = 1; a <= K; a++)
            {
                kokonut.push_back(ans[a].first);
            }
            answer(kokonut);
        }
    }

    impossible();

}

컴파일 시 표준 에러 (stderr) 메시지

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:44:9: warning: unused variable 'temp1' [-Wunused-variable]
   44 |     int temp1,temp2;
      |         ^~~~~

• 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