Submission #10245409


Source Code Expand

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

using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vll = vector<ll>;
using uint = unsigned int;
using ull = unsigned long long;

template<typename T> using uset = unordered_set<T>;
template<typename T1, typename T2> using umap = unordered_map<T1, T2>;

constexpr int INF = (1 << 30) - 1;
constexpr ll LLINF = 1LL << 60;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr char el = '\n';
constexpr int mod = 1000000007;

template<typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }
template<typename T> T lcm(T a, T b) { return (a / gcd(a, b) * b); }
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

template<typename T>
ostream& operator <<(ostream &os, vector<T> &v) {
	for (auto &u : v) os << u << el;
	return (os);
}

template<typename T>
istream& operator >>(istream &is, vector<T> &v) {
	for (auto &u : v) is >> u;
	return (is);
}

template<typename T1, typename T2>
istream& operator >>(istream &is, pair<T1, T2> &p) {
	return (is >> p.first >> p.second);
}

int main() {
	int N;
	cin >> N;
	vvint A(N, vint(N-1));
	auto output = [&]() {
		for (int i = 0; i < N; i++) {
			cout << A[i][0]+1;
			for (int j = 1; j < N-1; j++) {
				cout << " " << A[i][j]+1;
			}
			cout << endl;
		}
	};
	if (N == 2) { cout << -1 << endl; return (0); }
	if (N == 4) {
		A = {{1, 3, 2}, {2, 0, 3}, {0, 3, 1}, {2, 1, 0}};
		output();
		return (0);
	}
	if (N & 1) {
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N-1; j++) {
				A[i][j] = (i + j + 1) % N;
			}
		}
	} else {
		for (int i = 0; i < N; i++) {
			A[i][0] = (i + 1) % N;
		}
		int n = N >> 1;
		for (int i = 0; i < N; i++) {
			if (!(i & 1)) {
				for (int j = 1; j < n; j++) {
					A[i][j] = (i + j*2) % N;
				}
			} else {
				for (int j = 1; j < n; j++) {
					A[i][j] = (i + 1 + j*2) % N;
				}
			}
		}
		for (int i = 0; i < N; i++) {
			if (i & 1) {
				for (int j = n; j < N-1; j++) {
					A[i][j] = (i + (j-n+1)*2) % N;
				}
			} else {
				for (int j = n; j < N-1; j++) {
					A[i][j] = (i + 1 + (j-n+1)*2) % N;
				}
			}
		}
	}
	output();
	return (0);
}

Submission Info

