[Codeforces] Codeforces #488 by NEAR (Div. 2) B. Knights of a Polygonal Table

Codeforces Round #488 by NEAR (Div. 2) B. Knights of a Polygonal Table

  • Time : O(nlogn + nlogk)
  • Space : O(n + k)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#include <bits/stdc++.h>

#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")//Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

using namespace std;

struct PairHash {
inline std::size_t operator()(const std::pair<int, int> &v) const { return v.first * 31 + v.second; }
};

// speed
#define Code ios_base::sync_with_stdio(false);
#define By ios::sync_with_stdio(0);
#define Sumfi cout.tie(NULL);

// alias
using ll = long long;
using ld = long double;

// constants
const ld PI = 3.14159265358979323846; /* pi */
const ll INF = 1e18;
const ld EPS = 1e-9;
const ll MAX_N = 101010;
const ll mod = 1e9+7;

// typedef
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef array<ll,3> all3;
typedef array<ll,5> all5;
typedef vector<all3> vall3;
typedef vector<all5> vall5;
typedef vector<ld> vld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef unordered_set<ll> usll;
typedef unordered_set<pll, PairHash> uspll;
typedef unordered_map<ll, ll> umll;

// macros
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,m,n) for(ll i=n;i>=m;i--)
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define pyes cout<<"YES\n";
#define pno cout<<"NO\n";
#define pneg1 cout<<"-1\n";

// utility functions
template <typename T>
void print(T &&t) { cout << t << "\n"; }
template<typename T>
void printv(vector<T>v){ll n=v.size();rep(i,0,n)cout<<v[i]<<" ";cout<<"\n";}
//void readf() {freopen("", "rt", stdin);}

ll __gcd(ll x, ll y) { return !y ? x : __gcd(y, x % y); }
ll __lcm(ll x, ll y) { return x * y / __gcd(x,y); }

using namespace std;

vll solve(vll& A, vll& B, ll k) {
ll n = A.size(), sum = 0;
vll res(n);
vall3 S;
priority_queue<ll, vll, greater<ll>> pq;
rep(i,0,n) S.push_back({A[i], B[i], i});
sort(all(S));
rep(i, 0, n) {
auto [_, c, idx] = S[i];
res[idx] = sum + c;
pq.push(c);
sum += c;
while(pq.size() > k) {
sum -= pq.top();
pq.pop();
}
}
return res;
}
int main() {
Code By Sumfi

cout.precision(12);

ll tc = 1;
//cin>>tc;
for (ll i = 1; i <= tc; i++) {
ll n, k;
cin>>n>>k;
vll A(n), B(n);
rep(i,0,n) cin>>A[i];
rep(i,0,n) cin>>B[i];
printv(solve(A,B,k));
}
return 0;
}
Author: Song Hayoung
Link: https://songhayoung.github.io/2022/07/06/PS/Codeforces/div2-488-b/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.