QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #691385 | #6131. Tournament | OIer_kzc# | WA | 0ms | 1632kb | C++17 | 568b | 2024-10-31 11:15:50 | 2024-10-31 11:15:50 |
Judging History
answer
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#define eb emplace_back
#define LOG(FMT...) fprintf(stderr, FMT)
using namespace std;
typedef long long LL;
constexpr int N = 1000005;
int n, m;
int main() {
int task;
for (scanf("%d", &task); task--; ) {
scanf("%d%d", &n, &m);
if (m >= n || (n & n - 1)) {
puts("Impossible");
continue;
}
for (int mask = 1; mask <= m; ++mask) {
for (int x = 0; x < n; ++x) {
printf("%d ", (x ^ mask) + 1);
}
puts("");
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 1532kb
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: 1632kb
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'