답안 #839958

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
839958	2023-08-30T22:10:07 Z	SorahISA	A Plus B (IOI23_aplusb)	C++17	100 / 100	88 ms	12800 KB

aplusb

#ifndef SorahISA
#define SorahISA
#include SorahISA __FILE__ SorahISA

vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
    prior<tuple<int, int, int>> pq;
    pq.ee(A[0] + B[0], 0, 0);
    
    vector<int> ans;
    set<pii> st;
    for (int i = 0; i < N; ++i) {
        auto [val, pos_a, pos_b] = pq.top(); pq.pop();
        ans.eb(val);
        if (pos_a + 1 < N and !st.count({pos_a + 1, pos_b})) {
            pq.ee(A[pos_a + 1] + B[pos_b], pos_a + 1, pos_b);
            st.ee(pos_a + 1, pos_b);
        }
        if (pos_b + 1 < N and !st.count({pos_a, pos_b + 1})) {
            pq.ee(A[pos_a] + B[pos_b + 1], pos_a, pos_b + 1);
            st.ee(pos_a, pos_b + 1);
        }
    }
    
    return ans;
}

#else

#include "aplusb.h"
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

// #define int int64_t
// #define double __float80
using pii = pair<int, int>;
template <typename T> using Prior = std::priority_queue<T>;
template <typename T> using prior = std::priority_queue<T, vector<T>, greater<T>>;

// #define X first
// #define Y second
#define eb emplace_back
#define ef emplace_front
#define ee emplace
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define SZ(x) ((int)(x).size())

#ifdef local
#define fastIO() void()
#define debug(...) \
    fprintf(stderr, "%sAt [%s], line %d: (%s) = ", "\u001b[33m", __FUNCTION__, __LINE__, #__VA_ARGS__), \
    _do(__VA_ARGS__), fprintf(stderr, "%s", "\u001b[0m")
template <typename T> void _do(T &&_t) {cerr << _t << "\n";}
template <typename T, typename ...U> void _do(T &&_t, U &&..._u) {cerr << _t << ", ", _do(_u...);}
#else
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
#define debug(...) void()
#endif

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template <typename T, typename U> bool chmin(T &lhs, U rhs) {return lhs > rhs ? lhs = rhs, 1 : 0;}
template <typename T, typename U> bool chmax(T &lhs, U rhs) {return lhs < rhs ? lhs = rhs, 1 : 0;}

#endif

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	1 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	1 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	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 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	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 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	0 ms	212 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	1 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	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 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	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 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	0 ms	212 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	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	2 ms	468 KB	Output is correct
27	Correct	2 ms	468 KB	Output is correct
28	Correct	2 ms	596 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	2 ms	516 KB	Output is correct
34	Correct	2 ms	468 KB	Output is correct
35	Correct	2 ms	596 KB	Output is correct
36	Correct	2 ms	468 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	1 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	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 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	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 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	0 ms	212 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	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	2 ms	468 KB	Output is correct
27	Correct	2 ms	468 KB	Output is correct
28	Correct	2 ms	596 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	2 ms	516 KB	Output is correct
34	Correct	2 ms	468 KB	Output is correct
35	Correct	2 ms	596 KB	Output is correct
36	Correct	2 ms	468 KB	Output is correct
37	Correct	16 ms	2468 KB	Output is correct
38	Correct	64 ms	9808 KB	Output is correct
39	Correct	63 ms	7800 KB	Output is correct
40	Correct	55 ms	7924 KB	Output is correct
41	Correct	74 ms	9068 KB	Output is correct
42	Correct	67 ms	9072 KB	Output is correct
43	Correct	88 ms	12780 KB	Output is correct
44	Correct	12 ms	2368 KB	Output is correct
45	Correct	57 ms	6764 KB	Output is correct
46	Correct	54 ms	6704 KB	Output is correct
47	Correct	54 ms	6684 KB	Output is correct
48	Correct	73 ms	9256 KB	Output is correct
49	Correct	77 ms	11616 KB	Output is correct
50	Correct	77 ms	12800 KB	Output is correct
51	Correct	75 ms	6892 KB	Output is correct
52	Correct	77 ms	6940 KB	Output is correct
53	Correct	73 ms	6980 KB	Output is correct

답안 #839958

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 30.0 / 30.0

Subtask #4 40.0 / 40.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
30.0 / 30.0

Subtask #4
40.0 / 40.0