oj.uz

Submission #85335

# Submission time Handle Problem Language Result Execution time Memory
85335 2018-11-19T11:01:54 Z 314rate Zamjena (COCI18_zamjena) C++14
70 / 70
 560 ms 8680 KB 
#include <bits/stdc++.h>

using namespace std;

const int N=50000+5;

int n;
string a[N];
string b[N];

inline bool nr(string x)
{
    if('0'<=x[0] && x[0]<='9')
    {
        return 1;
    }
    else
    {
        return 0;
    }
}

inline void e(string a)
{
    cout<<a<<"\n";
    exit(0);
}

map<string,string>h;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    for(int i=1;i<=n;i++)
    {
        cin>>b[i];
    }
    for(int k=1;k<=10;k++){
    for(int i=1;i<=n;i++)
    {
        if(nr(a[i]) && nr(b[i]))
        {
            if(a[i]!=b[i])
            {
                e("NE");
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int k=1;k<=2;k++)
        {
            if(nr(a[i])==1 && nr(b[i])==0)
            {
                if(h[b[i]]=="" || h[b[i]]==a[i])
                {
                    h[b[i]]=a[i];
                }
                else
                {
                    e("NE");
                }
            }
            swap(a[i],b[i]);
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(nr(a[i])==0 && h[a[i]]!="")
        {
            a[i]=h[a[i]];
        }
        if(nr(b[i])==0 && h[b[i]]!="")
        {
            b[i]=h[b[i]];
        }
    }
    }
    for(int i=1;i<=n;i++)
    {
   ///     cout<<a[i]<<" < - > "<<b[i]<<"\n";
    }
    e("DA");
    return 0;
}
/**

5
x 3 x y 3
x y 2 z 3

**/

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3780 KB Output is correct
2 Correct 7 ms 3780 KB Output is correct
3 Correct 9 ms 3920 KB Output is correct
4 Correct 13 ms 3920 KB Output is correct
5 Correct 15 ms 3980 KB Output is correct
6 Correct 8 ms 3980 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 4304 KB Output is correct
2 Correct 86 ms 5072 KB Output is correct
3 Correct 115 ms 6368 KB Output is correct
4 Correct 62 ms 6496 KB Output is correct
5 Correct 560 ms 8680 KB Output is correct
6 Correct 223 ms 8680 KB Output is correct