Submission #621516

#TimeUsernameProblemLanguageResultExecution timeMemory
621516Cyber_WolfZamjena (COCI18_zamjena)C++14
0 / 70
35 ms3204 KiB
//Problem Name: Zamjena //Problem Link: https://oj.uz/problem/view/COCI18_zamjena #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #pragma GCC optimize("Ofast") using namespace std; using namespace __gnu_pbds; #define lg long long #define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> #define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); #define endl \n #define lbound(x, y) lower_bound(x.begin(), x.end(), y) #define ubound(x, y) upper_bound(x.begin(), x.end(), y) #define sortasc(v) sort(v.begin(), v.end()) #define sortdesc(v) sort(v.rbegin(), v.rend()) #define custom_array(a,l, r) int _##a[r-l+1]; int*a=_##a-l; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const lg MOD = 1e9+7, N = 2e5+5, M = 1e7+1, SZ = 1e3+1; /* bitset<N> primes; lg pwrs[N], inv[N]; lg fast_power(lg n, lg k) { if(!k) return 1; if(k&1) return (fast_power(n, k-1)*n)%MOD; lg x = fast_power(n, k/2)%MOD; return (x*x)%MOD; } void sieve() { primes.set(); primes[0] = primes[1] = 0; for(lg i = 2; i < N; i++) { if(!primes[i]) continue; for(lg j = i*i; j < N; j += i) { primes[j] = 0; } } return; } struct matrix { vector<vector<lg>> con = vector<vector<lg>> (SZ, vector<lg> (SZ)); matrix operator *(const matrix& a) { matrix product; for(int i = 0; i < (lg)con.size(); i++) { for(int j = 0; j < (lg)a.con[0].size(); j++) { for(int k = 0; k < (lg)a.con.size(); k++) { product.con[i][j] = (product.con[i][j]+(con[i][k]*a.con[k][j])%MOD)%MOD; } } } return product; } }; void preprocess(lg x) { inv[2e5] = fast_power(x, MOD-2); for(int i = 2e5-1; i > 1; i--) { inv[i] = (inv[i+1]*i)%MOD; } pwrs[0] = 1; for(int i = 1; i <= 2e5; i++) { pwrs[i] = (pwrs[i]*i)%MOD; } return; } */ int main() { fastio; lg n; cin >> n; vector<string> a(n), b(n); for(int i = 0; i < n; i++) cin >> a[i]; for(int i = 0; i < n; i++) cin >> b[i]; map<string, string> mp; for(int i = 0; i < n; i++) { if(a[i][0] >= 'a' && a[i][0] <= 'z') { if(b[i][0] >= '0' && b[i][0] <= '9') { mp[a[i]] = b[i]; } else { mp[b[i]] = mp[a[i]]; } } if(b[i][0] >= 'a' && b[i][0] <= 'z') { if(a[i][0] >= '0' && a[i][0] <= '9') { mp[b[i]] = a[i]; } else{ mp[a[i]] = mp[b[i]]; } } } for(int i = 0; i < n; i++) { if(mp[a[i]] == "") continue; a[i] = mp[a[i]]; } for(int i = 0; i < n; i++) { if(mp[b[i]] == "") continue; b[i] = mp[b[i]]; } //for(auto it : a) cout << it << ' '; //cout << '\n'; //for(auto it : b) cout << it << ' '; //cout << '\n'; cout << (a == b ? "DA\n" : "NE\n"); return 0; }
#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...