Submission #472218

#	Time	Username	Problem	Language	Result	Execution time	Memory
472218		SaraMostafa	Zamjena (COCI18_zamjena)	C++14	70 / 70	265 ms	15648 KiB

zamjena

#include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long
#define endl "\n"
#define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const long long mod=998244353;
const double PI=acos(-1);
map<string,bool>vs;
ll cntd=0,cnta=0;
map<string,vector<string>>mp;
set<string>st;
void dfs(string node)
{
    vs[node]=1;
    if(isdigit(node[0]))
       st.insert(node);
    for(auto i:mp[node])
    {
        if(!vs[i])
        {
            dfs(i);
        }
    }
}
int main()
{
    //freopen("input.in","r",stdin);
    Sara
    int n;
    cin>>n;
    vector<string>a(n),b(n);
    bool valid=1;
    for(int i=0; i<n; i++)
    {
        cin>>a[i];
    }
    for(int i=0; i<n; i++)
    {
        cin>>b[i];
    }

    for(int i=0; i<n; i++)
    {
        mp[a[i]].push_back(b[i]);
        mp[b[i]].push_back(a[i]);
    }
    for(int i=0; i<n; i++)
    {
        dfs(a[i]);
        if(st.size()>1){
            valid=0;
            break;
        }
                st.clear();

    }
    if(!valid)
        cout<<"NE"<<endl;
    else
        cout<<"DA"<<endl;



    return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14