제출 #1000384

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1000384		thinknoexit	A Plus B (IOI23_aplusb)	C++17	100 / 100	39 ms	5416 KiB

aplusb

#include "aplusb.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
int a[100100], b[100100];
vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
	n = N;
	for (int i = 1;i <= n;i++) a[i] = A[i - 1], b[i] = B[i - 1];
	int l = 0, r = 2e9;
	while (l < r) {
		int mid = l + (r - l + 1) / 2;
		int p = n;
		ll ans = 0;
		for (int i = 1;i <= n;i++) {
			while (p > 0 && a[i] + b[p] >= mid) p--;
			ans += p;
		}
		if (ans >= n) r = mid - 1;
		else l = mid;
	}
	vector<int> ans;
	int p = n;
	for (int i = 1;i <= n;i++) {
		while (p > 0 && a[i] + b[p] >= l) p--;
		for (int j = 1;j <= p;j++) {
			ans.push_back(a[i] + b[j]);
		}
	}
	while ((int)ans.size() != n) ans.push_back(l);
	sort(ans.begin(), ans.end());
	return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 40 / 40