Submission #61559555

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
#define int long long
#define For(i, a, b) for(int i = (a); i <= (b); i++)
#define Rof(i, a, b) for(int i = (a); i >= (b); i--)
using namespace std;
const int N = 5e5 + 5;
int n, a[N], b[N];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
void Solve(){
  cin >> n;
  For(i, 1, n) cin >> a[i];
  int tag = 0;
  For(i, 1, n){
    while(!q.empty() && q.top().first <= tag) q.pop();
    a[i] += q.size(); //cerr << "a[" << i << "]=" << a[i] << '\n';
    tag++; q.push({a[i] + tag, i});
  }
  while(!q.empty()){
    auto [x, y] = q.top(); q.pop();
    //cerr << "x=" << x << " y=" << y << '\n';
    b[y] = x - tag;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
#define int long long
#define For(i, a, b) for(int i = (a); i <= (b); i++)
#define Rof(i, a, b) for(int i = (a); i >= (b); i--)
using namespace std;
const int N = 5e5 + 5;
int n, a[N], b[N];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
void Solve(){
	cin >> n;
	For(i, 1, n) cin >> a[i];
	int tag = 0;
	For(i, 1, n){
		while(!q.empty() && q.top().first <= tag) q.pop();
		a[i] += q.size(); //cerr << "a[" << i << "]=" << a[i] << '\n';
		tag++; q.push({a[i] + tag, i});
	}
	while(!q.empty()){
		auto [x, y] = q.top(); q.pop();
		//cerr << "x=" << x << " y=" << y << '\n';
		b[y] = x - tag;
	}
	For(i, 1, n) cout << b[i] << ' ';
}
signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int T = 1; //cin >> T;
	while(T--) Solve();
	return 0;
}

Submission Info

Judge Result