제출 #1203270

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1203270		Ardelion	A Plus B (IOI23_aplusb)	C++20	100 / 100	78 ms	9980 KiB

aplusb

#include "aplusb.h"
#include <bits/stdc++.h>

using namespace std;
 
#define threesum cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false)
#define all(a) a.begin(), a.end()
#define F first
#define S second
//#define int long long
#define pii pair<int, int>
#define ppp pair<int, pii>
#define dout cout << fixed << setprecision(15)
#define mid ((l + r) / 2)
#define lc (2 * id)
#define rc (lc + 1)

vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
  //return A;
  sort(all(A));
  sort(all(B));
  map<pii, bool> seen;
  priority_queue<ppp> pq;
  pq.push({A[0] + B[0], {0, 0}});
  vector<int> ans;
  while((int)ans.size() < N){
    auto [dst, pr] = pq.top();
    auto [i, j] = pr;
    pq.pop();

    if(seen[{i, j}])
      continue;
    seen[{i, j}] = 1;

    ans.push_back(A[i] + B[j]);

    if(i + 1 < N)
      pq.push({-(A[i + 1] + B[j]), {i + 1, j}});
    if(j + 1 < N)
      pq.push({-(A[i] + B[j + 1]), {i, j + 1}});
  }
  return ans;
}

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