This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// incorrect/sol-birka0-wa-faster.cpp
#include "aplusb.h"
#include <algorithm>
using namespace std;
vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
int X = min(N, 12000);
vector<int> C(X*X);
for(int i=0; i<X; i++){
for(int j=0; j<X; j++) C[i*X+j] = A[i]+B[j];
}
partial_sort(C.begin(), C.begin() + N, C.end());
return vector<int>(C.begin(), C.begin() + N);
}
# | 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... |