This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pb push_back
const int mod = 1e9+7;
using namespace std;
bool comp(pair<int,int>&a ,pair<int,int>&b)
{
if(a.first==b.first)
{
return a.second>b.second;
}
return a.first<b.first;
}
void solve()
{
int n;
cin>>n;
vector<string>v(n),v2(n);
map<string,string>mp;
for(int i=0;i<n;i++)
{
cin>>v[i];
mp[v[i]]="1234";
}
for(int i=0;i<n;i++)
{
cin>>v2[i];
mp[v2[i]]="1234";
}
//1234 is null value
for(int j=0;j<5;j++)
for(int i=0;i<n;i++)
{
char a,b;
a=v[i][0];
b=v2[i][0];
if(isdigit(a) && isdigit(b))
{
if(v[i]!=v2[i])
{
cout<<"NE"<<endl;
return;
}
}
else if(isdigit(a) && !isdigit(b))
{
if(mp[v2[i]]=="1234")
{
mp[v2[i]]=v[i];
v2[i]=v[i];
}
else
{
if(mp[v2[i]]!=v[i])
{
cout<<"NE"<<endl;
return;
}
else
{
v2[i]=v[i];
}
}
}
else if(isdigit(b) && !isdigit(a))
{
if(mp[v[i]]=="1234")
{
mp[v[i]]=v2[i];
v[i]=v2[i];
}
else
{
if(mp[v[i]]!=v2[i])
{
cout<<"NE"<<endl;
return;
}
else
{
v[i]=v2[i];
}
}
}
else
{
if(mp[v[i]]!="1234")
{
v[i]=mp[v[i]];
}
if(mp[v2[i]]!="1234")
{
v2[i]=mp[v2[i]];
}
}
}
for(int i=0;i<n;i++)
{
v[i]=mp[v[i]];
v2[i]=mp[v2[i]];
if(v[i]!=v2[i])
{
cout<<"NE"<<endl;
return;
}
}
cout<<"DA"<<endl;
}
int32_t main(){
int t=1;
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//cin>>t;
while(t--){solve();}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |