oj.uz

답안 #470199

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
470199 2021-09-03T08:47:18 Z Karabasan Zamjena (COCI18_zamjena) C++17
0 / 70
 20 ms 4568 KB 
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define forcin for(int i=0;i<n;i++) scanf("%d",&dizi[i]);
#define forcout for(int i=0;i<n;i++) printf("%d ",dizi[i]);
#define ll long long

using namespace std;
int n,t;
string dizi[50005];
string dizi1[50005];
int diziyan[50005];
int dizi1yan[50005];
map<string,int> mp;
int main()
{
    fast;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        cin>>dizi[i];
    for(int i=0;i<n;i++)
        cin>>dizi1[i];
    for(int i=0;i<n;i++)
    {
        if(dizi[i][0]=='0'||dizi[i][0]=='1'||dizi[i][0]=='2'||dizi[i][0]=='3'||dizi[i][0]=='4'||dizi[i][0]=='5'||dizi[i][0]=='6'||dizi[i][0]=='7'||dizi[i][0]=='8'||dizi[i][0]=='9')
        {
            diziyan[i]=stoi(dizi[i]);
        }
    }
    for(int i=0;i<n;i++)
    {
        if(dizi1[i][0]=='0'||dizi1[i][0]=='1'||dizi1[i][0]=='2'||dizi1[i][0]=='3'||dizi1[i][0]=='4'||dizi1[i][0]=='5'||dizi1[i][0]=='6'||dizi1[i][0]=='7'||dizi1[i][0]=='8'||dizi1[i][0]=='9')
        {
            dizi1yan[i]=stoi(dizi1[i]);
        }
    }
    for(int i=0;i<n;i++)
    {
        if(diziyan[i]!=0&&dizi1yan[i]==0)
            {
                if(mp[dizi1[i]]!=0&&mp[dizi1[i]]!=diziyan[i])
                {
                    printf("NE");
                    return 0;
                }
                mp[dizi1[i]]=diziyan[i];
                dizi1[i]=dizi[i];
            }
        else if(diziyan[i]==0&&dizi1yan[i]!=0)
            {
                if(mp[dizi[i]]!=0&&mp[dizi[i]]!=dizi1yan[i])
                {
                    printf("NE");
                    return 0;
                }
                mp[dizi[i]]=dizi1yan[i];
                dizi[i]=dizi1[i];
            }
        else if(diziyan[i]==0&&dizi1yan[i]==0)
        {
            if(mp[dizi[i]]==0&&mp[dizi1[i]]==0)
                continue;
            else if (mp[dizi[i]]==0&&mp[dizi1[i]]!=0)
            {
                mp[dizi[i]]=mp[dizi1[i]];
                dizi[i]=dizi1[i];
            }
            else if(mp[dizi[i]]!=0&&mp[dizi1[i]]==0)
            {
                mp[dizi1[i]]=mp[dizi[i]];
                dizi1[i]=dizi[i];
            }
            else if(mp[dizi[i]]!=mp[dizi1[i]])
            {
                printf("NE");
                    return 0;
            }
            else if(mp[dizi[i]]==mp[dizi1[i]])
            {
                dizi[i]=to_string(mp[dizi[i]]);
                dizi1[i]=to_string(mp[dizi1[i]]);
            }
        }

    }
    for(int i=0;i<n;i++)
    {
        if(diziyan[i]!=0&&dizi1yan[i]==0)
            {
                if(mp[dizi1[i]]!=0&&mp[dizi1[i]]!=diziyan[i])
                {
                    printf("NE");
                    return 0;
                }
                mp[dizi1[i]]=diziyan[i];
                dizi1[i]=dizi[i];
            }
        else if(diziyan[i]==0&&dizi1yan[i]!=0)
            {
                if(mp[dizi[i]]!=0&&mp[dizi[i]]!=dizi1yan[i])
                {
                    printf("NE");
                    return 0;
                }
                mp[dizi[i]]=dizi1yan[i];
                dizi[i]=dizi1[i];
            }
        else if(diziyan[i]==0&&dizi1yan[i]==0)
        {
            if(mp[dizi[i]]==0&&mp[dizi1[i]]==0)
                continue;
            else if (mp[dizi[i]]==0&&mp[dizi1[i]]!=0)
            {
                mp[dizi[i]]=mp[dizi1[i]];
                dizi[i]=dizi1[i];
            }
            else if(mp[dizi[i]]!=0&&mp[dizi1[i]]==0)
            {
                mp[dizi1[i]]=mp[dizi[i]];
                dizi1[i]=dizi[i];
            }
            else if(mp[dizi[i]]!=mp[dizi1[i]])
            {
                printf("NE");
                    return 0;
            }
            else if(mp[dizi[i]]==mp[dizi1[i]])
            {
                dizi[i]=to_string(mp[dizi[i]]);
                dizi1[i]=to_string(mp[dizi1[i]]);
            }
        }

    }
    for(int i=0;i<n;i++)
    {
        if(dizi[i][0]=='0'||dizi[i][0]=='1'||dizi[i][0]=='2'||dizi[i][0]=='3'||dizi[i][0]=='4'||dizi[i][0]=='5'||dizi[i][0]=='6'||dizi[i][0]=='7'||dizi[i][0]=='8'||dizi[i][0]=='9')
        {
            diziyan[i]=stoi(dizi[i]);
        }
    }
    for(int i=0;i<n;i++)
    {
        if(dizi1[i][0]=='0'||dizi1[i][0]=='1'||dizi1[i][0]=='2'||dizi1[i][0]=='3'||dizi1[i][0]=='4'||dizi1[i][0]=='5'||dizi1[i][0]=='6'||dizi1[i][0]=='7'||dizi1[i][0]=='8'||dizi1[i][0]=='9')
        {
            dizi1yan[i]=stoi(dizi1[i]);
        }
    }
    for(int i=0;i<n;i++)
    {
        if(mp[dizi[i]]!=0)
            dizi[i]=to_string(mp[dizi[i]]);
        if(mp[dizi1[i]]!=0)
            dizi1[i]=to_string(mp[dizi1[i]]);
    }
    for(int i=0;i<n;i++)
    {
        if(diziyan[i]==0&&dizi1yan[i]==0)
            continue;
        else
        {
            if(dizi[i]!=dizi1[i])
            {
                printf("NE");
                return 0;
            }
        }
    }
    printf("DA");
    return 0;
}

Compilation message

zamjena.cpp: In function 'int main()':
zamjena.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3404 KB Output is correct
2 Incorrect 3 ms 3404 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3404 KB Output is correct
2 Incorrect 3 ms 3404 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Incorrect 2 ms 3404 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3384 KB Output is correct
2 Incorrect 2 ms 3404 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 3956 KB Output is correct
2 Incorrect 20 ms 4568 KB Output isn't correct
3 Halted 0 ms 0 KB -