| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1130773 | vulestamenkovic | A Plus B (IOI23_aplusb) | C++20 | 1 ms | 328 KiB |
#include<bits/stdc++.h>
#include "aplusb.h"
using namespace std;
vector<int> smallest_sums(int n, vector<int> a, vector<int> b){
vector<int> s(n);
int i=1,j=1;
s[0]=a[0]+b[0];
for(int l=1;l<n;l++){
if(b[0]+a[i]<a[0]+b[j]){
s[l]=b[0]+a[i++];
}else{
s[l]=a[0]+b[j++];
}
}
return s;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
