QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#412904 | #6131. Tournament | Hqwq | WA | 0ms | 12872kb | C++20 | 953b | 2024-05-16 21:26:52 | 2024-05-16 21:26:52 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int t, n, m, a[100010];
int ans[2010][2010];
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
for (int i = 1; i <= 1000;i++){
ans[0][i] = i;
}
int p = 1;
for (int i = 0; i < 512; i+=p/2){
for (int j = 1; j <= p; j++){
for (int k = 0; k < 512; k += p * 2){
for (int l = 1; l <= p; l++){
ans[i + j][k + l] = ans[i + j - p][k + l + p];
ans[i + j][k + l + p] = ans[i + j - p][k + l];
}
}
}
p <<= 1;
}
cin >> t;
while(t--){
cin >> n >> m;
if (n==1 || m>=n){
cout << "Impossible\n";
continue;
}
int k = n;
while(k%2==0)
k /= 2;
if (k!=1){
cout << "Impossible\n";
continue;
}
for (int i = 1; i <= m; i++){
for (int j = 1; j <= n; j++){
cout << ans[i][j] << ' ';
}
cout << '\n';
}
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 12872kb
input:
2 3 1 4 3
output:
Impossible 2 1 4 3 3 4 1 2 4 3 2 1
result:
ok 4 lines
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 12396kb
input:
100 1 4 2 1 2 2 2 3 3 6 4 2 4 3 4 4 4 5 5 4 6 1 6 2 6 4 7 1 8 3 8 7 8 8 8 14 9 4 10 1 10 2 10 3 12 2 12 3 12 4 12 8 13 2 14 1 14 2 14 4 15 4 16 9 16 15 16 16 16 28 17 6 18 1 18 2 18 4 19 5 20 1 20 3 20 4 20 6 21 1 22 1 22 2 22 3 23 4 24 5 24 7 24 8 24 15 25 3 26 1 26 2 26 3 27 5 28 1 28 3 28 4 28 6 ...
output:
Impossible 2 1 Impossible Impossible Impossible 2 1 4 3 3 4 1 2 2 1 4 3 3 4 1 2 4 3 2 1 Impossible Impossible Impossible Impossible Impossible Impossible Impossible 2 1 4 3 6 5 8 7 3 4 1 2 7 8 5 6 4 3 2 1 8 7 6 5 2 1 4 3 6 5 8 7 3 4 1 2 7 8 5 6 4 3 2 1 8 7 6 5 5 6 7 8 1 2 3 4 6 5 8 7 2 ...
result:
wrong answer 14th lines differ - expected: '2 1 4 3 6 5', found: 'Impossible'