oj.uz

답안 #464619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
464619 2021-08-13T14:24:36 Z Sarah_Mokhtar Zamjena (COCI18_zamjena) C++14
14 / 70
 16 ms 844 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define read freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define LESSGO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll N=1e6+10,M=505,OO=1e16,mod=1e9+7;
int n,cur;
string s;
vector<int>a,b;
map<string,int>idx;
map<int,int>val;
bool isDigit(char c){
    return c>='0'&&c<='9';
}
int main(){
    cin>>n;
    for(int i=0;i<n;++i){
        cin>>s;
        if(isDigit(s[0])) a.push_back(stoi(s));
        else{
            if(idx[s]) a.push_back(idx[s]);
            else{
                idx[s]=++cur;
                idx[s]*=-1;
                a.push_back(idx[s]);
            }
        }
    }
    for(int i=0;i<n;++i){
        cin>>s;
        if(isDigit(s[0])) b.push_back(stoi(s));
        else{
            if(idx[s]) b.push_back(idx[s]);
            else{
                idx[s]=++cur;
                idx[s]*=-1;
                b.push_back(idx[s]);
            }
        }
    }
    bool valid=1;
    for(int i=0;i<n;++i){
        if(a[i]>0&&b[i]>0){
            if(a[i]!=b[i]){
                valid=0;
                break;
            }
        }
        if(a[i]>0&&b[i]<0){
            if(!(val[b[i]]==0||val[b[i]]==a[i])){
                valid=0;
                break;
            }else val[b[i]]=a[i];
        }
        if(a[i]<0&&b[i]>0){
            if(!(val[a[i]]==0||val[a[i]]==b[i])){
                valid=0;
                break;
            }else val[a[i]]=b[i];
        }
    }
    puts(valid?"DA":"NE");
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 204 KB Output is correct

Subtask #2
0 / 14.0

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

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 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 0 ms 204 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 14.0

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