Submission #777938

#TimeUsernameProblemLanguageResultExecution timeMemory
777938MODDIA Difficult(y) Choice (BOI21_books)C++14
0 / 100
2 ms208 KiB
#include <bits/stdc++.h> //#include "grader.cpp" #include "books.h" #define ll long long #define vi vector<int> #define pb push_back #define vl vector<ll> 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) { if(S == N){ vl arr(N+1); for(int i = 1; i <= N; i++){ arr[i] = skim(i); } ll sum = 0; for(int i = 1; i <= K; i++) sum += arr[i]; if(sum >= A && sum <= 2 * A){ vi ans; for(int i = 1; i <= K; i++) ans.pb(i); answer(ans); } for(int i = K + 1; i <= N; i++){ sum -= arr[i-K]; sum += arr[i]; if(sum >= A && sum <= 2 * A){ vi ans; for(int j = i-K; j <= i; j++) ans.pb(j); answer(ans); } } } else 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...