oj.uz

Submission #472415

# Submission time Handle Problem Language Result Execution time Memory
472415 2021-09-13T14:00:16 Z Ahmed_Solyman Zamjena (COCI18_zamjena) C++14
28 / 70
 63 ms 4988 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

bool isNum(string s){
    return (s[0]>='1' && s[0]<='9');
}
int main()
{
    ll n;cin>>n;
    vector<string>a(n),b(n);
    for(auto &i:a)cin>>i;
    for(auto &i:b)cin>>i;
    bool v=1;
    map<string,string>mp;
    map<string,bool>vis,t;
    map<string,string>u;
    for(ll i=0;i<n;i++){
        if(isNum(a[i]) && !isNum(b[i])){
            mp[b[i]]=a[i];
        }
        else if(!isNum(a[i]) && isNum(b[i])){
            mp[a[i]]=b[i];
        }
    }
    for(ll i=0;i<n;i++){
        if(isNum(a[i]) && isNum(b[i])){
            v&=(a[i]==b[i]);
        }
        else if(isNum(a[i])){
            if(mp[b[i]].empty()){
                mp[b[i]]=a[i];
            }
            v&=(a[i]==mp[b[i]]);
        }
        else if(isNum(b[i])){
            if(mp[a[i]].empty()){
                mp[a[i]]=b[i];
            }
            v&=(mp[a[i]]==b[i]);
        }
        else{
            if(mp[a[i]].empty()){
                mp[a[i]]=mp[b[i]];
            }
            else if(mp[b[i]].empty()){
                mp[b[i]]=mp[a[i]];
            }
            v&=(mp[a[i]]==mp[b[i]]);
        }
    }
    if(v){
        cout<<"DA";
    }
    else{
        cout<<"NE";
    }
    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 1 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 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 292 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 1 ms 204 KB Output is correct
4 Incorrect 1 ms 204 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1572 KB Output is correct
2 Correct 34 ms 2892 KB Output is correct
3 Incorrect 63 ms 4988 KB Output isn't correct
4 Halted 0 ms 0 KB -