Submission #574833

#TimeUsernameProblemLanguageResultExecution timeMemory
5748331zaid1A Difficult(y) Choice (BOI21_books)C++14
0 / 100
4 ms592 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; void solve(int n, int k, long long x, int s) { vector<int> v(n); for (int i = 0; i < n; i++) v[i] = skim(i+1); for (int i = 0; i < n; i++) { int a = v[i], ok = 0; int l = i+1, r = n-1; while (l < r) { if (v[l] + v[r] + a > 2*x) r--; else if (v[l] + v[r] + a < x) l++; else { ok = true; break; } } if (ok) { answer({i+1, l+1, r+1}); } } }
#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...