CF1779G.The Game of the Century
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
The time has finally come, MKnez and Baltic are to host The Game of the Century. For that purpose, they built a village to lodge its participants.
The village has the shape of an equilateral triangle delimited by three roads of length n . It is cut into n2 smaller equilateral triangles, of side length 1 , by 3n−3 additional roads which run parallel to the sides. See the figure for n=3 . Each of the 3n roads is made of multiple (possibly 1 ) road segments of length 1 which connect adjacent intersections.
The direction has already been chosen for each of the 3n roads (so, for each road, the same direction is assigned to all its road segments). Traffic can only go in the specified directions (i. e. the roads are monodirectional).
You are tasked with making adjustments to the traffic plan so that from each intersection it is possible to reach every other intersection. Specifically, you can invert the traffic direction of any number of road segments of length 1 . What is the minimal number of road segments for which you need to invert the traffic direction?
输入格式
Each test contains multiple test cases. The first line contains the number of test cases t ( 1≤t≤10000 ). The description of the test cases follows.
The first line of each test case contains a positive integer n ( 1≤n≤105 ) — the size of the triangular village's sides.
Three lines follow, each containing a binary string of length n which describes the traffic directions of the roads.
The i -th of the following three lines contains a binary string si of length n representing the direction of each road parallel to the road segment denoted by i in the picture above. In particular, the j -th character of si is "1" if the j -th shortest road (parallel to the road segment denoted by i in the picture) has the same direction of the road segment denoted by i in the picture, while it is "0" if it has the opposite direction. So the first character of si describes the direction of the road containing only 1 road segment, while the last character describes the direction of the road containing n road segments.
It is guaranteed that the sum of n over all test cases does not exceed 105 .
输出格式
For each test case, print the minimum number of road segments for which you need to invert the traffic direction.
输入输出样例
输入#1
3 3 001 001 010 1 0 0 0 3 111 011 100
输出#1
2 0 3
说明/提示
The first example corresponds to the picture in the statement. There exist multiple solutions that invert the traffic direction of exactly 2 road segments, but inverting only 1 road segment never makes it possible to reach every intersection from any other. One of the possible solutions is shown in the picture below in which the inverted road segments are highlighted in blue.
In the second example, the answer is 0 since it is already possible to reach every intersection from any other.