HDU 4849 Wow! Such City!

Wow! Such City!

Time Limit: 15000/8000 MS (Java/Others)    Memory Limit: 102400/102400 K (Java/Others)
Total Submission(s): 1806    Accepted Submission(s): 607

Problem Description

Doge, tired of being a popular image on internet, is considering moving to another city for a new way of life.
In his country there are N (2 ≤N≤ 1000) cities labeled 0 . . . N - 1. He is currently in city 0. Meanwhile, for each pair of cities, there exists a road connecting them, costing C_i,_j (a positive integer) for traveling from city i to city j. Please note that C_i,_j may not equal to C_j,_i for any given i ≠ j.
Doge is carefully examining the cities: in fact he will divide cities (his current city 0 is NOT included) into M (2 ≤ M ≤ 10⁶) categories as follow: If the minimal cost from his current city (labeled 0) to the city i is Di, city i belongs to category numbered D_i mod M.Doge wants to know the “minimal” category (a category with minimal number) which contains at least one city.
For example, for a country with 4 cities (labeled 0 . . . 3, note that city 0 is not considered), Doge wants to divide them into 3 categories. Suppose category 0 contains no city, category 1 contains city 2 and 3, while category 2 contains city 1, Doge consider category 1 as the minimal one.
Could you please help Doge solve this problem?

Note:

C_i,_j is generated in the following way:
Given integers X₀, X₁, Y₀, Y₁, (1 ≤ X₀, X₁, Y₀, Y₁≤ 1234567), for k ≥ 2 we have
Xk  = (12345 + X_k-1 * 23456 + X_k-2 * 34567 + X_k-1 * X_k-2 * 45678)  mod  5837501
Yk  = (56789 + Y_k-1 * 67890 + Y_k-2 * 78901 + Y_k-1 * Y_k-2 * 89012)  mod  9860381
The for k ≥ 0 we have

Z_k = (X_k * 90123 + Y_k ) mod 8475871 + 1

Finally for 0 ≤ i, j ≤ N - 1 we have

C_i,_j = Z_i*n+j for i ≠ j
C_i,_j = 0   for i = j

 

Input

There are several test cases. Please process till EOF.
For each test case, there is only one line containing 6 integers N,M,X₀,X₁,Y₀,Y₁.See the description for more details.

 

Output

For each test case, output a single line containing a single integer: the number of minimal category.

 

Sample Input

  
  

   
   3 10 1 2 3 4
4 20 2 3 4 5
  
  

 

Sample Output

  
  

   
   1
10

For the first test case, we have


	   0	   1	   2	   3	   4	   5	   6	   7	   8
X	   1	   2	 185180	 788997	1483212	4659423	4123738	2178800	 219267
Y	   3	   4	1633196	7845564	2071599	4562697	3523912	317737	1167849
Z	 90127	 180251	1620338	2064506	 625135	5664774	5647950	8282552	4912390

the cost matrix C is
	         	   0	 180251	1620338
	                2064506	   0	5664774
	                5647950	8282552	   0


   
   

    
    

     
     Hint
    
    
    
    So the minimal cost from city 0 to city 1 is 180251, while the distance to city 2 is 1620338.
Given M = 10, city 1 and city 2 belong to category 1 and 8 respectively.
Since only category 1 and 8 contain at least one city,
the minimal one of them, category 1, is the desired answer to Doge’s question.

   
   
  
  

题解：题目大意为给你个公式，计算各点间的距离，然后跑一遍最短路……

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<stdlib.h>
#include<time.h>
#include<string>
#include<math.h>
#include<map>
#include<queue>
#include<stack>
#define INF 0x3f3f3f3f
#define ll long long
#define for(i,a,b)  for(int i=a;i<b;i++)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
int n,m;
#define inf 1010*1010+1010
ll x[inf],y[inf],z[inf];        //  计算距离公式中有乘法，用int 会溢出
int w[1010][1010],d[1010],v[1010];
void init()                    //  预处理 计算各点间的距离
{
    for(i,2,inf)
    {
        x[i]=(12345 + x[i-1] * 23456 + x[i-2] * 34567 + x[i-1] * x[i-2] * 45678)%5837501 ;
        y[i] = (56789 + y[i-1] * 67890 + y[i-2] * 78901 + y[i-1] * y[i-2] * 89012)%9860381 ;
    }
    for(i,0,inf)
        z[i]=(x[i] * 90123 + y[i] )%8475871 + 1;
    for(i,0,n)
        for(j,0,n)
        {
            if(i==j)
                w[i][j]=0;
            else
                w[i][j]=z[i*n+j];
        }

}
void spfa()
{
    mem(d,INF);
    mem(v,0);
    queue<int>q;
    v[0]=1;
    d[0]=0;
    q.push(0);
    while(!q.empty())
    {
        int s=q.front();
        q.pop();
        v[s]=0;
        for(i,0,n)
        {
            if(d[i]>w[s][i]+d[s])
            {

                d[i]=w[s][i]+d[s];
                if(!v[i])
                {
                    q.push(i);
                    v[i]=1;
                }
            }
        }
    }

}
int main()
{
    while(~scanf("%d%d%lld%lld%lld%lld",&n,&m,&x[0],&x[1],&y[0],&y[1]))
    {
        init();
        spfa();
        int min=d[1]%m;
        for(i,2,n)
            if(min>d[i]%m)
        printf("%d\n",min);
    }
}