Cover

TimeLimit: 2000/1000 MS (Java/Others) MemoryLimit: 65536/65536 K (Java/Others)

64-bit integer IO format:%I64d

Special Judge

未提交 | 登录后收藏

Problem Description

You have an n*n matrix.Every grid has a color.Now there are two types of operating:
L x y: for(int i=1;i<=n;i++)color[i][x]=y;
H x y:for(int i=1;i<=n;i++)color[x][i]=y;
Now give you the initial matrix and the goal matrix.There are $m$ operatings.Put in order to arrange operatings,so that the initial matrix will be the goal matrix after doing these operatings

It's guaranteed that there exists solution.

Input

There are multiple test cases,first line has an integer

T $T$
For each case:
First line has two integer

n $n$ ,

m $m$
Then

n $n$ lines,every line has

n $n$ integers,describe the initial matrix
Then

n $n$ lines,every line has

n $n$ integers,describe the goal matrix
Then

m $m$ lines,every line describe an operating

1≤color[i][j]≤n $1\leq color[i][j] \leq n$

T=5 $T=5$

1≤n≤100 $1\leq n \leq 100$

1≤m≤500 $1\leq m \leq 500$

Output

For each case,print a line include m integers.The i-th integer x show that the rank of x-th operating is i

SampleInput

SampleOutput

5 2 4 3 1

Submit

题目统计信息详细


总AC数	5
通过人数	5
尝试人数	6
总提交量	11
AC率	45.45%

标签——1590

name	rating
基础	1535
暴力	1535
数学	1270
贪心	200

AC该题后可以添加标签
贴完标签可以获得20ACB。
并且可以获得本题所有提交代码查看权限。
点击标题可以显示标签。
如果你还没认真思考过这题，请不要查看标签
如果您已经通过了该题，请务为该题贴上标签

出处

【暑假集训组队模拟赛】组队赛4

Cover

T^T Online Judge