Submission #943239

#TimeUsernameProblemLanguageResultExecution timeMemory
943239theghostkingA Difficult(y) Choice (BOI21_books)C++17
0 / 100
2 ms1364 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. // void solve(int N, int K, long long A, int S) { vector<long long> dis(N+1, -1); for (int i = 1; i<=N; i++){ dis[i] = skim(i); } for (int i = 1; i<=N-K+1; i++){ vector<int> vv; long long sm = 0; for (int j = i; j<=i+K-1; j++){ vv.push_back(dis[j]); sm += dis[j]; } if ((sm >= A) && (2*A>=sm)){ answer(vv); } } impossible(); }
#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...