Codeforces Round #238 (Div. 2)C Unusual Product（想法题）

题目链接: 传送门

Domino Effect

time limit per test:1 second     memory limit per test:256 megabytes

Description

Little Chris is a huge fan of linear algebra. This time he has been given a homework about the unusual square of a square matrix.
The dot product of two integer number vectors x and y of size n is the sum of the products of the corresponding components of the vectors. The unusual square of an n × n square matrix A is defined as the sum of n dot products. The i-th of them is the dot product of the i-th row vector and the i-th column vector in the matrix A.
Fortunately for Chris, he has to work only in GF(2)! This means that all operations (addition, multiplication) are calculated modulo 2. In fact, the matrix A is binary: each element of A is either 0 or 1. For example, consider the following matrix A:

The unusual square of A is equal to (1·1 + 1·0 + 1·1) + (0·1 + 1·1 + 1·0) + (1·1 + 0·1 + 0·0) = 0 + 1 + 1 = 0.
However, there is much more to the homework. Chris has to process q queries; each query can be one of the following:

• 1、given a row index i, flip all the values in the i-th row in A;
• 2、given a column index i, flip all the values in the i-th column in A;
• 3、find the unusual square of A.
  To flip a bit value w means to change it to 1 - w, i.e., 1 changes to 0 and 0 changes to 1.
  Given the initial matrix A, output the answers for each query of the third type! Can you solve Chris's homework?

Input

The first line of input contains an integer n (1 ≤ n ≤ 1000), the number of rows and the number of columns in the matrix A. The next n lines describe the matrix: the i-th line contains n space-separated bits and describes the i-th row of A. The j-th number of the i-th line aij (0 ≤ aij ≤ 1) is the element on the intersection of the i-th row and the j-th column of A.
The next line of input contains an integer q (1 ≤ q ≤ 106), the number of queries. Each of the next q lines describes a single query, which can be one of the following:

• 1 i — flip the values of the i-th row;
• 2 i — flip the values of the i-th column;
• 3 — output the unusual square of A.
  Note: since the size of the input and output could be very large, don't use slow output techniques in your language. For example, do not use input and output streams (cin, cout) in C++.

Output

Let the number of the 3rd type queries in the input be m. Output a single string s of length m, where the i-th symbol of s is the value of the unusual square of A for the i-th query of the 3rd type as it appears in the input.

Sample Input

3
1 1 1
0 1 1
1 0 0
12
3
2 3
3
2 2
2 2
1 3
3
3
1 2
2 1
1 1
3

Sample Output

01001

解题思路：

题目定义了矩阵的特殊乘法，
尝试分析一下3*3的矩阵：

A11  A12  A13              A11*A11+A12*A21+A13*A31
A21  A22  A23    =     +   A12*A21+A22*A22+A32*A23          =     A11*A11+A22*A22+A33*A33+0
A31  A32  A33          +   A13*A31+A23*A32+A33*A33

所以对于每次操作只要对对角线元素操作就好了。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef __int64 LL;
const int MAX = 1005;
int ans[MAX][MAX];

int main()
{
	int N,q,sum = 0;
	memset(ans,0,sizeof(ans));
	scanf("%d",&N);
	for (int i = 1;i <= N;i++)
	{
		for (int j = 1;j <= N;j++)
		{
			scanf("%d",&ans[i][j]);
		}
	}
	for (int i = 1;i <= N;i++)
	{
		for (int j = 1;j <= N;j++)
		{
			sum += ans[i][j]*ans[j][i];
		}
	}
	sum %= 2;
	scanf("%d",&q);
	while (q--)
	{
		int opt,tmp;
		scanf("%d",&opt);
		if (opt != 3)
		{
			scanf("%d",&tmp);
			if (sum == 0) sum = 1;
			else if (sum == 1) sum = 0;
		}
		else
		{
			printf("%d",sum);
		}
	}
	printf("\n");
	return 0;
}