# [Bronze V] A + B Queries [문제 링크](https://www.acmicpc.net/problem/34210) ## 문제 설명 <p>The Quechuas welcome you to IOI 2025 with a special gift: two arrays, $A$ and $B$, each of length $N$. The elements in both arrays are indexed from $0$ to $N − 1$.</p> <p>To ensure that you are taking good care of their gift, they will ask you $Q$ questions, one at a time. Each question consists of two indices, $i$ and $j$, and asks: What is the sum of $A[i]$ and $B[j]$?</p> ## 구현 상세 <p>The first procedure you should implement is:</p> <pre> void initialize(std::vector&lt;int&gt; A, std::vector&lt;int&gt; B)</pre> <ul> <li>$A$, $B$: two arrays of length $N$, the gift of the Quechuas.</li> <li>This procedure is called exactly once for each testcase, before any calls to <code>answer_question</code>.</li> </ul> <p>The second procedure you should implement is:</p> <pre> int answer_question(int i, int j)</pre> <ul> <li>$i$, $j$: integers describing a question.</li> <li>This procedure is called $Q$ times.</li> </ul> <p>This procedure should return the sum of $A[i]$ and $B[j]$.</p> ## 제한 <ul> <li>$1 &le; N &le; 200\, 000$</li> <li>$0 &le; A[k],B[k] &le; 10$ for each $k$ such that $0 &le; k &lt; N$.</li> <li>$1 &le; Q &le; 200\, 000$</li> <li>$0 &le; i, j &lt; N$ in each question.</li> </ul> ## 풀이 #### initialize에서 A, B 배열을 저장하고, answer_question에서 A[i]+B[j]를 출력하면 된다. ``` c++ #include<bits/stdc++.h> #include "aplusb.h" using namespace std; vector<int> a, b; void initialize(vector<int> A, vector<int> B) { a = A; b = B; return; } int answer_question(int i, int j) { return a[i] + b[j]; } ```