oj.uz

Submission #991952

# Submission time Handle Problem Language Result Execution time Memory
991952 2024-06-03T12:50:26 Z nihon Zamjena (COCI18_zamjena) C++14
28 / 70
 19 ms 4700 KB 
#include <bits/stdc++.h>
#define N 50005
using namespace std;
struct elem
{
    string s,t;
}v[N];
int n,i,j;
map<string,string> m;
bool vrf()
{
    string s,t;
    for(i=1;i<=n;++i)
    {
        s=v[i].s;
        t=v[i].t;
        if(s[0]<='9' && t[0]<='9' && s!=t) return 0;
        else if(s[0]<='9' && t[0]>'9')
        {
            if(m.count(t) && m[t]!=s) return 0;
            m[t]=s;
        }
        else if(s[0]>'9' && t[0]<='9')
        {
            if(m.count(s) && m[s]!=t) return 0;
            m[s]=t;
        }
    }
    for(i=1;i<=n;++i)
    {
        s=v[i].s;
        t=v[i].t;
        if(s[0]>'9' && t[0]>'9')
        {
            if(m.count(t) && m.count(s) && m[t]!=m[s]) return 0;
            else if(m.count(t) && !m.count(s)) m[s]=m[t];
            else if(!m.count(t) && m.count(s)) m[t]=m[s];
        }
    }
    return 1;
}
int main()
{
    cin>>n;
    for(i=1;i<=n;++i)
    {
        cin>>v[i].s;
    }
    for(i=1;i<=n;++i)
    {
        cin>>v[i].t;
    }
    if(vrf()) cout<<"DA";
    else cout<<"NE";
    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 14.0

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

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3676 KB Output is correct
2 Correct 19 ms 4700 KB Output is correct
3 Incorrect 18 ms 3956 KB Output isn't correct
4 Halted 0 ms 0 KB -