Submission #863718

#TimeUsernameProblemLanguageResultExecution timeMemory
863718TAhmed33A Difficult(y) Choice (BOI21_books)C++17
0 / 100
1 ms600 KiB
#include <bits/stdc++.h> #include <books.h> using namespace std; typedef long long ll; //3amlen eh ya gd3an, ana fadely sa3ten lesa int arr[100001]; void solve (int n, int k, ll a, int s) { for (int i = 1; i <= n; i++) { arr[i] = skim(i); } ll sum2 = 0; int pos = -1; for (int i = k; i <= n; i++) { if (arr[i] > a) { pos = i; break; } } for (int i = 1; i + k - 1 <= n; i++) { ll sum = 0; vector <int> t; for (int j = i; j <= i + k - 1; j++) { sum += arr[j]; t.push_back(j); } if (sum >= a && sum <= 2 * a) { answer(t); } } sum2 += arr[pos]; for (int i = 1; i < k; i++) sum2 += arr[i]; if (sum2 >= a && sum2 <= 2 * a) { vector <int> t; for (int i = 1; i < k; i++) t.push_back(i); t.push_back(pos); answer(t); } 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...