每日一题第八十期 CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!)

最新推荐文章于 2024-11-12 12:29:51 发布

娇娇yyyyyy

最新推荐文章于 2024-11-12 12:29:51 发布

阅读量933

点赞数 32

分类专栏：每日一题 cf 文章标签：算法 c++

本文链接：https://blog.csdn.net/2301_80882026/article/details/137505986

版权

每日一题同时被 2 个专栏收录

98 篇文章 1 订阅

订阅专栏

31 篇文章 0 订阅

订阅专栏

本文介绍了一个编程问题，要求根据给定的数组a计算每个位置的MEX值，并基于这些MEX值构造满足条件的排列p。Bessie需要找到至少一种可能的排列p，使得a[i]=MEX(p[1],p[2],...,p[i])-p[i]。

摘要由CSDN通过智能技术生成

B. Bessie and MEX

time limit per test: 1.5 seconds

memory limit per test: 256 megabytes

input: standard input

output: standard output

MOOO! - Doja Cat

⠀

Farmer John has a permutation $p_1, p_2, \ldots, p_n$ , where every integer from $0$ to $n - 1$ occurs exactly once. He gives Bessie an array $a$ of length $n$ and challenges her to construct $p$ based on $a$ .

The array $a$ is constructed so that $a_i$ = $\texttt{MEX}(p_1, p_2, \ldots, p_i) - p_i$ , where the $\texttt{MEX}$ of an array is the minimum non-negative integer that does not appear in that array. For example, $\texttt{MEX}(1, 2, 3) = 0$ and $\texttt{MEX}(3, 1, 0) = 2$ .

Help Bessie construct any valid permutation $p$ that satisfies $a$ . The input is given in such a way that at least one valid $p$ exists. If there are multiple possible $p$ , it is enough to print one of them.
Input

The first line contains $t$ ( $\leq t \leq 10^4$ ) — the number of test cases.

The first line of each test case contains an integer $n$ ( $\leq n \leq 2 \cdot 10^5$ ) — the lengths of $p$ and $a$ .

The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $\leq a_i \leq n$ ) — the elements of array $a$ .

It is guaranteed that there is at least one valid $p$ for the given data.

It is guaranteed that the sum of $n$ over all test cases does not exceed $\cdot 10^5$ .
Output

For each test case, output $n$ integers on a new line, the elements of $p$ .

If there are multiple solutions, print any of them.

Example
inputCopy
3
5
1 1 -2 1 2
5
1 1 1 1 1
3
-2 1 2
outputCopy
0 1 4 2 3
0 1 2 3 4
2 0 1

Note

In the first case, $p = [0, 1, 4, 2, 3]$ is one possible output.

$a$ will then be calculated as $a_1 = \texttt{MEX}(0) - 0 = 1$ , $a_2 = \texttt{MEX}(0, 1) - 1 = 1$ , $a_3 = \texttt{MEX}(0, 1, 4) - 4 = -2$ , $a_4 = \texttt{MEX}(0, 1, 4, 2) - 2 = 1$ , $a_5 = \texttt{MEX}(0, 1, 4, 2, 3) - 3 = 2$ .

So, as required, $a$ will be $[1, 1, - 2, 1, 2]$ .

AC代码：

#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<string>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<numeric>
#include<iomanip>
#define endl '\n'
using namespace std;

typedef long long ll;
typedef pair<int, int>PII;
const int N=3e5+10;
const int MOD=1e9 + 7;
const int INF=0X3F3F3F3F;
const int dx[]={-1,1,0,0,-1,-1,+1,+1};
const int dy[]={0,0,-1,1,-1,+1,-1,+1};
const int M = 1e6 + 10;

int t;
int n;
int h[N];
int a[N];
int main()
{
	cin >> t;
	while(t --){
		cin >> n;
		memset(h, 0, sizeof h);
		int flag = n;
		for(int i = 1; i <= n; i ++)
		{
			cin >> a[i];
		}
		for(int i = n; i >= 1; i --)
		{
			int x = flag - a[i];
			if(flag > x) flag = x;
			h[i] = x;
		}
		for(int i = 1; i <= n; i ++)
		{
			cout << h[i] << " ";
		}
		cout << endl;
	}
	return 0;
}