列表

详情

NC223615. GOutofSorts

描述

Ann Logan is fascinated with finite sequences of integers. She is particularly interested in sequences of the form x1, x2, . . . , xn where: 
    • xi = (axi−1 + c) mod m, 
    • n, m, a, and c are positive integer constants, 
    • x0 is a non-negative integer constant, and 
    • all n values are unique. 
For example, if n = 5, m = 8, a = 1, c = 3, and x0 = 3, the sequence is 6, 1, 4, 7, 2 (x1 = (1 · 3 + 3) mod 8 = 6, x2 = (1 · 6 + 3) mod 8 = 1, and so on). Note that she does not consider the initial value x0 to be part of the sequence.
 Ann wants to be able to quickly determine, for any integer value, whether or not it appears within a finite sequence of this form. Given values of n, m, a, c, and x0, she plans to follow this list of steps: 
    1. Generate the sequence x1, · · · , xn and store it in an array. 
    2. Sort the array. 
    3. Perform a binary search of the array for each integer of interest to her. 
Ann’s search algorithm, while not the most efficient possible, is pretty straightforward and understandable to anyone familiar with binary search: after calculating the midpoint mid at each step of the calculation (using mid = (low+high)/2), she first checks whether or not the value at location mid is equal to the search value x. If not, she then narrows the search according to whether x is strictly less than or strictly greater than the value at location mid.
Unfortunately, Ann is absent-minded and she lost her list of steps. She managed to remember the first and last step, but . . . she forgot to sort the array before performing her binary search! Needless to say, this means that many values that are in the (unsorted) array will not be found by a binary search, although surprisingly some can. In the example above, both 4 and 7 can be found with Ann’s binary search. How many values can be found for various sequences? Don’t botch it up!

输入描述

Input consists of a line containing five integers n, m, a, c, and x0 (1 ≤ n ≤ 106 , 1 ≤ m, a, c ≤ 2 31 − 1, 0 ≤ x0 ≤ 2 31 − 1), where n is the length of the sequence x1, . . . , xn to be generated and m, a, c, and x0 are the constants used for generating the sequence. All values in the generated sequence are guaranteed to be unique.

输出描述

Output the number of sequence values that could be found using Ann’s version of binary search, assuming she forgot to sort the sequence. 

示例1

输入: 

5 8 1 3 3

输出: 

2

示例2

输入: 

6 10 1234567891 1 1234567890

输出: 

6

原站题解

上次编辑到这里，代码来自缓存 点击恢复默认模板

C++ 解法, 执行用时: 64ms, 内存消耗: 4260K, 提交时间: 2021-07-22 12:13:35 

#include<bits/stdc++.h>
using namespace std;
int n,m,a,c,l,r,cnt,mid;
int A[1000005];

int main(){
	cin>>n>>m>>a>>c>>A[0];
	for(int i=1;i<=n;i++) A[i]=(1ll*a*A[i-1]%m+c)%m;
	for(int i=1;i<=n;i++){
		l=1,r=n;
		while(l<=r){
			mid=(l+r)/2;
			if(A[mid]==A[i]){
				cnt++;break;
			}
			if(A[mid]>A[i]) r=mid-1;
			else l=mid+1;
		}
	}
	printf("%d\n",cnt);
	
	return 0;
}

上一题

© 2025 nowcoder.com