Submission #855700

#TimeUsernameProblemLanguageResultExecution timeMemory
855700vjudge1Zamjena (COCI18_zamjena)C++17
14 / 70
2 ms856 KiB
#include <bits/stdc++.h> using namespace std; #define sp << " " << #define int long long #define vi vector<int> #define pb push_back #define F(xxx,yyy) for (int xxx=1;xxx<=yyy;xxx++) #define pii pair<int,int> #define all(x) x.begin()+1,x.end() const int N = 4e5+1; bool is_number(string& s) { for (auto it : s) if (it < '0' || it > '9') return false; return true; } void solve() { int n; cin >> n; vector<string> a(n+1),b(n+1); F(i,n) cin >> a[i]; F(i,n) cin >> b[i]; map<string,int> mp; bool fl = true; for (int i=1;i<=n;i++) { if (is_number(a[i]) && is_number(b[i])) { if (stoi(a[i]) == stoi(b[i])) continue; fl = false; break; } else if (is_number(a[i])) { if (mp[b[i]] && mp[b[i]] == stoi(a[i])) continue; else if (mp[b[i]]) { fl = 0; break; } else mp[b[i]] = stoi(a[i]); } else if (is_number(b[i])) { if (mp[a[i]] && mp[a[i]] == stoi(b[i])) continue; else if (mp[a[i]]) { fl = 0; break; } else mp[a[i]] = stoi(b[i]); } else { if (!mp.count(a[i]) || !mp.count(b[i])) continue; if (mp[a[i]] != mp[b[i]]) { fl = 0; break; } } } cout << ((fl)?"DA\n":"NE\n") << endl; } signed main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int t = 1; //cin >> t; while (t --> 0) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...