Submission #839532

#	Time	Username	Problem	Language	Result	Execution time	Memory
839532		model_code	A Plus B (IOI23_aplusb)	C++17	30 / 100	1085 ms	24796 KiB

aplusb

// correct/solution-subtask2.cpp

#include "aplusb.h"

#include <vector>

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::vector<int> ans(N);

	for(int i=0; i<N; i++) {
		int id = 0;
		for(int j=0; j<N*N; j++){
			if (C[j] <= C[id]) id = j;
		}
		ans[i] = C[id];
		C[id] = A[N-1] + B[N-1];
	}

	return ans;
}

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