QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #308176 | #8018. 染色 | Ryan123 | 0 | 532ms | 48024kb | C++14 | 8.9kb | 2024-01-19 17:37:49 | 2024-01-19 17:37:50 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N = 2049;
bool a[N][N];
bool g[N][N];
bool st[N], st2[N];
bitset<2 * N> f[N * 2];
int n, nn;
vector<pair<int, int>> ans;
void change(int x, int y){
g[x][y] ^= 1;
if(x == nn - 1)g[0][y] ^= 1;
else g[x + 1][y] ^= 1;
if(x == 0)g[nn - 1][y] ^= 1;
else g[x - 1][y] ^= 1;
if(y == nn - 1)g[x][0] ^= 1;
else g[x][y + 1] ^= 1;
if(y == 0)g[x][nn - 1] ^= 1;
else g[x][y - 1] ^= 1;
}
int main(){
scanf("%d", &n);
nn = (1 << n);
for(int i = 0; i < nn; i ++){
for(int j = 0; j < nn; j ++){
char s;
scanf(" %c", &s);
if(s == '1')g[i][j] = 1;
else g[i][j] = 0;
}
}
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
memcpy(a, g, sizeof(a));
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(a[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
for(int i = 1; i < nn; i ++){
for(int j = 0; j < nn; j ++){
if(g[i - 1][j])change(i, j);
}
}
for(int i = 0; i < nn; i ++){
for(int j = 0; j < nn; j ++){
if(g[i][j])printf("1 ");
else printf("0 ");
}
puts("");
}
puts("");
memcpy(st, g[nn - 1], sizeof(st));
memcpy(st2, g[0], sizeof(st2));
memset(g, 0, sizeof(g));
change(0, 0);
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
for(int i = 1; i < nn; i ++){
for(int j = 0; j < nn; j ++){
if(g[i - 1][j])change(i, j);
}
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
}
for(int i = 0; i < nn; i ++){
for(int j = 0; j < nn; j ++){
if(!g[nn - 1][j])continue;
int t = (i + j) % nn;
f[t + nn][i] = 1;
}
for(int j = 0; j < nn; j ++){
if(!g[0][j])continue;
int t = (i + j) % nn;
f[t][i] = 1;
}
}
memset(g, 0, sizeof(g));
change(nn - 1, 0);
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
for(int i = 1; i < nn; i ++){
for(int j = 0; j < nn; j ++){
if(g[i - 1][j])change(i, j);
}
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
}
// for(int i = 0; i < nn; i ++){
// f[i][i] = f[i][i] ^ 1;
// if(i == 0)f[i][nn - 1] = f[i][nn - 1] ^ 1;
// else f[i][i - 1] = f[i][i - 1] ^ 1;
// if(i == nn - 1)f[i][0] = f[i][0] ^ 1;
// else f[i][i + 1] = f[i][i + 1] ^ 1;
// // f[i][nn] = st2[i];
// }
for(int i = 0; i < nn; i ++){
for(int j = 0; j < nn; j ++){
if(!g[nn - 1][j])continue;
int t = (i + j) % nn;
f[t + nn][i + nn] = 1;
}
for(int j = 0; j < nn; j ++){
if(!g[0][j])continue;
int t = (i + j) % nn;
f[t][i + nn] = 1;
}
}
for(int i = 0; i < nn; i ++)f[i][2 * nn] = st2[i];
for(int i = 0; i < nn; i ++)f[i + nn][2 * nn] = st[i];
// for(int i = 0; i < 2 * nn; i ++){
// for(int j = 0; j <= 2 * nn; j ++){
// if(f[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
// puts("");
int cnt = -1;
for(int i = 0; i < 2 * nn; i ++){
int t = -1;
for(int j = cnt + 1; j < 2 * nn; j ++){
if(f[j][i]){
t = j;
break;
}
}
if(t == -1)continue;
cnt ++;
swap(f[t], f[cnt]);
for(int j = cnt + 1; j < 2 * nn; j ++){
if(f[j][i])f[j] ^= f[cnt];
}
// for(int i = 0; i < 2 * nn; i ++){
// for(int j = 0; j <= 2 * nn; j ++){
// if(f[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
// puts("");
}
if(cnt < 2 * nn - 1){
cerr << -1 << endl;
return 0;
}
// for(int i = 0; i < 2 * nn; i ++){
// for(int j = 0; j <= 2 * nn; j ++){
// if(f[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
// puts("");
for(int i = 0; i <= cnt; i ++){
for(int j = i - 1; j >= 0; j --){
if(f[j][i])f[j] ^= f[i];
}
}
// for(int i = 0; i < 2 * nn; i ++){
// for(int j = 0; j <= 2 * nn; j ++){
// if(f[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
// puts("");
// memset(g, 0, sizeof(g));
// memcpy(g, a, sizeof(g));
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
// for(int i = 0; i < nn; i ++){
// if(f[i][2 * nn])change(0, i);
// }
// for(int i = 0; i < nn; i ++){
// if(f[i + nn][2 * nn])change(nn - 1, i);
// }
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
// for(int i = 1; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i - 1][j])change(i, j), ans.push_back({i, j});
// }
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
// }
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
memcpy(g, a, sizeof(a));
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
for(int i = 0; i < nn; i ++){
if(f[i][2 * nn])change(0, i), ans.push_back({0, i});
}
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
for(int i = 0 ; i < nn; i ++){
if(f[i + nn][2 * nn])change(nn - 1, i), ans.push_back({nn - 1, i});
}
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
for(int i = 1; i < nn - 1; i ++){
for(int j = 0; j < nn; j ++){
if(g[i - 1][j])change(i, j), ans.push_back({i, j});
}
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
}
printf("%d\n", (int)ans.size());
for(auto [u, v] : ans){
printf("%d %d\n", u, v);
}
// for(int i = 0; i < nn; i ++){
// for(int j = 0; j < nn; j ++){
// if(g[i][j])printf("1 ");
// else printf("0 ");
// }
// puts("");
// }
// puts("");
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 3ms
memory: 13956kb
input:
2 0 0 1 1 1 0 1 0 0 0 0 0 1 1 1 0
output:
1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 7 0 0 3 1 3 2 3 3 1 0 1 3 2 1
result:
wrong answer wa
Test #2:
score: 0
Wrong Answer
time: 0ms
memory: 13528kb
input:
2 0 0 0 1 1 0 0 0 1 1 0 1 1 0 1 1
output:
0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 8 0 0 3 0 3 1 3 3 1 3 2 0 2 2 2 3
result:
wrong answer wa
Test #3:
score: 0
Wrong Answer
time: 0ms
memory: 13632kb
input:
2 1 1 1 0 0 1 0 0 1 0 1 0 0 1 0 1
output:
0 1 0 0 0 0 0 0 0 0 0 0 1 0 1 1 8 0 1 0 3 3 3 1 0 1 2 2 0 2 2 2 3
result:
wrong answer wa
Test #4:
score: 0
Wrong Answer
time: 0ms
memory: 12724kb
input:
2 1 0 1 1 1 0 1 0 0 1 1 0 1 1 1 0
output:
1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 0 10 0 1 0 3 3 0 3 3 1 1 1 2 1 3 2 0 2 1 2 3
result:
wrong answer wa
Test #5:
score: 0
Wrong Answer
time: 0ms
memory: 12944kb
input:
4 0 0 1 1 0 1 1 0 0 0 0 0 0 0 1 1 0 1 1 0 1 0 0 1 0 1 1 1 1 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 1 1 0 1 0 0 0 1 1 0 0 0 0 0 1 1 1 1 1 0 1 0 0 0 1 1 1 0 1 1 1 1 0 1 0 0 1 1 1 1 1 0 0 1 1 0 0 1 1 1 0 1 1 1 0 1 0 1 1 0 1 0 1 1 1 0 0 1 1 1 1 0 1 1 1 0 1 1 0 0 0 1 1 0 0 0 0 1 1 1 0 1 1 0 1 1 0 0 1 0 0 1 0 1 ...
output:
1 0 0 0 1 0 1 1 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
result:
wrong answer wa
Test #6:
score: 0
Wrong Answer
time: 0ms
memory: 12024kb
input:
4 1 0 0 0 1 0 1 0 0 1 0 0 1 1 1 1 1 0 0 1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 0 1 0 1 0 0 0 1 1 1 1 0 0 1 0 1 0 0 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 0 0 0 1 0 1 0 0 0 0 1 1 1 0 0 0 0 1 1 1 0 0 0 1 1 0 0 1 1 1 0 1 0 0 0 1 0 1 0 1 1 0 1 1 0 0 0 0 1 1 0 0 1 1 1 1 1 1 0 0 0 0 1 0 1 0 0 1 0 1 0 0 0 0 ...
output:
0 0 0 0 0 1 0 1 1 1 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
result:
wrong answer wa
Test #7:
score: 0
Wrong Answer
time: 3ms
memory: 13372kb
input:
4 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 0 1 0 0 0 0 1 0 1 0 1 0 1 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 1 0 1 0 0 1 0 1 1 0 1 1 0 0 0 0 0 1 0 1 1 0 0 0 1 0 1 1 1 1 0 1 0 0 1 0 0 0 1 1 0 0 1 1 1 1 1 1 0 1 1 1 0 1 1 0 1 0 0 1 0 0 1 1 1 0 1 0 0 1 1 1 1 0 0 1 0 0 1 1 1 1 0 ...
output:
1 0 1 1 0 1 0 0 1 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
result:
wrong answer wa
Test #8:
score: 0
Wrong Answer
time: 2ms
memory: 13692kb
input:
7 1 1 1 1 1 1 0 0 0 1 1 1 0 1 1 1 1 1 0 0 0 1 1 1 0 1 1 1 1 1 1 0 1 0 0 0 0 1 1 1 0 0 1 1 1 1 0 0 1 0 0 1 1 0 1 0 1 1 1 1 1 0 0 1 1 0 0 0 0 0 0 0 1 0 1 0 0 0 0 1 1 1 1 1 0 1 0 0 1 0 1 1 0 0 1 0 1 0 1 0 1 0 1 1 0 0 1 0 0 1 1 1 1 1 1 0 0 0 0 1 0 0 1 0 0 0 0 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 0 1 0 1 0 0 1 ...
output:
0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 1 0 0 0 0 0 0 1 0 0 0 1 0 1 1 0 0 1 0 0 1 1 0 0 0 0 1 1 1 1 0 1 0 1 1 0 0 0 1 1 1 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 0 0 0 0 1 1 1 0 0 1 1 1 1 1 1 0 1 0 0 0 1 0 0 0 1 0 1 1 0 1 0 0 1 0 0 1 0 1 1 0 0 1 0 0 1 1 0 1 0 1 1 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
result:
wrong answer wa
Test #9:
score: 0
Wrong Answer
time: 5ms
memory: 13172kb
input:
7 1 1 0 1 0 0 1 0 0 0 0 1 1 1 0 0 1 1 1 0 0 1 1 0 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 0 1 0 0 0 0 0 1 0 0 0 1 1 1 0 1 0 0 0 1 0 1 0 1 0 0 0 0 1 1 1 0 0 0 0 1 1 0 1 0 0 0 0 1 0 1 0 0 1 1 0 0 1 0 0 1 1 0 1 1 1 1 1 0 0 0 1 1 0 0 0 1 1 1 1 0 1 1 1 1 0 1 1 0 1 0 1 1 1 1 0 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 1 0 0 1 ...
output:
0 0 1 0 0 0 0 0 1 0 1 1 0 0 0 1 0 1 1 0 0 1 0 0 0 1 1 0 0 0 0 0 0 1 1 0 1 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 1 1 1 0 1 0 0 0 0 1 1 0 0 0 0 0 1 0 1 1 0 1 0 0 1 0 0 0 0 0 1 1 1 1 1 1 1 1 0 1 1 1 0 0 1 1 0 0 1 1 0 1 0 0 0 0 1 0 0 1 0 1 1 0 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
result:
wrong answer wa
Test #10:
score: 0
Wrong Answer
time: 5ms
memory: 13632kb
input:
7 1 0 1 1 1 0 0 0 1 1 0 0 1 1 0 0 0 1 0 1 1 0 1 0 0 1 0 1 1 1 1 1 1 0 1 1 1 1 1 0 0 0 1 0 1 0 1 1 1 1 0 1 1 1 0 1 0 0 1 0 1 0 1 0 0 1 0 1 1 1 1 0 1 1 0 0 1 1 1 0 1 1 1 0 0 1 1 0 0 0 0 1 1 0 0 1 1 0 1 1 1 0 0 0 0 0 0 0 1 1 0 0 0 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 1 1 1 0 1 1 0 1 1 0 0 1 1 1 0 0 0 0 ...
output:
1 1 1 1 0 1 0 0 0 1 0 0 1 0 0 1 0 1 0 1 0 1 1 1 1 1 1 1 1 1 0 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 0 1 1 1 1 0 1 1 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 0 1 0 1 1 1 1 0 0 0 1 1 0 0 1 0 1 1 0 1 1 0 0 1 0 0 1 0 0 0 1 0 1 1 0 0 0 0 1 1 0 0 0 0 1 0 1 1 0 1 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
result:
wrong answer wa
Test #11:
score: 0
Wrong Answer
time: 499ms
memory: 48024kb
input:
11 1 1 0 1 1 1 1 0 0 1 0 0 1 0 0 0 1 0 1 1 1 0 0 0 1 1 1 1 0 1 0 1 1 0 0 0 0 0 1 1 0 0 1 0 0 0 1 0 0 1 1 0 1 0 1 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 1 0 1 0 0 1 1 1 1 1 0 0 0 0 1 0 1 0 1 1 0 1 1 0 0 0 0 1 0 0 1 0 1 1 1 0 0 0 0 1 1 1 1 0 1 1 1 1 0 0 1 0 1 0 1 0 0 1 1 1 0 0 0 0 1 0 0 0 0 1 0 1 1 0 1 1 0 1...
output:
1 1 0 0 0 1 1 1 0 0 1 0 0 1 1 1 0 1 0 1 0 1 0 0 0 0 0 1 1 0 0 1 0 1 1 0 0 1 0 0 1 1 0 0 1 1 1 0 0 1 0 1 1 0 0 0 0 1 1 0 0 1 1 0 1 0 1 1 0 0 1 0 1 0 0 1 1 1 0 1 0 0 1 0 1 0 0 0 1 0 0 1 1 0 0 1 0 0 0 1 1 0 0 0 0 1 1 1 1 0 0 1 0 0 1 0 0 0 1 0 1 0 1 0 0 0 0 1 1 1 1 1 0 0 0 1 1 1 1 0 0 1 0 1 0 1 1 0 0 0 ...
result:
wrong answer wa
Test #12:
score: 0
Wrong Answer
time: 530ms
memory: 47520kb
input:
11 1 1 1 1 0 0 0 0 1 1 1 1 0 1 1 0 0 1 0 0 0 0 1 0 1 1 1 0 0 0 1 1 0 0 0 1 1 1 0 0 0 0 1 0 0 0 1 0 0 1 0 0 1 0 1 1 1 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 1 1 0 0 0 0 0 1 1 0 1 1 1 0 0 1 1 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 1 0 0 0 1 1 1 1 0 0 1 0 1 0 0 1 1 1 1 1 1 0 1 1 0 0 0 0 1 1 1 0 0 1 0 1 0 0 0 1 1...
output:
1 0 0 1 0 1 0 1 1 1 0 0 1 1 0 1 1 0 0 0 0 0 0 1 0 1 1 1 0 1 1 1 1 1 1 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 0 0 1 0 1 0 0 0 1 1 0 1 0 0 0 0 0 1 1 1 0 1 1 0 1 0 0 0 0 1 0 0 1 1 1 0 1 1 0 1 0 0 1 0 0 1 0 1 1 0 0 0 1 1 1 1 0 1 0 0 1 0 1 1 0 1 1 0 0 1 1 1 0 1 0 0 0 0 1 1 1 1 0 0 0 1 1 0 0 0 0 0 1 1 1 0 0 0 0 1 ...
result:
wrong answer wa
Test #13:
score: 0
Wrong Answer
time: 525ms
memory: 30852kb
input:
11 1 0 1 0 1 0 0 0 0 1 1 1 1 1 1 0 0 1 1 0 1 1 0 1 0 0 0 1 1 1 1 1 0 1 0 1 0 1 1 1 1 0 1 1 0 1 1 1 1 1 0 0 1 0 1 0 0 1 0 0 0 0 0 0 1 0 1 1 0 0 0 1 1 0 1 1 1 1 0 1 1 1 0 0 1 1 1 0 0 1 0 0 0 1 0 1 0 1 1 0 1 1 1 0 1 1 0 0 1 1 1 1 0 1 1 0 1 0 1 1 0 0 0 1 1 0 0 0 0 0 0 1 0 1 0 0 0 1 1 0 0 0 1 0 0 1 0 1 0...
output:
1 1 0 1 0 0 0 0 0 1 1 0 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 0 0 1 0 1 0 0 0 1 0 1 1 0 1 1 1 1 0 1 0 1 1 0 0 0 1 0 0 0 1 1 0 0 0 1 0 1 1 1 1 0 0 1 1 1 0 1 1 0 0 0 1 1 1 0 0 1 0 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 1 1 0 1 0 0 0 0 1 0 0 1 1 1 1 0 0 1 1 1 0 1 0 0 1 1 0 1 0 1 0 0 1 0 1 0 1 1 0 1 1 1 0 0 0 1 1 0 ...
result:
wrong answer wa
Test #14:
score: 0
Wrong Answer
time: 519ms
memory: 46776kb
input:
11 1 1 0 1 1 1 0 0 1 0 1 0 1 1 0 0 0 0 1 0 1 0 1 1 1 0 1 0 1 0 1 0 1 0 1 1 0 0 0 0 1 1 0 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 0 0 1 1 0 0 0 1 0 0 0 1 1 0 1 0 1 0 1 1 1 0 0 0 0 1 1 1 0 1 0 0 0 1 1 0 1 1 1 1 0 1 1 0 0 0 0 1 1 1 0 0 0 0 0 1 0 0 0 1 1 1 0 1 0 0 1 0 0 0 0 0 0 1 1 0 1 0 0 1 0 0 1 0 0 0 0 1...
output:
1 1 1 0 1 0 0 0 1 1 0 0 1 0 1 0 0 1 0 1 0 1 0 0 0 1 1 1 1 0 1 0 0 1 1 0 0 1 1 0 1 1 1 0 0 1 0 1 1 1 1 0 0 0 0 0 1 1 1 1 0 0 0 1 1 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 1 1 0 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 1 1 0 1 0 1 0 1 1 1 0 0 0 0 0 1 0 1 1 1 1 0 0 1 1 0 0 1 0 0 0 1 0 0 1 1 1 0 0 0 0 1 1 1 0 1 1 0 0 0 0 ...
result:
wrong answer wa
Test #15:
score: 0
Wrong Answer
time: 523ms
memory: 47872kb
input:
11 1 1 0 0 0 0 1 0 1 1 1 0 0 1 1 0 1 1 1 1 0 0 0 0 0 1 0 0 1 1 0 1 1 0 0 0 1 0 1 1 0 0 1 0 1 0 0 0 0 1 1 1 1 1 1 0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 1 1 1 0 1 1 0 1 1 0 1 1 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 1 1 1 0 0 0 1 0 1 1 1 1 0 0 0 1 1 0 1 1 1 0 1 1 1 1 1 1 0 0 0 1 0 1 1 0 1 1 1 1 1 1 0 1 0 0...
output:
1 1 1 0 1 1 1 0 1 1 1 0 1 1 0 1 1 1 1 0 0 0 1 1 1 1 1 1 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 1 0 1 1 0 1 1 0 0 0 0 1 0 1 0 0 1 1 0 0 1 0 0 0 1 0 1 0 1 1 0 1 1 0 1 1 0 1 1 0 0 0 1 0 0 1 0 1 1 1 1 1 1 0 0 1 1 1 1 0 0 0 1 0 1 0 1 1 1 1 0 1 1 1 0 1 0 1 1 0 0 1 0 0 1 0 0 0 1 1 1 1 1 1 1 0 1 0 1 0 1 1 0 1 1 1 ...
result:
wrong answer wa
Test #16:
score: 0
Wrong Answer
time: 529ms
memory: 47744kb
input:
11 1 0 1 1 1 1 0 0 1 1 0 0 1 1 1 1 0 0 0 0 0 1 0 0 0 1 1 0 1 1 0 0 1 1 1 1 1 0 0 0 1 0 0 1 0 0 0 1 0 0 0 1 0 1 1 0 0 1 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 1 0 1 0 0 0 1 0 0 0 0 0 0 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 1 0 0 0 0 1 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 1 0 0 1 0 0 1 1 0 1 1 0 1 1 0 1 1 1...
output:
1 0 0 1 1 1 0 0 1 1 0 0 0 1 1 0 1 1 0 0 1 0 1 1 0 1 0 1 0 0 0 0 0 1 0 1 0 0 1 1 0 1 1 1 0 1 0 1 0 1 0 0 1 1 1 0 1 0 0 0 0 1 1 0 1 1 1 1 0 0 1 0 1 0 0 0 0 1 1 1 0 1 1 0 1 1 0 1 1 0 1 0 0 0 1 1 1 0 1 0 1 0 0 1 1 0 1 0 1 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 1 0 0 1 1 1 0 0 0 1 0 0 1 1 1 0 ...
result:
wrong answer wa
Test #17:
score: 0
Wrong Answer
time: 522ms
memory: 31076kb
input:
11 0 1 0 0 0 1 0 0 1 0 0 0 0 1 1 1 0 1 1 1 0 1 0 1 1 1 0 1 1 0 0 1 1 0 0 1 0 1 1 1 0 1 1 0 0 1 0 0 1 0 1 1 0 1 0 1 1 0 0 1 1 0 1 1 1 1 1 1 0 0 0 1 1 0 1 1 1 1 0 0 1 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 1 1 1 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0 0 1 1 1 1 1 0 1 1 0 1 0 0 1 0 0 0...
output:
1 1 0 1 1 1 1 1 1 0 0 1 0 1 1 1 1 1 0 0 0 0 1 0 1 0 0 1 1 1 1 0 0 0 0 1 1 0 1 1 1 1 0 1 0 0 1 1 1 1 1 0 1 0 1 1 1 0 1 0 1 1 1 1 1 0 1 0 1 1 1 0 0 1 0 1 0 0 1 0 0 1 1 1 0 0 1 1 1 1 0 1 1 0 0 1 1 0 1 0 1 1 0 0 0 0 0 1 0 1 1 1 0 1 1 0 0 0 1 0 1 1 0 1 1 0 0 1 1 0 0 0 1 0 0 0 1 1 1 0 0 0 1 1 0 0 0 0 1 1 ...
result:
wrong answer wa
Test #18:
score: 0
Wrong Answer
time: 522ms
memory: 31352kb
input:
11 0 0 1 0 0 0 0 0 1 1 0 0 0 0 1 0 1 0 1 1 0 0 0 1 0 1 0 1 0 1 0 1 1 0 1 1 0 0 0 0 1 1 0 0 0 1 0 0 1 1 0 1 1 0 0 1 0 1 1 0 0 0 1 1 0 0 0 1 0 1 1 1 0 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 0 0 0 0 1 0 1 1 1 0 0 0 1 1 1 1 0 0 1 0 0 0 1 0 1 0 1 0 0 0 1 1 1 1 1 0 1 1 0 1 1 0 0 1 1 0 0 1 0 1 0 1 0 0 0 0 0 0 1...
output:
0 0 0 0 0 0 1 1 1 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 1 0 1 0 1 1 0 0 1 0 1 0 0 1 0 1 1 1 1 0 0 0 1 0 0 1 1 1 0 0 1 1 1 1 1 1 0 0 1 1 1 1 1 0 1 0 0 1 0 1 0 1 1 1 0 0 0 1 0 1 1 0 0 1 0 0 0 1 0 0 0 1 1 0 1 0 1 0 1 0 1 1 1 1 1 1 0 0 0 1 1 1 1 1 0 0 1 1 0 1 0 1 1 0 1 0 0 1 1 1 0 1 1 0 0 0 1 0 1 1 0 0 0 0 1 ...
result:
wrong answer wa
Test #19:
score: 0
Wrong Answer
time: 516ms
memory: 31968kb
input:
11 1 0 0 1 0 1 1 0 0 0 0 0 1 0 1 1 0 1 0 1 1 0 1 0 0 1 1 1 0 0 0 1 1 1 0 0 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 1 1 0 0 0 1 0 1 1 1 0 0 0 0 0 1 1 0 1 0 1 1 1 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 1 1 1 0 1 1 1 0 1 0 0 0 0 0 1 0 1 0 1 1 1 0 0 1 0 0 1 0 0 1 0 1 1 0 0 1 1 0 0 0 0 1 1 1 1 0 1 1 1 0 1 1 1 0...
output:
0 0 0 1 1 0 0 1 1 0 0 0 0 0 1 0 0 1 1 0 0 0 1 0 0 0 0 1 1 1 1 1 1 0 1 0 1 1 0 1 0 0 1 0 0 1 1 0 0 0 0 0 1 1 0 1 1 1 1 0 1 1 0 1 1 1 0 1 0 0 1 0 1 0 0 0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 1 1 1 0 1 1 0 0 0 1 0 0 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 0 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1 1 0 0 0 1 0 ...
result:
wrong answer wa
Test #20:
score: 0
Wrong Answer
time: 532ms
memory: 30728kb
input:
11 0 0 0 0 1 0 1 0 1 1 0 0 1 0 0 1 1 0 0 1 0 0 1 0 0 0 0 0 0 0 1 1 0 1 1 1 0 0 1 1 1 1 1 1 1 1 0 0 0 0 1 1 0 1 1 0 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 0 0 1 0 1 1 1 0 0 0 1 1 1 0 1 1 1 1 0 0 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 1 0 1 0 1 1 1 0 1 0 1 1 0 1 0 1 0 0 0 1 0 1 0 1 1 1 1 1 1 1 0 0 1 1 1 0 0 0 0 1 1 0...
output:
0 1 1 0 1 1 1 0 0 1 0 1 0 1 1 0 0 1 0 0 1 0 1 0 0 1 1 1 0 1 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 0 1 0 0 1 0 1 1 1 0 0 1 0 1 0 1 1 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 1 0 0 1 0 0 1 1 0 1 0 0 0 0 0 1 1 0 1 0 0 1 0 1 0 0 1 0 1 1 1 1 1 0 1 0 1 0 0 1 1 1 0 1 1 1 0 0 1 1 0 1 0 0 1 1 1 0 0 0 1 0 1 0 1 0 0 1 1 1 ...
result:
wrong answer wa