提出 #38070239

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key

typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;

const long long MOD = 998244353;
const long long INF = LLONG_MAX;

int findID(string s){
    ll id = 0;
    ll count = 1;
    for(int i=s.length()-1;i>=0;i--){
        char c=s[i];
        int k = int(c-'a');
        k+=1;
        id+=count*k;
        count*=26;
    }
    return id;
}

int main(){
    //ios_base::sync_with_stdio(0); cin.tie(0);
    // #ifdef LOCALa
    // freopen("input.txt", "r" , stdin);
    // freopen("output.txt", "w", stdout);
    // #endif
    
    int n;
    cin>>n;
    map<ll,ll> m;
    map<ll,int> visited;
    map<ll,int> checked;
    for(int i=0;i<n;i++){
        string s,t;
        cin>>s>>t;
        ll sid = findID(s);
        ll tid = findID(t);
        m[sid]=tid;
        visited[sid]=0;
        visited[tid]=0;
    }

    for(auto i : m){
        ll s = i.fi;
        ll t = i.se;
        if(checked[s]==1){
            continue;
        }
        if(t!=0 && visited[t]==1){
            // cout<<"CASE1"<<endl;
            cout<<"No"<<endl;
            return 0;
        }
        while(visited[t]==0){
            if(checked[t]==1) break;
            checked[s]=1;
            visited[t]=1;
            s=t;
            t=m[s];
            if(t!=0 && visited[t]==1){
                // cout<<"CASE2"<<endl;
                // cout<<s<<' '<<t<<endl;
                cout<<"No"<<endl;
                return 0;
            }
        }
    }
    cout<<"Yes"<<endl;
    return 0;
}

提出情報

ジャッジ結果