답안 #841051

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
841051	2023-09-01T07:28:48 Z	Faisal_Saqib	A Plus B (IOI23_aplusb)	C++17	100 / 100	51 ms	9488 KB

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.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct

Subtask #3

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	304 KB	Output is correct
26	Correct	1 ms	312 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	2 ms	340 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	308 KB	Output is correct
31	Correct	1 ms	308 KB	Output is correct
32	Correct	1 ms	304 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	2 ms	468 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct

Subtask #4

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	304 KB	Output is correct
26	Correct	1 ms	312 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	2 ms	340 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	308 KB	Output is correct
31	Correct	1 ms	308 KB	Output is correct
32	Correct	1 ms	304 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	2 ms	468 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	7 ms	1108 KB	Output is correct
38	Correct	26 ms	2752 KB	Output is correct
39	Correct	29 ms	3296 KB	Output is correct
40	Correct	26 ms	2792 KB	Output is correct
41	Correct	44 ms	5504 KB	Output is correct
42	Correct	39 ms	4548 KB	Output is correct
43	Correct	31 ms	3212 KB	Output is correct
44	Correct	9 ms	2004 KB	Output is correct
45	Correct	28 ms	2752 KB	Output is correct
46	Correct	27 ms	2756 KB	Output is correct
47	Correct	27 ms	2712 KB	Output is correct
48	Correct	41 ms	4796 KB	Output is correct
49	Correct	51 ms	7328 KB	Output is correct
50	Correct	51 ms	9488 KB	Output is correct
51	Correct	46 ms	3272 KB	Output is correct
52	Correct	45 ms	3808 KB	Output is correct
53	Correct	45 ms	3828 KB	Output is correct