제출 #406004

#제출 시각아이디문제언어결과실행 시간메모리
406004HalogenA Difficult(y) Choice (BOI21_books)C++14
0 / 100
1 ms584 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; // // --- 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. // int memo[100005]; int check(int pos) { return (memo[pos]) ? memo[pos] : memo[pos] = skim(pos); } void solve(int N, int K, long long A, int S) { memset(memo, 0, sizeof(memo)); int start = 0; for (int i = 1; i <= K; i++) start += check(i); if (start > 2 * A) {impossible(); return;} if (start >= A) { vector<int> v; for (int i = 1; i <= K; i++) v.push_back(i); answer(v); return; } int end = 0; for (int i = 0; i < K; i++) end += check(i); if (end < A) {impossible(); return;} if (end <= 2 * A) { vector<int> v; for (int i = 0; i < K; i++) v.push_back(N - i); answer(v); return; } }
#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...