QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #90937 | #6131. Tournament | ksunhokim | AC ✓ | 84ms | 6944kb | C++17 | 1.1kb | 2023-03-26 08:34:33 | 2023-03-26 08:34:34 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n,k;
cin >> n >> k;
vector g(n, vector<int>(n, false));
for (int i=0;i<n;i++){
g[i][i] = true;
}
vector<vector<int>> ans;
for (int i=0;i<k;i++){
ans.push_back(vector<int>(n));
vector<int> vis(n);
int cnt = 0;
for (int j=0;j<n;j++){
if (vis[j]) continue;
int u = j;
for (int z=j;z<n;z++) {
int v = z;
if (!vis[v] && !g[u][v]) {
vis[u] = true;
vis[v] = true;
g[u][v] = true;
g[v][u] = true;
ans.back()[v] = u;
ans.back()[u] = v;
cnt += 2;
break;
}
}
}
if (cnt != n) {
cout << "Impossible" << "\n";
return;
}
}
for (int i=0;i<k;i++) {
for (int j=0;j<n;j++) {
if (j != n-1) {
cout << ans[i][j] + 1 << " ";
} else {
cout << ans[i][j] + 1;
}
}
cout << "\n";
}
}
int main() {
int t;
cin >> t;
while (t--)
solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3388kb
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: 4ms
memory: 3428kb
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 2 1 4 3 7 8 5 ...
result:
ok 194 lines
Test #3:
score: 0
Accepted
time: 84ms
memory: 6944kb
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:
ok 693 lines
Test #4:
score: 0
Accepted
time: 4ms
memory: 3592kb
input:
30 184 17 154 3 172 2 138 10 156 13 130 3 168 7 170 4 146 3 198 3 134 11 116 1 132 7 140 2 130 9 174 5 182 4 106 4 174 2 182 2 104 14 168 13 198 1 110 3 176 9 198 9 156 11 148 2 118 10 150 8
output:
Impossible Impossible 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...
result:
ok 47 lines