#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool isNum(string s){
return (s[0]>='1' && s[0]<='9');
}
int main()
{
ll n;cin>>n;
vector<string>a(n),b(n);
for(auto &i:a)cin>>i;
for(auto &i:b)cin>>i;
bool v=1;
map<string,string>mp;
map<string,bool>vis;
map<string,vector<string>>u;
for(ll i=0;i<n;i++){
if(vis[a[i]]){
a[i]=mp[a[i]];
}
if(vis[b[i]]){
b[i]=mp[b[i]];
}
if(isNum(a[i]) && isNum(b[i])){
v&=(a[i]==b[i]);
}
else if(isNum(a[i])){
for(auto j:u[b[i]]){
if(vis[j]){
v&=(mp[j] == a[i]);
}
else{
vis[j]=1;
mp[j]=a[i];
}
}
vis[b[i]]=1;
mp[b[i]]=a[i];
}
else if(isNum(b[i])){
for(auto j:u[a[i]]){
if(vis[j]){
v&=(mp[j] == b[i]);
}
else{
vis[j]=1;
mp[j]=b[i];
}
}
vis[a[i]]=1;
mp[a[i]]=b[i];
}
else{
u[a[i]].push_back(b[i]);
u[b[i]].push_back(a[i]);
}
}
if(v){
cout<<"DA";
}
else{
cout<<"NE";
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
512 KB |
Output is correct |
2 |
Correct |
3 ms |
460 KB |
Output is correct |
3 |
Correct |
8 ms |
1116 KB |
Output is correct |
4 |
Correct |
6 ms |
1100 KB |
Output is correct |
5 |
Correct |
7 ms |
1228 KB |
Output is correct |
6 |
Correct |
7 ms |
972 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
3012 KB |
Output is correct |
2 |
Correct |
57 ms |
5828 KB |
Output is correct |
3 |
Correct |
101 ms |
9340 KB |
Output is correct |
4 |
Correct |
126 ms |
11104 KB |
Output is correct |
5 |
Correct |
185 ms |
15588 KB |
Output is correct |
6 |
Correct |
160 ms |
10984 KB |
Output is correct |