Submission #574868

#TimeUsernameProblemLanguageResultExecution timeMemory
574868mdubaisiA Difficult(y) Choice (BOI21_books)C++14
5 / 100
235 ms976 KiB
#include <bits/stdc++.h> #include "books.h" #define all(v) (v.begin()), (v.end()) #define setall(a, val) memset(a, val, sizeof a) #define ll long long using namespace std; void solve(int N, int K, ll A, int S) { vector<ll> v(N + 1); for (int i = 1; i <= N; i++) v[i] = skim(i); vector<int> ans; for (int i = 1; i <= N; i++) { for (int j = i + 1; j <= N; j++) { for (int k = j + 1; k <= N; k++) { ll s = v[i] + v[j] + v[k]; if (s >= A && s <= 2 * A) { answer({ i, j, k }); return; } } } } 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...