結果

問題 No.3735 Offbeat Permutation Tree
コンテスト
ユーザー askr58
提出日時 2026-09-19 17:10:59
言語 C++23
(gcc 15.3.0 + boost 1.92.0 + ACL)
コンパイル:
g++-15 -O2 -lm -std=c++23 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_
実行:
./a.out
結果
AC  
実行時間 179 ms / 2,000 ms
+ 148µs
コード長 7,273 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 3,699 ms
コンパイル使用メモリ 353,200 KB
実行使用メモリ 9,904 KB
最終ジャッジ日時 2026-09-19 17:11:17
合計ジャッジ時間 10,037 ms
ジャッジサーバーID
（参考情報） 		judge3_0 / judge2_0
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#include <iostream>
#include <bitset>
#include <random>
#include <chrono>
#include <iomanip>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <string>
#include <stack>
#include <ranges>
#include <algorithm>
#include <vector>
using namespace std;
using ll=long long;

#include <atcoder/all>
using mint=atcoder::modint998244353;

ostream& operator<<(ostream& os,const mint& x){
	os<<x.val();
	return os;
}
istream& operator>>(istream& is,mint& x){
	int t;
	is>>t;
	x=t;
	return is;
}

template <typename S,typename T>
ostream& operator<<(ostream& os,const pair<S,T>& p);
template <typename S,typename T>
istream& operator>>(istream& is,pair<S,T>& p);
template <typename T,size_t n>
ostream& operator<<(ostream& os,const array<T,n>& arr);
template <typename T,size_t n>
istream& operator>>(istream& is,array<T,n>& arr);
template <typename T>
ostream& operator<<(ostream& os,const vector<T>& vec);
template <typename T>
istream& operator>>(istream& is,vector<T>& vec);

template <typename S,typename T>
ostream& operator<<(ostream& os,const pair<S,T>& p){
	os<<p.first<<" "<<p.second;
	return os;
}
template <typename S,typename T>
istream& operator>>(istream& is,pair<S,T>& p){
	is>>p.first>>p.second;
	return is;
}

template <typename T,size_t n>
ostream& operator<<(ostream& os,const array<T,n>& arr){
	for(int i=0;i<n;i++)os<<arr[i]<<(i+1==n?"":" ");
	return os;
}
template <typename T,size_t n>
istream& operator>>(istream& is,array<T,n>& arr){
	for(int i=0;i<n;i++)is>>arr[i];
	return is;
}
template <typename T>
ostream& operator<<(ostream& os,const vector<T>& vec){
	for(int i=0;i<(int)vec.size();i++)os<<vec[i]<<(i+1==(int)vec.size()?"":" ");
	return os;
}
template <typename T>
istream& operator>>(istream& is,vector<T>& vec){
	for(int i=0;i<(int)vec.size();i++)is>>vec[i];
	return is;
}

template<class... Vecs>
void input_vec(Vecs&... vs) {
    const auto n = get<0>(tie(vs...)).size();

    for (size_t i = 0; i < n; ++i)
        ((cin >> vs[i]), ...);
}

template <class... Vecs>
void output_vec(const Vecs&... vs) {
    const auto n = get<0>(tie(vs...)).size();

    for (size_t i = 0; i < n; ++i) {
        bool first = true;
        (((cout << (exchange(first, false) ? "" : " ") << vs[i])), ...);
        cout << endl;
    }
}

template <typename T>
vector<T> make_unique(vector<T> vec){
	ranges::sort(vec);
	vec.erase(unique(vec.begin(),vec.end()),vec.end());
	return vec;
}

vector<int> Iota(int n,int s=0){
	vector<int> res(n);
	iota(res.begin(),res.end(),s);
	return res;
}

vector<ll> Iotall(int n,ll s=0){
	vector<ll> res(n);
	iota(res.begin(),res.end(),s);
	return res;
}
void YESNO(bool f){
	if(f)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
}

