Kolmijako

input/code.cpp: In function 'int solve()':
input/code.cpp:183:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  183 |     for (int i = 0; i < a.size(); i++) {
      |                     ~~^~~~~~~~~~
input/code.cpp:189:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  189 |     for (int i = 0; i < b.size(); i++) {
      |                     ~~^~~~~~~~~~
input/code.cpp:196:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  196 |     for (int i = 0; i < c.size(); i++) {
      |                     ~~^~~~~~~~~~

#ifdef ONPC
    #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#define char unsigned char
#define rep(i, a, b) for(int i=a; i< (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back

#define LSOne(S) ((S) & -(S))

using namespace std;
// mt19937 rnd(239);
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

template <typename T> int sgn(T x) { return (T(0) < x) - (x < T(0)); }
typedef long double T;
typedef complex<T> pt;
#define X real()
#define Y imag()

template<class T>
istream& operator>> (istream& is, complex<T>& p) {
    T value;
    is >> value;
    p.real(value);
    is >> value;
    p.imag(value);
    return is;
}

typedef long long ll;
typedef long double ld;

using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif

template<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}
template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}

const int INF = 1e9; // 10^9 = 1B is < 2^31-1
const ll LLINF = 4e18; // 4*10^18 is < 2^63-1
const double EPS = 1e-9;
const ll MOD = 1e9+7;

int solve() {
    ll n; std::cin >> n;
    if(n==2 || n==3) {
        std::cout << "NO" << std::endl;
        return 0;
    }


    if(false) {
    for (int i = 4; i <= 20; i++) {
        if((i*(i+1)/2)%3==0) std::cout << i << ": " << i%6  << "    ";
    }
    std::cout  << std::endl;
    }

    if((n*(n+1)/2)%3!=0) { 
        std::cout << "NO" << std::endl;
        return 0;
    }


    // 

    vector<ll> a,b,c;

    if(n%6==5) {
        a.pb(5);
        b.pb(2);
        b.pb(3);
        c.pb(1);
        c.pb(4);

        for (int i = 6; i < n; i+=6) {
            a.pb(i);
            a.pb(i+5);
            b.pb(i+1);
            b.pb(i+4);
            c.pb(i+2);
            c.pb(i+3);
        }
    } else if(n%6==2) { // 8: 36
        a.pb(2);
        a.pb(3);
        a.pb(7);
        b.pb(4);
        b.pb(8);
        c.pb(1);
        c.pb(5);
        c.pb(6);
        for (int i = 9; i < n; i+=6) {
            a.pb(i);
            a.pb(i+5);
            b.pb(i+1);
            b.pb(i+4);
            c.pb(i+2);
            c.pb(i+3);
        }
    } else if(n%6==3) {
        a.pb(1);
        a.pb(6);
        a.pb(8);

        b.pb(3);
        b.pb(5);
        b.pb(7);

        c.pb(2);
        c.pb(4);
        c.pb(9);
        for (int i = 10; i < n; i+=6) {
            a.pb(i);
            a.pb(i+5);
            b.pb(i+1);
            b.pb(i+4);
            c.pb(i+2);
            c.pb(i+3);
        }
    } else if(n%6==0) {
        for (int i = 1; i < n; i+=6) {
            a.pb(i);
            a.pb(i+5);
            b.pb(i+1);
            b.pb(i+4);
            c.pb(i+2);
            c.pb(i+3);
        }
    }


    std::cout << "YES" << std::endl;
    std::cout << a.size() << std::endl;
    for (int i = 0; i < a.size(); i++) {
        std::cout << a[i] << " ";
    }
    std::cout  << std::endl;
    
    std::cout << b.size() << std::endl;
    for (int i = 0; i < b.size(); i++) {
        std::cout << b[i] << " ";
    }
    std::cout  << std::endl;
    

    std::cout << c.size() << std::endl;
    for (int i = 0; i < c.size(); i++) {
        std::cout << c[i] << " ";
    }
    std::cout  << std::endl;
    

    return 0;
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1;
    cin >> TET;
    for (int i = 1; i <= TET; i++) {
        #ifdef ONPC
            cout << "TEST CASE#" << i << endl;
        #endif
        
        if (solve()) {
            break;
        }

        #ifdef ONPC
            cout << "__________________________" << endl;
        #endif
    }
    #ifdef ONPC
        cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
    #endif
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED