Submission #68020303

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
int getnum(void) {
  char buf[32];
  int res;
  if (fgets(buf, sizeof(buf), stdin) == NULL) return -1;
  if (sscanf(buf, "%d", &res) != 1) return -1;
  return res;
}
int N;
char S[(1 << 18) + 222];
int visited[(1 << 18) + 222];
int q[(1 << 18) + 222];
int main(void) {
  int T, tc;
  T = getnum();
  if (T < 0) return 1;
  for (tc = 1; tc <= T; tc++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int getnum(void) {
	char buf[32];
	int res;
	if (fgets(buf, sizeof(buf), stdin) == NULL) return -1;
	if (sscanf(buf, "%d", &res) != 1) return -1;
	return res;
}

int N;
char S[(1 << 18) + 222];

int visited[(1 << 18) + 222];
int q[(1 << 18) + 222];

int main(void) {
	int T, tc;
	T = getnum();
	if (T < 0) return 1;
	for (tc = 1; tc <= T; tc++) {
		int qs = 0, qe = 0;
		N = getnum();
		if (N < 0) return 1;
		if (fgets(S + 1, sizeof(S) - 1, stdin) == NULL) return 1;
		visited[0] = tc;
		q[qe++] = 0;
		while (qs < qe) {
			int cur = q[qs++];
			int i;
			for (i = 0; i < N; i++) {
				int next = cur | (1 << i);
				if (S[next] != '1' && visited[next] != tc) {
					visited[next] = tc;
					q[qe++] = next;
				}
			}
		}
		puts(visited[(1 << N) - 1] == tc ? "Yes" : "No");
	}
	return 0;
}

Submission Info

Judge Result