oj.uz

Submission #81759

# Submission time Handle Problem Language Result Execution time Memory
81759 2018-10-26T12:58:57 Z mayhoubsaleh Zamjena (COCI18_zamjena) C++14
42 / 70
 83 ms 6056 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;
int n;
string a[50004],b[50004];

int toint(string s){
    int ten=1;
    int ret=0;
    for(int i=s.size()-1;i>=0;i--){
        ret+=(s[i]-'0')*ten;
        ten*=10;
    }
    return ret;
}

map<string,int>val;
map<string,bool>existval;
int main()
{
    cin>>n;
    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++){
        if(a[i][0]>='0'&&a[i][0]<='9'){
            if(b[i][0]>='0'&&b[i][0]<='9'){if(toint(a[i])!=toint(b[i])){cout<<"NE";return 0;}}
            else {
                    if(!existval[b[i]])
                        {val[b[i]]=toint(a[i]),existval[b[i]]=1;}
                    else if(val[b[i]]!=toint(a[i])){cout<<"NE";return 0;}
                 }
        }

        else
        {
            if(b[i][0]>='0'&&b[i][0]<='9')
            {
                if(!existval[a[i]]){existval[a[i]]=1;val[a[i]]=toint(b[i]);}
                else if(toint(b[i])!=val[a[i]]){cout<<"NE";return 0;}
            }
            else
            {
                if(existval[a[i]]){
                    if(existval[b[i]]){if(val[a[i]]!=val[b[i]]){cout<<"NE";return 0;}}
                    else
                    {
                        existval[b[i]]=1;
                        val[b[i]]=val[a[i]];
                    }
                }
                else
                {
                    if(existval[b[i]]){
                        existval[a[i]]=1;
                        val[a[i]]=val[b[i]];
                    }
                }
            }
        }
    }

    for(int i=0;i<n;i++){
        if(a[i][0]<='z'&&a[i][0]>='a'&&b[i][0]<='z'&&b[i][0]>='a'){
            if(existval[a[i]]){
                    if(existval[b[i]]){if(val[a[i]]!=val[b[i]]){cout<<"NE";return 0;}}
                    else
                    {
                        existval[b[i]]=1;
                        val[b[i]]=val[a[i]];
                    }
                }
                else
                {
                    if(existval[b[i]]){
                        existval[a[i]]=1;
                        val[a[i]]=val[b[i]];
                    }
                }
        }
    }
    /*string s="1099";
    cout<<toint(s);*/
    cout<<"DA"<<endl;
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3448 KB Output is correct
2 Correct 6 ms 3452 KB Output is correct
3 Correct 5 ms 3624 KB Output is correct
4 Correct 5 ms 3624 KB Output is correct
5 Correct 5 ms 3624 KB Output is correct

Subtask #2
14.0 / 14.0

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

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3624 KB Output is correct
2 Correct 6 ms 3624 KB Output is correct
3 Correct 5 ms 3624 KB Output is correct
4 Correct 5 ms 3632 KB Output is correct
5 Correct 5 ms 3632 KB Output is correct
6 Incorrect 5 ms 3632 KB Output isn't correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3792 KB Output is correct
2 Correct 6 ms 3792 KB Output is correct
3 Correct 13 ms 3944 KB Output is correct
4 Correct 10 ms 3948 KB Output is correct
5 Correct 16 ms 3948 KB Output is correct
6 Correct 9 ms 3948 KB Output is correct

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 4204 KB Output is correct
2 Correct 64 ms 5740 KB Output is correct
3 Incorrect 83 ms 6056 KB Output isn't correct
4 Halted 0 ms 0 KB -