QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#664516 | #7333. Dominoes | Urd | AC ✓ | 0ms | 3624kb | C++17 | 753b | 2024-10-21 20:57:04 | 2024-10-21 20:57:04 |
Judging History
answer
#include <bits/stdc++.h>
#define ALL(v) begin(v), end(v)
using i64 = int64_t;
int n;
void Proc() {
std::cin >> n;
if (n == 1) {
std::cout << "1 1 1 2\n";
} else if (n == 2) {
std::cout << "1 1 1 2\n1 3 1 4\n1 5 1 6\n";
} else if (n == 3) {
std::cout << "1 1 1 2\n2 1 2 2\n3 1 3 2\n2 3 2 4\n2 5 3 5\n3 3 3 4\n";
} else if (n == 4) {
std::cout << "1 1 1 2\n2 1 2 2\n1 3 1 4\n3 1 3 2\n2 3 2 4\n3 4 3 "
"5\n3 3 4 "
"3\n1 5 2 5\n4 5 4 4\n4 1 4 2\n";
} else {
std::cout << "impossible\n";
}
}
auto main() -> int {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr), std::cout.tie(nullptr);
int t;
for (std::cin >> t; t; --t) Proc();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
input:
1 2
output:
1 1 1 2 1 3 1 4 1 5 1 6
result:
ok OK!
Test #2:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
50 888 171 6 7 8 9 10 1000 1 2 3 4 5 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 71 172 516 669 997
output:
impossible impossible impossible impossible impossible impossible impossible impossible 1 1 1 2 1 1 1 2 1 3 1 4 1 5 1 6 1 1 1 2 2 1 2 2 3 1 3 2 2 3 2 4 2 5 3 5 3 3 3 4 1 1 1 2 2 1 2 2 1 3 1 4 3 1 3 2 2 3 2 4 3 4 3 5 3 3 4 3 1 5 2 5 4 5 4 4 4 1 4 2 impossible impossible impossible impossible impossib...
result:
ok OK!