Submission #575361

#TimeUsernameProblemLanguageResultExecution timeMemory
575361birthdaycakeA Difficult(y) Choice (BOI21_books)C++17
0 / 100
2 ms208 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; long long b[200001], vs[200001]; void idk(int x, int y){ vector<int>fin; for(int i = x; i <= y; i++) fin.push_back(i); answer(fin); } void solve(int n, int k, long long a, int s) { long long tot = 0; vector<int>fin; for(int i = 1; i <= n; i++) { b[i] = skim(i); if(i <= k) tot += b[i]; vs[i] = 0; } for(int i = k; i >= 1; i--){ int prev = i; for(int j = i + 1; j < n; j++){ if(!vs[j] && tot - b[prev] + b[j] <= 2 * a){ prev = j; } } tot -= b[i]; tot += b[prev]; vs[prev] = 1; } tot = 0; for(int i = 1; i <= n; i++){ if(vs[i]){ fin.push_back(i); tot += b[i]; } } if(tot >= a && tot <= 2 * a) answer(fin); 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...