oj.uz

답안 #1113156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1113156 2024-11-16T01:05:17 Z jay22 Vlak (COCI20_vlak) C++17
0 / 70
 9 ms 21836 KB 
#include <iostream>
#include <cstring>

const int LEN = 200'001;

int N, M, dp[LEN];
int idx, g[LEN][26], t[LEN];
char S[LEN];

int dfs(int k, int l) {
	int ret = 1;
	for (int i = 0; i < 26; ++i) {
		if (~g[k][i] && t[g[k][i]] & 1 << l)
			ret &= !dfs(g[k][i], !l);
	}
	return ret;
}

int main() {
	std::cin.tie(0)->sync_with_stdio(0);
	memset(g, -1, sizeof g);
	for (int b = 1; b <= 2; ++b) {
		std::cin >> N;
		for (int i = 0; i < N; ++i) {
			std::cin >> S;
			for (int j = 0, k = 0, c; S[j]; ++j) {
				c = S[j] - 'a';
				if (!~g[k][c]) g[k][c] = ++idx;
				k = g[k][c];
				t[k] |= b;
			}
		}
	}
	std::cout << (dfs(0, 0) ? "Emlija" : "Nina");
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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