#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define vi vector<int>
#define fo(i,a,b) for(int i=(a);i<=(b);++i)
#define fd(i,a,b) for(int i=(a);i>=(b);--i)
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define maxi(a,b) a=max(a,b)
#define mini(a,b) a=min(a,b)
#define ii pair<int,int>
const int N = 50005, mod = 1e9+7;
int n;
string a[N], b[N];
set<string> vis;
map<string, vector<string>> g;
int pre;
bool isNum(string &s) {
for (char &c : s) if (!isdigit(c)) return 0;
return 1;
}
void dfs(string &s) {
vis.insert(s);
if (isNum(s)) pre++;
for (string &t:g[s]) if (!vis.count(t)) dfs(t);
}
void solve() {
cin >> n;
fo(i,1,n) cin >> a[i];
fo(i,1,n) cin >> b[i];
fo(i,1,n) {
if (isNum(a[i])&&isNum(b[i])&&a[i]!=b[i]) {
cout << "NE";
return;
}
if (a[i] == b[i]) continue;
g[a[i]].eb(b[i]); g[b[i]].eb(a[i]);
}
for (auto &x : g) {
sort(all(x.se));
x.se.resize(unique(all(x.se))-x.se.begin());
}
fo(i,1,n) {
pre=0;
if (!vis.count(a[i])) dfs(a[i]);
if (pre>1) {
cout << "NE";
return;
}
}
cout << "DA";
}
signed main() {
cin.tie(0)->sync_with_stdio(0);
if (fopen("A.inp", "r"))
freopen("A.inp", "r", stdin);
solve();
}
Compilation message (stderr)
zamjena.cpp: In function 'int main()':
zamjena.cpp:64:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
64 | freopen("A.inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
# | 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... |