QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#242792 | #7333. Dominoes | PetroTarnavskyi# | AC ✓ | 1ms | 3544kb | C++20 | 1.1kb | 2023-11-07 17:15:48 | 2023-11-07 17:15:48 |
Judging History
answer
//hash = 7d0184
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;
string domino[5][5];
void init()
{
domino[1][1] = "2 1 2 2";//
domino[1][2] = "3 2 4 2";//
domino[1][3] = "1 1 1 0";//
domino[1][4] = "1 2 1 3";//
domino[2][2] = "4 0 4 1";//
domino[2][3] = "3 0 2 0";//
domino[2][4] = "4 3 3 3";//
domino[3][3] = "0 0 0 1";//
domino[3][4] = "0 2 0 3";//
domino[4][4] = "2 3 2 4";//
}
void solve()
{
int n;
cin >> n;
if(n >= 5)
{
cout << "impossible\n";
return;
}
FOR(i, 1, n + 1)
FOR(j, i, n + 1)
cout << domino[i][j] << "\n";
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(15);
init();
int t;
cin >> t;
while(t--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3424kb
input:
1 2
output:
2 1 2 2 3 2 4 2 4 0 4 1
result:
ok OK!
Test #2:
score: 0
Accepted
time: 0ms
memory: 3544kb
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 2 1 2 2 2 1 2 2 3 2 4 2 4 0 4 1 2 1 2 2 3 2 4 2 1 1 1 0 4 0 4 1 3 0 2 0 0 0 0 1 2 1 2 2 3 2 4 2 1 1 1 0 1 2 1 3 4 0 4 1 3 0 2 0 4 3 3 3 0 0 0 1 0 2 0 3 2 3 2 4 impossible impossible impossible impossible impossib...
result:
ok OK!