제출 #987241

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
987241		VMaksimoski008	A Difficult(y) Choice (BOI21_books)	C++17	30 / 100	140 ms	1656 KiB

books

#include <bits/stdc++.h>
#include "books.h"

using namespace std;
using ll = long long;
using ull = unsigned long long;

void solve(int N, int K, ll A, int S) {
    if(N == S) {
        vector<ull> v = { 0 };
        for(int i=1; i<=N; i++) v.push_back(skim(i));

        ull sum1 = 0;
        for(int i=1; i<=K; i++) sum1 += v[i];

        if(sum1 >= A && sum1 <= 2 * A) {
            vector<int> ans;
            for(int i=1; i<=K; i++) ans.push_back(i);
            answer(ans);
        }

        for(int i=2; i+K-1<=N; i++) {
            sum1 -= v[i-1];
            sum1 += v[i+K-1];
            if(sum1 > 2 * A) break;

            if(sum1 >= A && sum1 <= 2 * A) {
                vector<int> ans;
                for(int j=i; j<=i+K-1; j++) ans.push_back(j);
                answer(ans);
            }
        }

        for(int i=K; i<=N; i++) {
            if(v[i] >= A) {
                ll sum = 0;
                for(int j=1; j<=K-1; j++) sum += v[j];
                if(sum + v[i] >= A && sum + v[i] <= 2 * A) {
                    vector<int> ans;
                    for(int j=1; j<=K-1; j++) ans.push_back(j);
                    ans.push_back(i);
                    answer(ans);
                }
                break;
            }
        }

        impossible();
        return ;
    }

    //sub 3
    int l=1, r=N-K+1;
    while(l <= r) {
        int mid = (l + r) / 2;
        ll sum = 0;
        for(int i=mid; i<=mid+K-1; i++) sum += skim(i);

        if(sum >= A && sum <= 2 * A) {
            vector<int> ans;
            for(int i=mid; i<=mid+K-1; i++) ans.push_back(i);
            answer(ans);
        }

        if(sum < A) l = mid + 1;
        if(sum > 2 * A) r = mid - 1;
    }
    
    impossible();
    return ;
}

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

books.cpp: In function 'void solve(int, int, ll, int)':
books.cpp:16:17: warning: comparison of integer expressions of different signedness: 'ull' {aka 'long long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   16 |         if(sum1 >= A && sum1 <= 2 * A) {
      |            ~~~~~^~~~
books.cpp:16:30: warning: comparison of integer expressions of different signedness: 'ull' {aka 'long long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   16 |         if(sum1 >= A && sum1 <= 2 * A) {
      |                         ~~~~~^~~~~~~~
books.cpp:25:21: warning: comparison of integer expressions of different signedness: 'ull' {aka 'long long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   25 |             if(sum1 > 2 * A) break;
      |                ~~~~~^~~~~~~
books.cpp:27:21: warning: comparison of integer expressions of different signedness: 'ull' {aka 'long long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   27 |             if(sum1 >= A && sum1 <= 2 * A) {
      |                ~~~~~^~~~
books.cpp:27:34: warning: comparison of integer expressions of different signedness: 'ull' {aka 'long long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   27 |             if(sum1 >= A && sum1 <= 2 * A) {
      |                             ~~~~~^~~~~~~~
books.cpp:35:21: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<long long unsigned int>, long long unsigned int>::value_type' {aka 'long long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   35 |             if(v[i] >= A) {
books.cpp:38:31: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'll' {aka 'long long int'} [-Wsign-compare]
   38 |                 if(sum + v[i] >= A && sum + v[i] <= 2 * A) {
      |                    ~~~~~~~~~~~^~~~
books.cpp:38:50: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'll' {aka 'long long int'} [-Wsign-compare]
   38 |                 if(sum + v[i] >= A && sum + v[i] <= 2 * A) {
      |                                       ~~~~~~~~~~~^~~~~~~~

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