이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "aplusb.h"
using namespace std;
#define FOR(i,n,k) for(auto nx = (i);nx < (n);nx += (k))
#define FOR2(i,n,k) for(auto nxx = (i);nxx < (n);nxx += (k))
vector<int> smallest_sums(int n, vector<int> a, vector<int> b) {
vector<int> ans;
FOR(0,n,1){
ans.push_back(a[nx] + b[nx]);
}
return ans;
}
/*
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠀⣆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⢆⠀⠀⠀⠀⠀⢸⡀⠸⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠹⡈⠓⢤⣀⠀⠀⠸⣧⠀⢻⡄⠀⠀⠀⢀⣀⣠⡴⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢱⣄⠀⠀⠉⠉⠛⠛⠀⠀⠻⠒⠂⠉⢁⡴⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⣀⠀⠀⠀⢀⡠⠔⠚⢉⠤⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠒⠤⣀⠁⠒⠦⠤⠤⢤⣤⠄⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠈⠙⢍⡁⠀⠀⠀⡔⢁⡄⠀⠀⠀⠀⠀⠀⠀⠀⠈⠢⣀⠀⠀⠭⠤⢠⡤⠔⠊⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⢨⡿⠀⣼⢜⠏⡄⠀⡀⠀⡠⠀⡖⠀⢠⠀⠀⢄⠉⢀⠀⠀⠀⠳⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢠⣿⡵⡼⠏⡜⢸⠁⣤⠇⢀⠇⢠⡇⢰⢸⣾⠀⢸⡄⠀⣧⠀⣆⠀⠨⠒⢤⣄⡀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⢠⠏⣻⠃⠀⣼⠇⡆⣰⢹⠀⣾⠀⣸⠇⢸⣾⣿⣇⠈⣿⣆⢹⡇⢹⣦⡈⢗⠉⠉⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⢀⣴⡿⠊⡽⢀⠎⣿⠀⣠⡗⢚⣾⣿⣴⠳⣧⡞⡄⢿⠟⠉⠉⢙⣦⢳⠘⣿⣿⣆⣿⡦⠄⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠈⠁⠀⢀⣇⡎⢠⢿⢠⣿⣤⠊⢀⣠⣴⣿⣿⠴⢷⣿⣤⣶⣾⣿⣿⡿⣷⢿⣿⣦⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⡼⢻⣥⣿⢸⣸⣿⢿⣾⣿⣿⣿⣿⠟⠀⠀⠘⢿⣿⣿⣿⠟⠀⢹⣾⣾⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠁⡿⢻⢟⣿⣿⣷⡄⠙⠿⠿⠿⠏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣼⢋⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠈⠁⢸⠟⡿⣿⣿⡇⠀⠀⠀⠀⢀⣠⠤⠐⠒⠒⠒⠢⡄⠀⢀⣯⠞⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⠀⠁⠈⢦⣽⡀⠀⠀⣴⢋⣤⣴⣶⣿⣿⡿⣿⡇⠀⢸⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢳⣄⠀⠸⣿⢟⡏⠝⠒⢓⣣⠟⢁⣴⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⡷⣄⡈⠙⠛⠋⠉⠁⣀⡴⣻⣿⣶⣤⣀⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣰⣶⣶⣤⣼⡧⠿⣙⣶⣶⣶⣶⣾⣿⣧⣿⣿⣿⣿⣿⣿⣇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⢠⣤⣀⣠⣿⠿⣿⣿⣿⣷⠀⠈⠳⢿⣋⣿⣿⡿⠛⠁⣿⣿⣿⣿⣿⣿⣿⣶⣤⡀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⣿⣿⣿⣿⣧⣝⢿⣿⣿⠀⠠⣀⠀⠈⠉⠉⢰⡆⠀⢋⣿⣴⣿⣿⣿⣾⣿⣿⡀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢰⣿⣿⢿⣿⣿⣿⣿⣿⣿⣿⣧⡀⠹⡆⠀⠀⠀⣾⠀⠀⣸⣿⣿⣿⣿⡿⠋⢸⣿⣇⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⢐⣿⣿⣿⣦⣝⣿⣿⣿⣿⣿⣿⣿⣿⣄⠑⠀⠀⠀⠘⠀⢠⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠶⣤⣄⠀⠀
⠀⠀⠀⠀⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣄⠀⠀⢀⣠⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠀⣿⣌⣇⠀
⠀⠀⠀⣠⠏⢉⣻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡗⠄⠠⠋⠀⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣤⣿⣿⣿⡆
⢀⣠⠞⣱⣾⣿⣿⣿⣿⣿⣿⡿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⠀⠀⠀⠀⠘⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇
*/
# | 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... |