CF405C.Unusual Product
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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++.
输入格式
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.
输出格式
无
输入输出样例
输入#1
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
输出#1
01001