Submission #839535

#	Time	Username	Problem	Language	Result	Execution time	Memory
839535		model_code	A Plus B (IOI23_aplusb)	C++17	60 / 100	1139 ms	1566112 KiB

aplusb

// correct/solution-subtask3.cpp

#include "aplusb.h"

#include <vector>
#include <algorithm>

std::vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B) {
	std::vector<int> C(N*N);
	for(int i=0; i<N; i++){
		for(int j=0; j<N; j++) C[i*N+j] = A[i]+B[j];
	}
	std::sort(C.begin(),C.end());

	std::vector<int> ans(N);
	for(int i=0; i<N; i++) ans[i] = C[i];
	return ans;
}

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