QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#412915#6131. TournamentHqwqWA 12ms12636kbC++20939b2024-05-16 21:35:202024-05-16 21:35:20

Judging History

你现在查看的是最新测评结果

  • [2024-05-16 21:35:20]
  • 评测
  • 测评结果:WA
  • 用时:12ms
  • 内存:12636kb
  • [2024-05-16 21:35:20]
  • 提交

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, mi = 1;
		while(k%2==0){
			k /= 2;
			mi*=2;
		}
		mi -= 1;
		if (m>mi){
			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: 12636kb

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: 0
Accepted
time: 3ms
memory: 12320kb

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
2 1 4 3 6 5 
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 ...

result:

ok 194 lines

Test #3:

score: -100
Wrong Answer
time: 12ms
memory: 12448kb

input:

5
512 511
512 513
896 120
896 130
960 60

output:

2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 26 25 28 27 30 29 32 31 34 33 36 35 38 37 40 39 42 41 44 43 46 45 48 47 50 49 52 51 54 53 56 55 58 57 60 59 62 61 64 63 66 65 68 67 70 69 72 71 74 73 76 75 78 77 80 79 82 81 84 83 86 85 88 87 90 89 92 91 94 93 96 95 98 97 100 99 102 101 ...

result:

wrong answer 513th lines differ - expected: '2 1 4 3 6 5 8 7 10 9 12 11 14 ...890 889 892 891 894 893 896 895', found: '2 1 4 3 6 5 8 7 10 9 12 11 14 ... 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 '