Pagini recente » Cod sursa (job #1154963) | Cod sursa (job #734422) | Cod sursa (job #1905859) | Cod sursa (job #631971) | Cod sursa (job #1002619)
#include<vector>
#include<cstdio>
#include<algorithm>
using namespace std;
struct P
{
int n,t;
vector< vector<int> > v;
void read(int N,int T)
{
n=N;t=T;
v.assign(t,vector<int>());
for(int i=0;i<t;i++)
{
for(int x,j=0;j<n;j++)
{
scanf("%d",&x);
if(x>0) v[i].push_back(x);
}
sort(v[i].begin(),v[i].end());
}
sort(v.begin(),v.end());
}
bool operator==(const P &other) const
{
return v==other.v;
}
} a,b;
int main()
{
freopen("amlei.in","r",stdin);
freopen("amlei.out","w",stdout);
int T,n,x,y;
for(scanf("%d",&T);T;T--)
{
scanf("%d%d%d",&n,&x,&y);
a.read(n,x);
b.read(n,y);
puts(a==b?"DA":"NU");
fprintf(stderr,"DONE TEST!\n");
}
return 0;
}