oj.uz

Submission #1013671

# Submission time Handle Problem Language Result Execution time Memory
1013671 2024-07-03T19:27:57 Z Saladd Zamjena (COCI18_zamjena) C++14
28 / 70
 15 ms 1672 KB 
#include <bits/stdc++.h>
using namespace std;
map <string,int> mp;

int pa[1000000],arr[1000000],arr2[1000000],st[100000];

int root(int x)
{
    if(pa[x]==x) return x;
    else return pa[x] = root(pa[x]);
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n;
    int idx=1;
    cin >> n;
    for (int i=1;i<=n;i++){
        string str;
        int cnt=0;
        cin >> str;
        int len = str.size();
        //cout << mp[str] << "  ----\n";
        if(mp[str]>0){
            arr[i]=mp[str];
            continue;
        }

        for (int j=0;j<len && cnt==0;j++){
            //cout << str[j] << "\n";
            if(isalpha(str[j])){
                arr[i]=idx;
                pa[idx]=idx;
                mp[str]=idx;
                st[idx++]=1;
                cnt=1;
            }
            else{
                arr[i]=idx;
                pa[idx]=idx;
                mp[str]=idx;
                st[idx++]=0;
                cnt=1;
            }
        }
    }

    for (int i=1;i<=n;i++){
        string str;
        int cnt=0;
        cin >> str;
        int len = str.size();
        if(mp[str]>0){
            arr2[i]=mp[str];
            continue;
        }
        for (int j=0;j<len && cnt==0;j++){
            if(isalpha(str[j])){
                arr2[i]=idx;
                pa[idx]=idx;
                mp[str]=idx;
                st[idx++]=1;
                cnt=1;
            }
            else{
                arr2[i]=idx;
                pa[idx]=idx;
                mp[str]=idx;
                st[idx++]=0;
                cnt=1;
            }
        }
    }
    for(int i=1;i<=n;i++){
        int a=arr[i];
        int b=arr2[i];

        if(root(a)!=root(b) && (st[b]==1 || st[a]==1)){
            if (st[a]==1) {
                pa[root(a)]=root(b);
                st[a]=0;
            }
            else {
                pa[root(b)]=root(a);
                st[b]=0;
            }
        }
        if(root(a)!=root(b) && st[b]==0){
            cout << "NE";
            return 0;
        }

    }
    cout << "DA";

    /*cout << '\n';
    for (int i=1;i<=n;i++){
        cout << pa[arr[i]] << " ";
    }
    cout << '\n';
    for (int i=1;i<=n;i++){
        cout << pa[arr2[i]] << " ";
    }*/
    return 0;
}
/*
4
4 5 iks ipasdasd
1 iks 3 iks

3
5 iks ipasdasd
iks 3 iks

5
x 3 x y 3
x y 2 z 3
*/

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 820 KB Output is correct
2 Incorrect 15 ms 1672 KB Output isn't correct
3 Halted 0 ms 0 KB -