Hilbert’s Hotel
Hilbert’s Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero and negative integers. Even stranger, the hotel is currently at full capacity, meaning there is exactly one guest in every room. The hotel’s manager, David Hilbert himself, decides he wants to shuffle the guests around because he thinks this will create a vacancy (a room without a guest).
For any integer k and positive integer n, let kmodn denote the remainder when k is divided by n. More formally, r=kmodn is the smallest non-negative integer such that k−r is divisible by n. It always holds that 0≤kmodn≤n−1. For example, 100mod12=4 and (−1337)mod3=1.
Then the shuffling works as follows. There is an array of n integers a0,a1,…,an−1. Then for each integer k, the guest in room k is moved to room number k+akmodn.
After this shuffling process, determine if there is still exactly one guest assigned to each room. That is, there are no vacancies or rooms with multiple guests.
Input
Each test consists of multiple test cases. The first line contains a single integer t (1≤t≤104) — the number of test cases. Next 2t lines contain descriptions of test cases.
The first line of each test case contains a single integer n (1≤n≤2⋅105) — the length of the array.
The second line of each test case contains n integers a0,a1,…,an−1 (−109≤ai≤109).
It is guaranteed that the sum of n over all test cases does not exceed 2⋅105.
Output
For each test case, output a single line containing “YES” if there is exactly one guest assigned to each room after the shuffling process, or “NO” otherwise. You can print each letter in any case (upper or lower).
Example
Input
6
1
14
2
1 -1
4
5 5 5 1
3
3 2 1
2
0 1
5
-239 -2 -100 -3 -11
Output
YES
YES
YES
NO
NO
YES
Note:
In the first test case, every guest is shifted by 14 rooms, so the assignment is still unique.
In the second test case, even guests move to the right by 1 room, and odd guests move to the left by 1 room. We can show that the assignment is still unique.
In the third test case, every fourth guest moves to the right by 1 room, and the other guests move to the right by 5 rooms. We can show that the assignment is still unique.
In the fourth test case, guests 0 and 1 are both assigned to room 3.
In the fifth test case, guests 1 and 2 are both assigned to room 2.
题目大意:
有无限个房间,将第k个房间移至第k+a[k%n]个房间,问同一位置是否只有一个数。
因为本人水平有限这里是找规律做的,随后会更新正规做法。
做题思路:
可以用前n号房的数据得出任意一号间房的客人移动后的位置s:
s=nx+i+a[i]
设当一号房内有两人时:
也就是说s1=s2;
nx+i+a[i]=ny+j+a[j]
n*(x-y)=j-i+a[j]-a[i]
(x-y)=(j-i+a[j]-a[i])/n.
在此题中当s1=s2时(x-y)一定为整数,因此我们只需要算出(j-i+a[j]-a[i])%n是否==0就可以了。
代码:
#include<algorithm>
#include<iostream>
using namespace std;
const int maxn=2e5+10;
int a[maxn];
int n;
int main()
{
int t;
cin>>t;
while(t--)
{
int flag=0;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
int l=j-i+a[j]-a[i];
if(l%n==0)
{
flag=1;
break;
}
}
if(flag)
break;
}
if(flag)
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
}
}
未来会更新常规做法,此篇仅为个人理解,如有纰漏欢迎指出。