# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218966 | brcode | Zamjena (COCI18_zamjena) | C++14 | 231 ms | 25592 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.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5+5;
map<string,vector<string>> v1;
string arr[MAXN];
string arr2[MAXN];
map<string,bool> vis;
string t = "";
string check(string x){
char y = x[0];
if(y>='0' && y<='9'){
t = x;
return x;
}
return "";
}
string glob ="";
string dfs(string curr){
vis[curr] = true;
string hold = check(curr);
for(auto x:v1[curr]){
if(!vis[x]){
hold+=dfs(x);
}
}
return hold;
}
int main() {
int n;
cin>>n;
int cnt = 1;
for(int i=1;i<=n;i++){
cin>>arr[i];
}
for(int i=1;i<=n;i++){
cin>>arr2[i];
}
for(int i=1;i<=n;i++){
if(arr[i] == arr2[i]){
continue;
}
v1[arr[i]].push_back(arr2[i]);
v1[arr2[i]].push_back(arr[i]);
}
for(int i=1;i<=n;i++){
if(vis[arr[i]]){
continue;
}
auto hold = dfs(arr[i]);
for(int j=0;j<hold.size();j++){
for(int k=0;k<t.size();k++){
if(hold[j+k]!=t[k]){
cout<<"NE"<<endl;
return 0;
}
}
j+=hold.size()-1;
}
}
cout<<"DA"<<endl;
}
Compilation message (stderr)
# | 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... |