oj.uz

Submission #154178

# Submission time Handle Problem Language Result Execution time Memory
154178 2019-09-18T18:31:41 Z BabinSinko Zamjena (COCI18_zamjena) C++14
42 / 70
 1000 ms 31776 KB 
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cctype>
#include <ctime>
#include <vector>
#include <string>

using namespace std;

int n, sol;
string s1[500003], s2[500003], ts;

int main(){
cin >> n;
for (int i= 0; i < n; i++){
	cin >> s1[i];
}
for (int i= 0; i < n; i++){
	cin >> s2[i];
	}
for (int i= 0; i < n; i++){
	if (s1[i][0] <= 57 and s2[i][0] <= 57){
		if (s1[i] != s2[i])
			sol = 1;
	}
	if (s1[i][0] <= 57 and s2[i][0] > 57){
		ts = s2[i];
		for (int j = 0; j < n; j++){
			if (s1[j] == ts){
				s1[j] = s1[i];
			}
			if (s2[j] == ts){
				s2[j] = s1[i];
			}
		}
	}
	if (s1[i][0] > 57 and s2[i][0] <= 57){
		ts = s1[i];
		for (int j = 0; j < n; j++){
			if (s1[j] == ts){
				s1[j] = s2[i];
			}
			if (s2[j] == ts){
				s2[j] = s2[i];
			}
		}
	}
}
for (int i= 0; i < n; i++){
	if (s1[i][0] <= 57 and s2[i][0] <= 57){
		if (s1[i] != s2[i])
			sol = 1;
	}
	if (s1[i][0] <= 57 and s2[i][0] > 57){
		ts = s2[i];
		for (int j = 0; j < n; j++){
			if (s1[j] == ts){
				s1[j] = s1[i];
			}
			if (s2[j] == ts){
				s2[j] = s1[i];
			}
		}
	}
	if (s1[i][0] > 57 and s2[i][0] <= 57){
		ts = s1[i];
		for (int j = 0; j < n; j++){
			if (s1[j] == ts){
				s1[j] = s2[i];
			}
			if (s2[j] == ts){
				s2[j] = s2[i];
			}
		}
	}
}
for (int i= 0; i < n; i++){
	if (s1[i] != s2[i] and s1[i][0] <= 57 and s2[i][0] <= 57){
		sol = 1;
	}
}
if (sol == 1){
	cout << "NE";
}else{
	cout << "DA";
}
return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 31608 KB Output is correct
2 Correct 36 ms 31632 KB Output is correct
3 Correct 35 ms 31736 KB Output is correct
4 Correct 31 ms 31608 KB Output is correct
5 Correct 38 ms 31684 KB Output is correct

Subtask #2
14.0 / 14.0

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

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 31736 KB Output is correct
2 Correct 38 ms 31560 KB Output is correct
3 Correct 33 ms 31736 KB Output is correct
4 Correct 37 ms 31608 KB Output is correct
5 Correct 31 ms 31608 KB Output is correct
6 Incorrect 36 ms 31608 KB Output isn't correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 31608 KB Output is correct
2 Correct 36 ms 31608 KB Output is correct
3 Correct 92 ms 31736 KB Output is correct
4 Correct 52 ms 31736 KB Output is correct
5 Correct 107 ms 31608 KB Output is correct
6 Correct 95 ms 31648 KB Output is correct

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 31776 KB Output is correct
2 Execution timed out 1069 ms 31736 KB Time limit exceeded
3 Halted 0 ms 0 KB -