oj.uz

Submission #472233

# Submission time Handle Problem Language Result Execution time Memory
472233 2021-09-13T09:58:01 Z BidoTeima Zamjena (COCI18_zamjena) C++17
28 / 70
 56 ms 4688 KB 
/// isA AC
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void ACPLS(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
#define tc int tttttt;cin>>tttttt;while(tttttt--)
#define sumrange(l,r,arr) (l==0?arr[r]:arr[r]-arr[l-1])
bool isint(const string& s){
    bool ok=1;
    for(char i:s)
        ok&=isdigit(i);
    return ok;
}
bool isseq(const string& s){
    return !isint(s);
}
int main(){
    ACPLS();
    int n;
    cin>>n;
    string a[n],b[n];
    for(auto&i:a)cin>>i;
    for(auto&i:b)cin>>i;
    map<string,string>mp{};
    for(int i = 0; i < n; i++){
        if(isint(b[i])&&isseq(a[i])){
            mp[a[i]]=b[i];
        }
        else if(isint(a[i])&&isseq(b[i])){
            mp[b[i]]=a[i];
        }
    }
    bool ok = 1;
    for(int i = 0; i < n; i++){
        if(isint(a[i])&&isint(b[i])){
            ok&=a[i]==b[i];
        }
        else if(isint(a[i])&&isseq(b[i])){
            if(mp[b[i]].empty())
                mp[b[i]]=a[i];
            ok&=mp[b[i]]==a[i];
        }
        else if(isint(b[i])&&isseq(a[i])){
            if(mp[a[i]].empty())
                mp[a[i]]=b[i];
            ok&=mp[a[i]]==b[i];
        }
       else if(isseq(a[i])&&mp[a[i]].empty()){
            mp[a[i]]=mp[b[i]];
            ok&=mp[a[i]]==mp[b[i]];
        }
        else if(isseq(b[i])&&mp[b[i]].empty()){
            mp[b[i]]=mp[a[i]];
            ok&=mp[a[i]]==mp[b[i]];
        }
        else ok&=mp[a[i]]==mp[b[i]];
    }
    cout<<(ok?"DA":"NE");
}

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 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 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 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 #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 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 316 KB Output isn't correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 4 ms 716 KB Output is correct
4 Incorrect 4 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 12 ms 1484 KB Output is correct
2 Correct 25 ms 2928 KB Output is correct
3 Incorrect 56 ms 4688 KB Output isn't correct
4 Halted 0 ms 0 KB -