Submission #841051

#	Time	Username	Problem	Language	Result	Execution time	Memory
841051		Faisal_Saqib	A Plus B (IOI23_aplusb)	C++17	100 / 100	51 ms	9488 KiB

aplusb

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include "aplusb.h"
using namespace std;
vector<int> smallest_sums(int n,vector<int> a ,vector<int> b)
{
    vector<int> ans(n);
    int pak=0;
    int can[a.size()];
    int m=b.size();
    for(int i=0;i<n;i++)
    {
        can[i]=0;
    }
    set<pair<int,pair<int,int>>> pq;
    pq.insert({a[0]+b[0],{0,0}});
    while(pak<(n) and pq.size()>0)
    {
        auto p=*begin(pq);
        pq.erase(begin(pq));
        ans[pak]=p.first;
        pak++;
        if(p.second.first< (n-1)){
            pq.insert({a[p.second.first+1]+b[can[p.second.first+1]],{p.second.first+1,can[p.second.first+1]}});
        }
        if(p.second.second< (m-1))
        {
            pq.insert({a[p.second.first]+b[p.second.second+1],{p.second.first,p.second.second+1}});
            can[p.second.first]+=1;
        }
    }
    // for(auto i:ans)
    //     cout<<i<<' ';
    // cout<<endl;
    return ans;
}

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