Submission #847539

#TimeUsernameProblemLanguageResultExecution timeMemory
847539NeltA Plus B (IOI23_aplusb)C++17
100 / 100
64 ms8808 KiB
#include "aplusb.h" #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx,avx2,fma") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> /* DEFINES */ #define S second #define F first #define ll long long #define ull unsigned long long #define ld long double #define npos ULLONG_MAX #define INF LLONG_MAX #define vv(a) vector<a> #define pp(a, b) pair<a, b> #define pq(a) priority_queue<a> #define qq(a) queue<a> #define ss(a) set<a> #define mm(a, b) map<a, b> #define ump(a, b) unordered_map<a, b> #define ANDROID \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define elif else if #define endl "\n" #define allc(a) begin(a), end(a) #define all(a) a, a + sizeof(a) / sizeof(a[0]) #define pb push_back #define logi(a) __lg(a) #define sqrt(a) sqrtl(a) #define mpr make_pair #define ins insert using namespace std; using namespace __gnu_pbds; using namespace __cxx11; typedef char chr; typedef basic_string<chr> str; template <typename T, typename key = less<T>> using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); std::vector<int> smallest_sums(int n, std::vector<int> a, std::vector<int> b) { vv(int) ans(n); ss(pp(ll, pp(ll, ll))) s; for (ll i = 0; i < n; i++) s.ins(mpr(a[i] + b[0], mpr(i, 0))); for (ll i = 0; i < n; i++) { auto tmp = *s.begin(); s.erase(s.begin()); if (tmp.S.S != n - 1) s.ins(mpr(a[tmp.S.F] + b[tmp.S.S + 1], mpr(tmp.S.F, tmp.S.S + 1))); ans[i] = tmp.F; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...