POJ2947——Widget Factory

Description

The widget factory produces several different kinds of widgets. Each widget is carefully built by a skilled widgeteer. The time required to build a widget depends on its type: the simple widgets need only 3 days, but the most complex ones may need as many as 9 days.

The factory is currently in a state of complete chaos: recently, the factory has been bought by a new owner, and the new director has fired almost everyone. The new staff know almost nothing about building widgets, and it seems that no one remembers how many days are required to build each diofferent type of widget. This is very embarrassing when a client orders widgets and the factory cannot tell the client how many days are needed to produce the required goods. Fortunately, there are records that say for each widgeteer the date when he started working at the factory, the date when he was fired and what types of widgets he built. The problem is that the record does not say the exact date of starting and leaving the job, only the day of the week. Nevertheless, even this information might be helpful in certain cases: for example, if a widgeteer started working on a Tuesday, built a Type 41 widget, and was fired on a Friday,then we know that it takes 4 days to build a Type 41 widget. Your task is to figure out from these records (if possible) the number of days that are required to build the different types of widgets.

Input

The input contains several blocks of test cases. Each case begins with a line containing two integers: the number 1 ≤ n ≤ 300 of the different types, and the number 1 ≤ m ≤ 300 of the records. This line is followed by a description of the m records. Each record is described by two lines. The first line contains the total number 1 ≤ k ≤ 10000 of widgets built by this widgeteer, followed by the day of week when he/she started working and the day of the week he/she was fired. The days of the week are given bythe strings `MON', `TUE', `WED', `THU', `FRI', `SAT' and `SUN'. The second line contains k integers separated by spaces. These numbers are between 1 and n , and they describe the diofferent types of widgets that the widgeteer built. For example, the following two lines mean that the widgeteer started working on a Wednesday, built a Type 13 widget, a Type 18 widget, a Type 1 widget, again a Type 13 widget,and was fired on a Sunday.

4 WED SUN
13 18 1 13

Note that the widgeteers work 7 days a week, and they were working on every day between their first and last day at the factory (if you like weekends and holidays, then do not become a widgeteer!).

The input is terminated by a test case with n = m = 0 .

Output

For each test case, you have to output a single line containing n integers separated by spaces: the number of days required to build the different types of widgets. There should be no space before the first number or after the last number, and there should be exactly one space between two numbers. If there is more than one possible solution for the problem, then write `Multiple solutions.' (without the quotes). If you are sure that there is no solution consistent with the input, then write `Inconsistent data.'(without the quotes).

Sample Input

2 3
2 MON THU
1 2
3 MON FRI
1 1 2
3 MON SUN
1 2 2
10 2
1 MON TUE 
3
1 MON WED
3
0 0

Sample Output

8 3
Inconsistent data.

Hint

Huge input file, 'scanf' recommended to avoid TLE.

Source

Central Europe 2005

这题就是给你一个有m个方程，有n个变量的方程组，然后求解。
每个方程形如  x[i]*mat[k][i] + x[i+1]*mat[k][i+1] + .....  =t[k](mod 7)
那么就可以用高斯消元来解决了， 注意要不断地对7取余。

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<map>

using namespace std;

const int maxn=340;
const int MOD=7;
int x[maxn];
int mat[maxn][maxn];
int free_x[maxn];

int gcd(int a,int b)
{
  int t;
  while(b)
  {
    t=b;
    b=a%b;
    a=t;
  }
  return a;
}

int lcm(int a,int b)
{
  return a/gcd(a,b)*b;
}

int Gauss(int equ,int var)
{
  memset(x,0,sizeof(x));
  memset(free_x,1,sizeof(x));
  int i,j,k;
  int max_r;
  int col,free_index,free_num,ta,tb,temp,LCM;
  for(k=0,col=0;k<equ && col<var;k++,col++)
  {
    max_r=k;
    for(i=k+1;i<equ;i++)
    {
      if(abs(mat[i][col]) > abs(mat[max_r][col]))
        max_r=i;
    }
    if(max_r != k)
    {
      for(i=k;i<var+1;i++)
        swap(mat[k][i],mat[max_r][i]);
    }
    if(mat[k][col] == 0)
    {
      k--;
      continue;
    }
    for(i=k+1;i<equ;i++)
    {
      if(mat[i][col])
      {
        LCM=lcm(abs(mat[k][col]),abs(mat[i][col]));
        ta=LCM/abs(mat[i][col]);
        tb=LCM/abs(mat[k][col]);
        if(mat[i][col] * mat[k][col] < 0)
          tb=-tb;
        for(j=col;j<var+1;j++)
          mat[i][j]=((mat[i][j]*ta-mat[k][j]*tb)%MOD + MOD)%MOD;
      }
    }
  }
  for(i=k;i<equ;i++)
    if(mat[i][col])
      return -1;
  if(var > k)
    return var-k;
  //回代
  for(i=var-1;i>=0;i--)
  {
    temp=mat[i][var];
    for(j=i+1;j<var;j++)
      if(mat[i][j])
      {
        temp-=mat[i][j]*x[j];
        temp=(temp%MOD+MOD)%MOD;
      }
    while (temp % mat[i][i] != 0) temp+=MOD;
    x[i]=(temp/mat[i][i])%MOD;
  }
  return 0;
}

char str1[10],str2[10];

int main()
{
	int n,m,k,d;
	map<string,int>times;
	times["MON"]=1;
	times["TUE"]=2;
	times["WED"]=3;
	times["THU"]=4;
	times["FRI"]=5;
	times["SAT"]=6;
	times["SUN"]=7;
	while(~scanf("%d%d",&n,&m))
	{
		if(!n && !m)
		  break;
        memset(mat,0,sizeof(mat));
        for(int i=0;i<m;i++)
        {
        	scanf("%d%s%s",&k,str1,str2);
        	mat[i][n]=((times[str2]-times[str1]+1)%MOD+MOD)%MOD;
        	for(int j=1;j<=k;j++)
        	{
	        	scanf("%d",&d);
	        	d--;
	        	mat[i][d]++;
	        	mat[i][d]%=7;
	        }
        }
        int res=Gauss(m,n);
        if(res==-1)
          printf("Inconsistent data.\n");
        else if(res>0)
          printf("Multiple solutions.\n");
        else
        {
        	for(int i=0;i<n-1;i++)
        	{
	        	if(x[i]<3)
        	      x[i]+=MOD;
        	    printf("%d ",x[i]);
	        }
	        if(x[n-1]<3)
  	            x[n-1]+=MOD;
	        printf("%d\n",x[n-1]);
        }
	}
	return 0;
}