#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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1092 KB |
Output is correct |
2 |
Correct |
0 ms |
1092 KB |
Output is correct |
3 |
Incorrect |
0 ms |
1092 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
1092 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
1092 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
1092 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
1092 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
1092 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
1092 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
1092 KB |
Output isn't correct |
11 |
Incorrect |
0 ms |
1092 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
1092 KB |
Output isn't correct |
13 |
Incorrect |
0 ms |
1092 KB |
Output isn't correct |
14 |
Incorrect |
4 ms |
1092 KB |
Output isn't correct |
15 |
Incorrect |
4 ms |
1092 KB |
Output isn't correct |
16 |
Incorrect |
4 ms |
1092 KB |
Output isn't correct |
17 |
Incorrect |
8 ms |
1092 KB |
Output isn't correct |
18 |
Incorrect |
8 ms |
1092 KB |
Output isn't correct |
19 |
Incorrect |
8 ms |
1092 KB |
Output isn't correct |
20 |
Incorrect |
12 ms |
1092 KB |
Output isn't correct |