| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 472201 | Mr_Ph | Zamjena (COCI18_zamjena) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
///made by : Mr_Ph :D
#include<bits/stdc++.h>
#include<unordered_map>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
const double PI=acos(-1.0);
const ll mod=(ll)1e9+7;
//int a1[4] = {0, 0, 1, -1};
//int b1[4] = {1, -1, 0, 0};
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define lower(s) transform(s.begin(),s.end(),s.begin(),::tolower)
#define upper(s) transform(s.begin(),s.end(),s.begin(),::toupper)
#define ent_arr for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
///the end of the defines ;)
map<string,vector<string>>adj;
map<string,bool>vs;
//map<string,string>mp;
bool isint(string s)
{
for(int i=0;i<s.sz;i++)
{
if(s[i]<'0'||s[i]>'9')
return false;
}
return true;
}
vector<string>aa;
void dfs(string node)
{
if(isint(node))
aa.push_back(node);
vs[node]=true;
for(auto i:adj[mp[node]])
if(!vs[i])
dfs(i);
}
void solve()
{
int n;
cin>>n;
vector<string>arr(n);
vector<string>brr(n);
for(int i=0; i<n; i++)
{
cin>>arr[i];
//mp[arr[i]]=arr[i];
}
for(int i=0;i<n;i++)
{
cin>>brr[i];
//mp[brr[i]]=brr[i];
adj[brr[i]].push_back(arr[i]);
adj[arr[i]].push_back(brr[i]);
}
for(int i=0;i<n;i++)
{
vs.clear();
aa.clear();
if(isint(arr[i])&&isint(brr[i]))
{
if(arr[i]!=brr[i])
{
cout<<"NE"<<endl;
return;
}
}
else
{
if(isint(arr[i]))
dfs(brr[i]);
else //if(isint(mp[brr[i]]))
dfs(arr[i]);
if(aa.sz>1)
{
cout<<"NE"<<endl;
return;
}
}
}
// for(int i=0;i<n;i++)
//{
// if(mp[arr[i]]!=mp[brr[i]])
// {
// cout<<"NE"<<endl;
// return;
// }
// }
cout<<"DA"<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
//freopen("window.in","r",stdin);
//freopen("output.txt","w",stdout);
int t=1;//int st;
//cin>>t;//cin>>st;
while(t--)
solve();
}