-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathescape1.cpp
49 lines (49 loc) · 1.21 KB
/
escape1.cpp
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
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;
int main() {
int tests;
scanf("%d", &tests);
while(tests--) {
int n;
scanf("%d", &n);
int *array = new int[n];
for(int i=0;i<n;++i) {
scanf("%d", array + i);
}
int base = n;
long long* hashArray = new long long[n];
map<long long, int>indexMap;
for(int i=0;i<n;++i) {
long long num = 0;
int x = n;
for(int j=0;j<n;++j) {
if(i == j && j != (n-1)) {
j++;
} else {
num = (num * base) + array[j];
x--;
}
}
while(x--) {
num *= base;
}
indexMap[num] = array[i];
hashArray[array[i]] = num;
}
sort(hashArray, hashArray + n);
for(int i=0;i<n;++i) {
array[indexMap[hashArray[i]]] = i;
}
for(int i=0;i < n; ++i) {
printf("%d", array[i]);
if(i != n - 1) {
printf(" ");
}
}
printf("\n");
delete [] array;
delete [] hashArray;
}
}