| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1094315 |
2024-09-29T10:32:21 Z |
Sunbae |
A Plus B (IOI23_aplusb) |
C++17 |
|
1 ms |
420 KB |
#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(n);
for(int i = 0, m = 0; i<n; ++i){
for(int j = 0; A[i] + B[j] <= ans && j<n; ++j){
v[m++] = A[i] + B[j];
}
}
return v;
}
/*
signed main(){
int n; scanf("%d", &n);
vector<int> A(n), B(n);
for(int i = 0, x; i<n; ++i) scanf("%d", &x), A[i] = x;
for(int i = 0, x; i<n; ++i) scanf("%d", &x), B[i] = x;
vector<int> v = smallest_sums(n, A, B);
for(int x: v) printf("%d ", x);
}
*/
Compilation message
aplusb.cpp: In function 'std::vector<int> smallest_sums(int, std::vector<int>, std::vector<int>)':
aplusb.cpp:20:37: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
20 | for(int j = 0; A[i] + B[j] <= ans && j<n; ++j){
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
420 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
420 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 4th token, expected: '30', found: '64' |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
420 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 4th token, expected: '30', found: '64' |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
420 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 4th token, expected: '30', found: '64' |
| 8 |
Halted |
0 ms |
0 KB |
- |
