oj.uz

Submission #472262

# Submission time Handle Problem Language Result Execution time Memory
472262 2021-09-13T10:34:43 Z Ahmed57 Zamjena (COCI18_zamjena) C++14
28 / 70
 12 ms 1580 KB 
#include<bits/stdc++.h>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int n;
    cin>>n;
    map<string,string> mp;
    string arr[n],aee[n];;
    for(int i = 0;i<n;i++){
        cin>>arr[i];
        mp[arr[i]] = arr[i];
    }
    for(int i = 0;i<n;i++){
        cin>>aee[i];
        mp[aee[i]] = aee[i];
    }
    for(int i = 0;i<n;i++){
        if(!isdigit(arr[i][0])&&!isdigit(aee[i][0])){
            mp[arr[i]] = mp[aee[i]];
        }
    }
    for(int i = 0;i<n;i++){
        if(isdigit(arr[i][0])&&!isdigit(aee[i][0])){
            if(isdigit(mp[mp[aee[i]]][0])){
                if(mp[mp[aee[i]]]!=arr[i]){
                cout<<"NE\n";return 0;
                }mp[mp[aee[i]]] = arr[i];
            }else mp[mp[aee[i]]]  = arr[i];
        }if(!isdigit(arr[i][0])&&isdigit(aee[i][0])){
            if(isdigit(mp[arr[i]][0])){
                if(mp[mp[arr[i]]]!=aee[i]){
                cout<<"NE\n";return 0;
                }mp[mp[arr[i]]]  = aee[i];
            }else mp[mp[arr[i]]]  = aee[i];
        }
    }
    for(int i = 0;i<n;i++){
        if(isdigit(arr[i][0])&&isdigit(aee[i][0])){
            if(arr[i]!=aee[i]){
                cout<<"NE\n";
                return 0;
            }
        }
    }
    cout<<"DA\n";
    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 392 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 5 ms 716 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

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