# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1094321 | Sunbae | A Plus B (IOI23_aplusb) | C++17 | 64 ms | 4564 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <vector>
#include <algorithm>
#include "aplusb.h"
typedef long long ll;
using namespace std;
const int N = 1e5 + 5;
vector<int> smallest_sums(int n, vector<int> A, vector<int> B) {
ll low = A[0] + B[0], high = A[n-1] + B[n-1], ans;
while(low <= high){
ll mid = low + ((high-low)>>1), cnt = 0;
for(int i = 0; i<n; ++i){
cnt += upper_bound(B.begin(), B.end(), mid-A[i]) - B.begin();
}
if(cnt >= n) high = mid-1, ans = mid;
else low = mid+1;
}
vector<int> v;
for(int i = 0, m = 0; i<n; ++i){
for(int j = 0; A[i] + B[j] <= ans && j<n; ++j){
v.push_back(A[i] + B[j]);
}
}
sort(v.begin(), v.end());
v.resize(n);
return v;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |