제출 #1018573

#제출 시각아이디문제언어결과실행 시간메모리
1018573overwatch9A Difficult(y) Choice (BOI21_books)C++17
25 / 100
2 ms1112 KiB
#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. // // vector <int> NUMS; // ll skim(int x) { // return NUMS[x]; // } void solve(int N, int K, ll A, int S) { vector <int> ans(K+1); ll sum = 0; vector <ll> nums(N+1); for (int i = 1; i <= K; i++) { ans[i] = i; nums[i] = skim(i); sum += nums[i]; } for (int i = K; i >= 1 && sum < A; i--) { int lo = K+1, hi = N-(K-i); sum -= nums[i]; while (lo < hi) { int mid = lo + (hi - lo) / 2; ll x = 0; if (nums[mid] != 0) x = nums[mid]; else { nums[mid] = skim(mid); x = nums[mid]; } if (sum + x >= A) hi = mid; else lo = mid + 1; } if (nums[lo] == 0) { nums[lo] = skim(lo); } sum += nums[lo]; ans[i] = lo; } if (sum > 2*A) { impossible(); } else { vector <int> ans2(K); for (int i = 0; i < K; i++) ans2[i] = ans[i+1]; answer(ans2); } } // int main() { // int n, k, a, s; // cin >> n >> k >> a >> s; // NUMS.resize(n+1); // for (int i = 1; i <= n; i++) // cin >> NUMS[i]; // solve(n, k, a, s); // }
#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...