제출 #681390

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

books

#include <bits/stdc++.h>

#include "books.h"

using namespace std;
using ll = long long;
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
//     books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ books_sample.cpp sample_grader.cpp
// in this folder.
//

void solve(int n, int k, long long a, int s) {
    // TODO implement this function
    vector<long long> vec(n);
    long long sm = 0;
    vec[0] = skim(1);
    sm += vec[0];
    if (vec[0] * k > 2 * a) {
        impossible();
        return;
    }
    for (int i = 1; i < k - 1; ++i) {
        vec[i] = skim(i + 1), sm += vec[i];
    }
    int l = k - 2, r = n - 1;
    while (l + 1 < r) {
        int m = (l + r) / 2;
        long long b = vec[m];
        if (!b) b = skim(m + 1);
        vec[m] = b;
        if (b > a) r = m;
        else l = m;
    }
    if (sm + vec[r] > 2 * a || sm + vec[r] < a) {
        vector<int> ids;
        for (int i = 0; i < k; ++i) {
            if (!vec[i]) vec[i] = skim(i + 1);
            ids.push_back(i);
        }
        for (int i = max(k, r - k); i < r; ++i) {
            if (!vec[i]) vec[i] = skim(i + 1);
            ids.push_back(i);
        }
        for (int i = 0; i + k - 1 < ids.size(); ++i) {
            sm = 0;
            for (int j = 0; j < k; ++j) {
                sm += vec[ids[i + j]];
            }
            if (sm >= a && sm <= 2 * a) {
                vector<int> ans;
                for (int j = 0; j < k; ++j) ans.push_back(ids[i + j] + 1);
                answer(ans);
                return;
            }
        }
        impossible();
    }
    vector<int> ans;
    for (int i = 1; i <= k - 1; ++i) ans.push_back(i);
    ans.push_back(r + 1);
    answer(ans);
}

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

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

• 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