제출 #1175946

#제출 시각아이디문제언어결과실행 시간메모리
1175946p714f6ursA Plus B (IOI23_aplusb)C++20
0 / 100
1 ms320 KiB
#include <stdint.h> #include <stdlib.h> #include <string.h> #include <iostream> #include <vector> int* smallest_sums(int N, std::vector<int> A, std::vector<int> B) { int *result = new int[N]; int *BI = new int[N]; memset(BI, 0, N*sizeof(int)); for(int RI = 0; RI < N; RI++) { int LI = INT32_MAX, min = INT32_MAX, minidx; for(int AI = 0; AI < N; AI++) { if(BI[AI] >= LI) break; int sum = A[AI] + B[BI[AI]]; if(sum < min) { min = sum; minidx = AI; } LI = BI[AI]; } BI[minidx] ++; result[RI] = min; } delete [] BI; return result; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...