제출 #1245234

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1245234		warrenn	Zamjena (COCI18_zamjena)	C++20	28 / 70	8 ms	2372 KiB

zamjena

#include<bits/stdc++.h>
using namespace std;
#define int long long 

int n;
map<string,vector<string> >adj;
map<string,bool>vis;
int cnt=0;

bool iya(string cur){
    if(cur=="0" || cur=="1" || cur=="2" || cur=="3" || cur=="4")return true;
    if(cur=="5" || cur=="6" || cur=="7" || cur=="9" || cur=="8")return true;
    return false;
}


void dfs(string cur){
    if(cur.length()==1 && iya(cur))cnt++;
    vis[cur]=true;
    for(auto r : adj[cur]){
        if(vis[r])continue;
        dfs(r);
    }
}


signed main(){
    cin>>n;
    string a[n+1],b[n+1];
    for(int q=1;q<=n;q++){
        cin>>a[q];
    }
    for(int q=1;q<=n;q++){
        cin>>b[q];
        if(a[q]!=b[q]){
            adj[a[q]].push_back(b[q]);
            adj[b[q]].push_back(a[q]);
        }
    }
    bool oke=true;
    for(int q=0;q<=9;q++){
        cnt=0;
        dfs(to_string(q));
        if(cnt>1)oke=false;
    }
    if(oke){
        cout<<"DA"<<endl;
    }
    else{
        cout<<"NE"<<endl;
    }

}

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