제출 #987243

#제출 시각아이디문제언어결과실행 시간메모리
987243VMaksimoski008A Difficult(y) Choice (BOI21_books)C++17
45 / 100
129 ms1484 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; using ll = long long; using ull = unsigned long long; map<int, ll> memo; ll ask(int p) { if(memo.count(p)) return memo[p]; return memo[p] = skim(p); } 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 += ask(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; } l=K, r=N-K+1; int p = -1; while(l <= r) { int mid = (l + r) / 2; if(ask(mid) >= A) p = mid, r = mid - 1; else l = mid + 1; } if(p != -1) { ll sum = ask(p); for(int i=1; i<=K-1; i++) sum += ask(i); if(sum >= A && sum <= 2 * A) { vector<int> ans; for(int i=1; i<=K-1; i++) ans.push_back(i); ans.push_back(p); answer(ans); } } impossible(); return ; }

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

books.cpp: In function 'void solve(int, int, ll, int)':
books.cpp:23:17: warning: comparison of integer expressions of different signedness: 'ull' {aka 'long long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   23 |         if(sum1 >= A && sum1 <= 2 * A) {
      |            ~~~~~^~~~
books.cpp:23:30: warning: comparison of integer expressions of different signedness: 'ull' {aka 'long long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   23 |         if(sum1 >= A && sum1 <= 2 * A) {
      |                         ~~~~~^~~~~~~~
books.cpp:32:21: warning: comparison of integer expressions of different signedness: 'ull' {aka 'long long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   32 |             if(sum1 > 2 * A) break;
      |                ~~~~~^~~~~~~
books.cpp:34:21: warning: comparison of integer expressions of different signedness: 'ull' {aka 'long long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   34 |             if(sum1 >= A && sum1 <= 2 * A) {
      |                ~~~~~^~~~
books.cpp:34:34: warning: comparison of integer expressions of different signedness: 'ull' {aka 'long long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   34 |             if(sum1 >= A && sum1 <= 2 * A) {
      |                             ~~~~~^~~~~~~~
books.cpp:42: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]
   42 |             if(v[i] >= A) {
books.cpp:45:31: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'll' {aka 'long long int'} [-Wsign-compare]
   45 |                 if(sum + v[i] >= A && sum + v[i] <= 2 * A) {
      |                    ~~~~~~~~~~~^~~~
books.cpp:45:50: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'll' {aka 'long long int'} [-Wsign-compare]
   45 |                 if(sum + v[i] >= A && sum + v[i] <= 2 * A) {
      |                                       ~~~~~~~~~~~^~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...