Submission #943273

#	Time	Username	Problem	Language	Result	Execution time	Memory
943273		teacup	A Difficult(y) Choice (BOI21_books)	C++14	Compilation error	0 ms	0 KiB

books

#include <bits/stdc++.h>

#include "books.h"

using namespace std;
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
typedef vector<ii> vii;
//
// --- 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> V(N+5);
    vector<int> ans;
    memset(V, -1, sizeof(V));
    long long sum=0;
    for (int i=1; i<=K; i++){
		V[i]=skim(i);
		sum+=V[i];
		ans.push_back(V[i]);
	}
	if (sum>2*A){
		impossible();
	}else if (sum>=A){
		//answer!!
		answer(ans);
	}else{
		//sum<A
		ans.clear();
		//binary search from K+1 to N
		ll L=1, R=N-K+1, M;
		while (L<R) {
			M = (L+R)/2;
			ll temp;
			
			if(V[M] != -1) temp = V[M];
            else temp = skim(M);
            V[M] = temp;
            
			if (temp < A) L = M+1;
			else R = M;
		}
		
		if (L < K) impossible();
		if(L <= N){
            ll temp;
			
			if(V[M] != -1) temp = V[M];
            else temp = skim(M);
            V[M] = temp;
 
            if(sum - V[K] + temp <= 2*A){
				ans.clear();
                for(int i=1; i<K; i++){
                    ans.push_back(i);
                }
                ans.push_back(L);
                answer(ans);
            }
            N = L - 1;
        }
 
        set<int> S_;
 
        for(int i=1; i<=K; i++){
            S_.insert(i);
        }
 
        for(int i=0; i<K; i++){
            S_.erase(K - i);
            S_.insert(N - i);
 
            ll temp;
 
            if(V[N - i] != -1) temp = V[N - i];
            else temp = skim(N - i);
            V[N - i] = temp;
 
            sum -= V[K - i];
            sum += temp;
 
            if(A <= sum && sum <= 2*A){
				ans.clear();
                for(int i : S_){
                    v.push_back(i);
                }
                answer(ans);
            }
        }
        impossible();
	}
}

Compilation message (stderr)

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:24:12: error: cannot convert 'std::vector<long long int>' to 'void*'
   24 |     memset(V, -1, sizeof(V));
      |            ^
      |            |
      |            std::vector<long long int>
In file included from /usr/include/features.h:461,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/os_defines.h:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/c++config.h:518,
                 from /usr/include/c++/10/cassert:43,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from books.cpp:1:
/usr/include/x86_64-linux-gnu/bits/string_fortified.h:59:1: note:   initializing argument 1 of 'void* memset(void*, int, size_t)'
   59 | __NTH (memset (void *__dest, int __ch, size_t __len))
      | ^~~~~
books.cpp:94:21: error: 'v' was not declared in this scope
   94 |                     v.push_back(i);
      |                     ^