using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using vvvl=vector<vector<vector<ll>>>; 
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vvvi=vector<vector<vector<int>>>;
vector<vector<array<int,2>>> minians={
{{1,2},
{2,3},
{1,5},
{2,6},
{3,7},
{7,11},
{10,11},
{14,15},
{10,14},
{4,5},
{0,4},
{4,8},
{8,12},
{12,13},
{13,9},},
{
{1,2},
{2,3},
{3,4},
{1,6},
{2,7},
{7,12},
{3,8},
{8,13},
{4,9},
{9,14},
{14,19},
{18,19},
{23,24},
{18,23},
{11,12},
{10,11},
{10,5},
{5,0},
{11,16},
{15,16},
{15,20},
{20,21},
{21,22},
{22,17},
},
{
{1,2},
{2,3},
{3,4},
{4,5},
{1,7},
{2,8},
{8,14},
{3,9},
{9,15},
{15,21},
{4,10},
{10,16},
{16,22},
{5,11},
{11,17},
{17,23},
{23,29},
{28,29},
{34,35},
{28,34},
{21,20},
{20,19},
{19,13},
{13,12},
{12,6},
{6,0},
{12,18},
{18,24},
{24,30},
{30,31},
{31,25},
{25,26},
{26,32},
{32,33},
{33,27},
},{
{1,2},
{2,3},
{3,4},
{4,5},
{5,6},
{1,8},
{2,9},
{9,16},
{3,10},
{10,17},
{17,24},
{4,11},
{11,18},
{18,25},
{25,32},
{5,12},
{12,19},
{19,26},
{26,33},
{6,13},
{13,20},
{20,27},
{27,34},
{34,41},
{40,41},
{47,48},
{40,47},
{32,31},
{31,30},
{30,23},
{23,22},
{22,15},
{15,14},
{14,7},
{7,0},
{14,21},
{21,28},
{28,29},
{29,36},
{36,35},
{35,42},
{42,43},
{43,44},
{44,37},
{37,38},
{38,45},
{45,46},
{46,39},
}};
int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	int n;
	cin>>n;
	if(n<=3){
		cout<<-1<<endl;
		return 0;
	}
	vi u,v;
	{
		int i=n%4;
		int k=i+4;
		for(auto[p,q]:minians[i]){
			int x1=p/k,y1=p%k,x2=q/k,y2=q%k;
			u.push_back(x1*n+y1);
			v.push_back(x2*n+y2);
		}
	}
	for(int i=4+(n%4);i<n;i+=4){
		
		for(int j=i-1;j<i+3;j++){
			u.push_back(j);
			v.push_back(j+1);
		}
		if(n%2==0){
			for(int j=0;j<i;j++){
				u.push_back(j*n+i);
				v.push_back((j+1)*n+i);
			}
			for(int j=0;j<i;j++){
				if(j&1){
					u.push_back(j*n+i+1);
					v.push_back((j+1)*n+i+1);
				}else{
					u.push_back(j*n+i+2);
					v.push_back((j+1)*n+i+2);
				}
			}
			u.push_back(i*n+i+2);
			v.push_back((i+1)*n+i+2);
			u.push_back(i*n+i+1);
			v.push_back((i+1)*n+i+1);
			for(int j=1;j<=i;j++){
				u.push_back(j*n+i+1);
				v.push_back(j*n+i+2);
			}
			// 右端のやつ
			{
				for(int j=0;j<i+2;j++){
					u.push_back(j*n+i+3);
					v.push_back((j+1)*n+i+3);
				}
				for(int j=i+2;j<=i+3;j++){
					u.push_back(j*n+i+2);
					v.push_back(j*n+i+3);
				}
				u.push_back((i+2)*n+i+2);
				v.push_back((i+3)*n+i+2);
			}
			//左にいくとこ
			{
				for(int j=0;j<i-1;j++){
					u.push_back(i*n+j);
					v.push_back(i*n+j+1);
				}
				u.push_back(i*n+i-1);
				v.push_back((i+1)*n+i-1);
				for(int j=i-1;j<=i;j++){
					u.push_back((i+1)*n+j);
					v.push_back((i+1)*n+j+1);
				}
			}
			for(int j=i;j<i+3;j++){
				u.push_back(j*n);
				v.push_back((j+1)*n);
			}
			for(int j=1;j<i-1;j++){
				if(j&1){
					u.push_back((i+3)*n+j-1);
					v.push_back((i+3)*n+j);
				}else{
					u.push_back((i+1)*n+j-1);
					v.push_back((i+1)*n+j);
				}
				for(int k=i+1;k<i+3;k++){
					u.push_back(k*n+j);
					v.push_back((k+1)*n+j);
				}
			}
			u.push_back((i+3)*n+i-2);
			v.push_back((i+3)*n+i-1);
			u.push_back((i+2)*n+i-1);
			v.push_back((i+2)*n+i);
			u.push_back((i+3)*n+i);
			v.push_back((i+3)*n+i+1);
			for(int j=i-1;j<=i+1;j++){
				u.push_back((i+2)*n+j);
				v.push_back((i+3)*n+j);
			}
		}else{
			for(int j=0;j<i;j++){
				if(j&1){
					u.push_back(j*n+i);
					v.push_back((j+1)*n+i);
				}else{
					u.push_back(j*n+i+1);
					v.push_back((j+1)*n+i+1);
				}
			}
			for(int j=1;j<i;j++){
				u.push_back(j*n+i);
				v.push_back(j*n+i+1);
			}
			for(int j=0;j<=i;j++){
				u.push_back(j*n+i+2);
				v.push_back((j+1)*n+i+2);
			}
			for(int j=0;j<i+2;j++){
				u.push_back(j*n+i+3);
				v.push_back((j+1)*n+i+3);
			}
			u.push_back((i+2)*n+i+2);
			v.push_back((i+2)*n+i+3);
			u.push_back((i+3)*n+i+2);
			v.push_back((i+3)*n+i+3);
			u.push_back((i+2)*n+i+2);
			v.push_back((i+3)*n+i+2);
			

			u.push_back(i*n+i+1);
			v.push_back((i+1)*n+i+1);
			for(int j=0;j<=i;j++){
				u.push_back((i+1)*n+j);
				v.push_back((i+1)*n+j+1);
			}
			u.push_back(i*n);
			v.push_back((i+1)*n);
			u.push_back((i+1)*n+i);
			v.push_back((i+2)*n+i);
			u.push_back((i+2)*n);
			v.push_back((i+3)*n);
			u.push_back((i+2)*n+i+1);
			v.push_back((i+3)*n+i+1);
			for(int j=0;j<i;j++){
				u.push_back(i*n+j);
				v.push_back(i*n+j+1);
				u.push_back((i+2)*n+j);
				v.push_back((i+2)*n+j+1);
				u.push_back((i+3)*n+j);
				v.push_back((i+3)*n+j+1);
			}
			u.push_back((i+3)*n+i);
			v.push_back((i+3)*n+i+1);
		}

	}
	for(int i=0;i<n*n-1;i++)cout<<u[i]+1<<" "<<v[i]+1<<endl;
}
0