Submission #5417

#TimeUsernameProblemLanguageResultExecution timeMemory
5417Qwaz성질 급한 지학이 (IZhO13_crazy)C++98
10 / 100
12 ms1092 KiB
#include <cstdio>

const int MAX = 1020;

int n, data[MAX];

void input(){
	scanf("%d", &n);

	int i;
	for(i = 0; i<n; i++)
		scanf("%d", &data[i]);
}

bool empty[MAX];

void solve(){
	int ans = -1;

	int i, j;
	for(i = 1; i<=n; i++){
		for(j = 1; j<=n; j++)
			empty[j] = 1;
		empty[data[0]] = 0;

		int num = 1;
		for(j = 1; j<=n; j++){
			if(i == j) continue;

			if(empty[j] && j != data[num]){
				break;
			}
			empty[data[num]] = 0;
			num++;
		}

		if(j > n){
			if(ans == -1) ans = i;
			else {
				puts("0");
				return;
			}
		}
	}

	puts(ans == -1 ? "0" : "1");
}

int main(){
	int numCase;
	for(scanf("%d", &numCase); numCase--;){
		input();

		solve();
	}

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...