Submission #1000030

#TimeUsernameProblemLanguageResultExecution timeMemory
1000030dilanyanA Difficult(y) Choice (BOI21_books)C++17
0 / 100
117 ms344 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) { if (n == s) { vector<long long> a(n + 1); for (int i = 1;i <= n;i++) a[i] = skim(i); for (int i = 1;i <= n;i++) { if (a[i] >= 2 * A) break; for (int j = i + 1;j <= n;j++) { if (a[i] + a[j] >= 2 * A) break; for (int x = j + 1;x <= n;x++) { if (a[i] + a[j] + a[x] > 2 * A) break; if (a[i] + a[j] + a[x] > A) { answer({ i,j,x }); } } } } 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...