QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#748235 | #6131. Tournament | tassei903# | WA | 0ms | 3688kb | C++20 | 928b | 2024-11-14 19:47:00 | 2024-11-14 19:47:02 |
Judging History
answer
#include <bits/stdc++.h>
#define rep(i, l, r) for(int i = (int)l; i < (int)r; i++)
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using ld = long double;
typedef vector<ll> vl;
typedef vector<int> vi;
template<class T>
void out(const vector<T> &v) {
for (auto x: v)cout << x << " ";
cout << endl;
}
const ll linf = 1e15 + 10;
void solve() {
int n, k;cin >> n >> k;
if (n % 2 == 1 || k >= n) {
cout << "Impossible" << endl;
return;
}
rep(x, 1, n) {
rep(i, 0, n){
if (i)cout << " ";
cout << 1 + (i ^ x);
}
cout << endl;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T; cin >> T;
while(T--) {
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3688kb
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: 3612kb
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 4 3 2 1 2 1 4 3 3 4 1 2 4 3 2 1 Impossible Impossible Impossible 2 1 4 3 6 5 3 4 1 2 7 8 4 3 2 1 8 7 5 6 7 8 1 2 6 5 8 7 2 1 2 1 4 3 6 5 3 4 1 2 7 8 4 3 2 1 8 7 5 6 7 8 1 2 6 5 8 7 2 1 2 1 4 3 6 5 3 4 1 2 7 8 4 3 2 1 8 7 5 6 7 8 1 2 6 5...
result:
wrong answer 8th lines differ - expected: '2 1 4 3', found: '4 3 2 1'