QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#642281#9439. Aim HighBalintR#AC ✓0ms3644kbC++202.8kb2024-10-15 12:34:212024-10-15 12:34:21

Judging History

This is the latest submission verdict.

  • [2024-10-15 12:34:21]
  • Judged
  • Verdict: AC
  • Time: 0ms
  • Memory: 3644kb
  • [2024-10-15 12:34:21]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
#define pb push_back
#define fs first
#define sn second
#define ms(a, x) memset(a, x, sizeof(a))
#define ALL(v) begin(v), end(v)
#define SZ(v) ((int) (v).size())
const int INF = 0x3f3f3f3f;
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x){cerr << #x << ' ' << (x) << endl;}
#define dbgArr(arr, n){cerr << #arr; FR(_i, n) cerr << ' ' << (arr)[_i]; cerr << endl;}
template <class T, class U>
ostream& operator<<(ostream &os, pair<T, U> p){return os << "(" << p.fs << ", " << p.sn << ")";}

int main(){
    cin.sync_with_stdio(0); cin.tie(0);
    int t; cin >> t;
    while(t--){
        int n; cin >> n;
        if (n > 4) {
            cout << "-1\n";
            continue;
        }
        if(n == 1){
            cout << "1\n1 0 0 0 0 1\n";
        }
        else if(n == 2){
            cout << "3\n"
            "0 0 1 0 1 1\n"
            "3 0 2 0 2 1\n"
            "2 1 1 1 1 2\n";
        }
        else if(n == 3){
            cout << "9\n"
            "0 0 1 0 1 1\n"
            "3 0 2 0 2 1\n"
            "1 1 2 1 2 2\n"
            "1 -1 2 -1 2 0\n"
            "4 -1 3 -1 3 0\n"
            "2 0 3 0 3 1\n"
            "5 0 4 0 4 1\n"
            "4 1 3 1 3 2\n"
            "3 2 2 2 2 3\n";
        }
        else {
            cout << "65\n"
"-1 -10 0 -10 0 -9\n"
"1 -9 0 -9 0 -8\n"
"0 -9 -1 -9 -1 -8\n"
"-1 -8 0 -8 0 -7\n"
"0 -8 -1 -8 -1 -7\n"
"3 -7 4 -7 4 -6\n"
"-1 -7 0 -7 0 -6\n"
"0 -7 -1 -7 -1 -6\n"
"5 -6 4 -6 4 -5\n"
"4 -6 3 -6 3 -5\n"
"0 -6 1 -6 1 -5\n"
"-1 -6 0 -6 0 -5\n"
"-2 -6 -1 -6 -1 -5\n"
"4 -5 3 -5 3 -4\n"
"4 -5 3 -5 3 -4\n"
"1 -5 2 -5 2 -4\n"
"0 -5 1 -5 1 -4\n"
"-1 -5 0 -5 0 -4\n"
"-1 -5 -2 -5 -2 -4\n"
"3 -4 4 -4 4 -3\n"
"2 -4 3 -4 3 -3\n"
"3 -4 2 -4 2 -3\n"
"0 -4 1 -4 1 -3\n"
"1 -4 0 -4 0 -3\n"
"-2 -4 -1 -4 -1 -3\n"
"-3 -4 -2 -4 -2 -3\n"
"5 -3 4 -3 4 -2\n"
"4 -3 3 -3 3 -2\n"
"2 -3 3 -3 3 -2\n"
"1 -3 2 -3 2 -2\n"
"0 -3 1 -3 1 -2\n"
"0 -3 -1 -3 -1 -2\n"
"-1 -3 -2 -3 -2 -2\n"
"-3 -3 -2 -3 -2 -2\n"
"3 -2 4 -2 4 -1\n"
"4 -2 3 -2 3 -1\n"
"3 -2 2 -2 2 -1\n"
"2 -2 1 -2 1 -1\n"
"0 -2 1 -2 1 -1\n"
"-2 -2 -1 -2 -1 -1\n"
"-1 -2 -2 -2 -2 -1\n"
"-3 -2 -2 -2 -2 -1\n"
"4 -1 3 -1 3 0\n"
"4 -1 3 -1 3 0\n"
"1 -1 2 -1 2 0\n"
"1 -1 2 -1 2 0\n"
"0 -1 1 -1 1 0\n"
"-2 -1 -1 -1 -1 0\n"
"-3 -1 -2 -1 -2 0\n"
"-1 -1 -2 -1 -2 0\n"
"4 0 3 0 3 1\n"
"3 0 2 0 2 1\n"
"3 0 2 0 2 1\n"
"2 0 1 0 1 1\n"
"1 0 0 0 0 1\n"
"-2 0 -1 0 -1 1\n"
"-2 0 -1 0 -1 1\n"
"-3 0 -2 0 -2 1\n"
"3 1 2 1 2 2\n"
"2 1 1 1 1 2\n"
"-1 1 0 1 0 2\n"
"-2 1 -1 1 -1 2\n"
"2 2 1 2 1 3\n"
"-1 2 0 2 0 3\n"
"1 3 0 3 0 4\n";
        }
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3644kb

input:

1
1

output:

1
1 0 0 0 0 1

result:

ok Output is valid. OK

Test #2:

score: 0
Accepted
time: 0ms
memory: 3612kb

input:

6
1
2
3
4
5
6

output:

1
1 0 0 0 0 1
3
0 0 1 0 1 1
3 0 2 0 2 1
2 1 1 1 1 2
9
0 0 1 0 1 1
3 0 2 0 2 1
1 1 2 1 2 2
1 -1 2 -1 2 0
4 -1 3 -1 3 0
2 0 3 0 3 1
5 0 4 0 4 1
4 1 3 1 3 2
3 2 2 2 2 3
65
-1 -10 0 -10 0 -9
1 -9 0 -9 0 -8
0 -9 -1 -9 -1 -8
-1 -8 0 -8 0 -7
0 -8 -1 -8 -1 -7
3 -7 4 -7 4 -6
-1 -7 0 -7 0 -6
0 -7 -1 -7 -1 -6
...

result:

ok Output is valid. OK

Extra Test:

score: 0
Extra Test Passed