Submission #900646

#	Time	Username	Problem	Language	Result	Execution time	Memory
900646		mannshah1211	A Plus B (IOI23_aplusb)	C++17	0 / 100	1055 ms	348 KiB

aplusb

#include "aplusb.h"
#include <bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")

std::vector<int> smallest_sums(int n, std::vector<int> a, std::vector<int> b) {
	std::function<int(int)> count_smaller = [&](int sum) {
		int cnt = 0;
		int ptr = 0;
		for (int i = 0; i < n; i++) {
			while (a[i] + b[ptr] <= sum && ptr < n) {
				++ptr;
			}
			cnt += ptr;
			if (cnt >= n + 1) {
				return cnt;
			}
		}
		return cnt;
	};
	int low = 0, high = 2E9, index = -1;
	while (low <= high) {
		int middle = (low + high) / 2;
		if (count_smaller(middle) >= n) {
			index = middle;
			high = middle - 1;
		} else {
			low = middle + 1;
		}
	}
	std::vector<int> answer;
	int taken = 0;
	for (int i = 0; i < n; i++) {
		int low = 0, high = n - 1, ind = -1;
		while (low <= high) {
			int middle = (low + high) / 2;
			if (a[i] + b[middle] < index) {
				ind = middle;
				low = middle + 1;
			} else {
				high = middle - 1;
			}
		}
		for (int j = 0; j <= ind; j++) {
			answer.push_back(a[i] + b[j]);
		}
		taken += (ind + 1);
	}
	for (int j = 0; j < n - taken; j++) {
		answer.push_back(index);
	}
	std::sort(answer.begin(), answer.end());
	return answer;
}

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