oj.uz

Submission #855710

# Submission time Handle Problem Language Result Execution time Memory
855710 2023-10-01T16:49:44 Z vjudge1 Zamjena (COCI18_zamjena) C++17
14 / 70
 2 ms 1116 KB 
#include <bits/stdc++.h>
using namespace std;
#define sp << " " << 
#define int long long
#define vi vector<int>
#define pb push_back
#define F(xxx,yyy) for (int xxx=1;xxx<=yyy;xxx++)
#define pii pair<int,int>
#define all(x) x.begin()+1,x.end()
const int N = 4e5+1;

bool is_number(string& s) {
	for (auto it : s) if (it < '0' || it > '9') return false;
	return true;
}

void solve() {
	int n;
	cin >> n;
	vector<string> a(n+1),b(n+1);
	F(i,n) cin >> a[i];
	F(i,n) cin >> b[i];
	map<string,string> mp;
	bool fl = true;
	for (int i=1;i<=n;i++) {
		if (is_number(a[i]) && is_number(b[i])) {
			if (a[i] == b[i]) continue;
			fl = false;
			break;
		}
		else if (is_number(a[i])) {
			if (mp.count(b[i]) && mp[b[i]] == a[i]) continue;
			else if (mp.count(b[i])) {
				fl = 0;
				break;
			}
			else mp[b[i]] = a[i];		
		}
		else if (is_number(b[i])) {
			if (mp.count(a[i]) && mp[a[i]] == b[i]) continue;
			else if (mp.count(a[i])) {
				fl = 0;
				break;
			}
			else mp[a[i]] = b[i];
		}
		else {
			int h1 = mp.count(a[i]);
			int h2 = mp.count(b[i]);
			if (!h1 && !h2) continue;
			else if (!h1 && h2) mp[a[i]] = b[i];
			else if (!h2 && h1) mp[b[i]] = a[i];
			else {
				if (mp[a[i]] != mp[b[i]]) {
					fl = 0;
					break;
				}
			}
		}
	} 
	cout << ((fl)?"DA\n":"NE\n") << endl;
}     	
                                
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t; 
    while (t --> 0) solve();
}

Subtask #1
14.0 / 14.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 14.0

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

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1116 KB Output isn't correct
2 Halted 0 ms 0 KB -