Submission Time
Task I - 3y3s Challenge
User tinumukiti631
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2481 Byte
Status WA
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 2
AC × 79
WA × 24
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt, subtask1_40.txt, subtask1_41.txt, subtask1_42.txt, subtask1_43.txt, subtask1_44.txt, subtask1_45.txt, subtask1_46.txt, subtask1_47.txt, subtask1_48.txt, subtask1_49.txt, subtask1_50.txt, subtask1_51.txt, subtask1_52.txt, subtask1_53.txt, subtask1_54.txt, subtask1_55.txt, subtask1_56.txt, subtask1_57.txt, subtask1_58.txt, subtask1_59.txt, subtask1_60.txt, subtask1_61.txt, subtask1_62.txt, subtask1_63.txt, subtask1_64.txt, subtask1_65.txt, subtask1_66.txt, subtask1_67.txt, subtask1_68.txt, subtask1_69.txt, subtask1_70.txt, subtask1_71.txt, subtask1_72.txt, subtask1_73.txt, subtask1_74.txt, subtask1_75.txt, subtask1_76.txt, subtask1_77.txt, subtask1_78.txt, subtask1_79.txt, subtask1_80.txt, subtask1_81.txt, subtask1_82.txt, subtask1_83.txt, subtask1_84.txt, subtask1_85.txt, subtask1_86.txt, subtask1_87.txt, subtask1_88.txt, subtask1_89.txt, subtask1_90.txt, subtask1_91.txt, subtask1_92.txt, subtask1_93.txt, subtask1_94.txt, subtask1_95.txt, subtask1_96.txt, subtask1_97.txt, subtask1_98.txt, subtask1_99.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask1_01.txt WA 2 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt WA 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt WA 1 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask1_14.txt AC 1 ms 256 KB
subtask1_15.txt AC 1 ms 256 KB
subtask1_16.txt WA 1 ms 256 KB
subtask1_17.txt AC 1 ms 256 KB
subtask1_18.txt AC 1 ms 256 KB
subtask1_19.txt AC 1 ms 256 KB
subtask1_20.txt WA 1 ms 256 KB
subtask1_21.txt AC 1 ms 256 KB
subtask1_22.txt AC 1 ms 256 KB
subtask1_23.txt AC 1 ms 256 KB
subtask1_24.txt WA 1 ms 256 KB
subtask1_25.txt AC 1 ms 256 KB
subtask1_26.txt AC 1 ms 256 KB
subtask1_27.txt AC 1 ms 256 KB
subtask1_28.txt WA 1 ms 256 KB
subtask1_29.txt AC 1 ms 256 KB
subtask1_30.txt AC 1 ms 256 KB
subtask1_31.txt AC 1 ms 256 KB
subtask1_32.txt WA 1 ms 256 KB
subtask1_33.txt AC 1 ms 256 KB
subtask1_34.txt AC 1 ms 256 KB
subtask1_35.txt AC 1 ms 256 KB
subtask1_36.txt WA 1 ms 256 KB
subtask1_37.txt AC 1 ms 256 KB
subtask1_38.txt AC 1 ms 256 KB
subtask1_39.txt AC 1 ms 256 KB
subtask1_40.txt WA 1 ms 256 KB
subtask1_41.txt AC 1 ms 256 KB
subtask1_42.txt AC 1 ms 256 KB
subtask1_43.txt AC 1 ms 256 KB
subtask1_44.txt WA 1 ms 256 KB
subtask1_45.txt AC 1 ms 256 KB
subtask1_46.txt AC 1 ms 256 KB
subtask1_47.txt AC 1 ms 256 KB
subtask1_48.txt WA 1 ms 256 KB
subtask1_49.txt AC 1 ms 256 KB
subtask1_50.txt AC 1 ms 256 KB
subtask1_51.txt AC 1 ms 256 KB
subtask1_52.txt WA 1 ms 256 KB
subtask1_53.txt AC 1 ms 256 KB
subtask1_54.txt AC 1 ms 256 KB
subtask1_55.txt AC 1 ms 256 KB
subtask1_56.txt WA 2 ms 256 KB
subtask1_57.txt AC 2 ms 256 KB
subtask1_58.txt AC 2 ms 256 KB
subtask1_59.txt AC 2 ms 256 KB
subtask1_60.txt WA 2 ms 256 KB
subtask1_61.txt AC 2 ms 256 KB
subtask1_62.txt AC 2 ms 256 KB
subtask1_63.txt AC 2 ms 256 KB
subtask1_64.txt WA 2 ms 256 KB
subtask1_65.txt AC 2 ms 256 KB
subtask1_66.txt AC 2 ms 256 KB
subtask1_67.txt AC 2 ms 256 KB
subtask1_68.txt WA 2 ms 256 KB
subtask1_69.txt AC 2 ms 256 KB
subtask1_70.txt AC 2 ms 256 KB
subtask1_71.txt AC 2 ms 256 KB
subtask1_72.txt WA 2 ms 256 KB
subtask1_73.txt AC 2 ms 256 KB
subtask1_74.txt AC 2 ms 256 KB
subtask1_75.txt AC 2 ms 256 KB
subtask1_76.txt WA 2 ms 256 KB
subtask1_77.txt AC 2 ms 256 KB
subtask1_78.txt AC 2 ms 256 KB
subtask1_79.txt AC 2 ms 256 KB
subtask1_80.txt WA 2 ms 256 KB
subtask1_81.txt AC 2 ms 256 KB
subtask1_82.txt AC 2 ms 256 KB
subtask1_83.txt AC 2 ms 256 KB
subtask1_84.txt WA 2 ms 256 KB
subtask1_85.txt AC 2 ms 256 KB
subtask1_86.txt AC 2 ms 256 KB
subtask1_87.txt AC 2 ms 256 KB
subtask1_88.txt WA 2 ms 256 KB
subtask1_89.txt AC 2 ms 256 KB
subtask1_90.txt AC 2 ms 256 KB
subtask1_91.txt AC 2 ms 256 KB
subtask1_92.txt WA 2 ms 256 KB
subtask1_93.txt AC 2 ms 256 KB
subtask1_94.txt AC 2 ms 256 KB
subtask1_95.txt AC 2 ms 256 KB
subtask1_96.txt WA 2 ms 256 KB
subtask1_97.txt AC 2 ms 256 KB
subtask1_98.txt AC 2 ms 256 KB
subtask1_99.txt AC 2 ms 256 KB