結果

問題 No.2732 Similar Permutations
ユーザー kaikeykaikey
提出日時 2024-04-19 21:59:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,464 bytes
コンパイル時間 2,620 ms
コンパイル使用メモリ 214,944 KB
実行使用メモリ 12,676 KB
最終ジャッジ日時 2024-10-11 15:06:38
合計ジャッジ時間 24,111 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 82 ms
12,548 KB
testcase_13 AC 80 ms
12,552 KB
testcase_14 AC 80 ms
12,548 KB
testcase_15 AC 81 ms
12,548 KB
testcase_16 AC 58 ms
9,804 KB
testcase_17 AC 57 ms
9,652 KB
testcase_18 AC 74 ms
11,784 KB
testcase_19 AC 80 ms
12,548 KB
testcase_20 AC 79 ms
12,400 KB
testcase_21 AC 81 ms
12,424 KB
testcase_22 AC 46 ms
8,468 KB
testcase_23 AC 81 ms
12,420 KB
testcase_24 AC 47 ms
8,568 KB
testcase_25 AC 82 ms
12,548 KB
testcase_26 AC 70 ms
10,876 KB
testcase_27 AC 82 ms
12,676 KB
testcase_28 AC 66 ms
10,412 KB
testcase_29 AC 83 ms
12,548 KB
testcase_30 AC 62 ms
9,792 KB
testcase_31 AC 83 ms
12,672 KB
testcase_32 AC 77 ms
11,796 KB
testcase_33 AC 82 ms
12,552 KB
testcase_34 AC 54 ms
9,192 KB
testcase_35 AC 82 ms
12,552 KB
testcase_36 AC 77 ms
11,916 KB
testcase_37 AC 82 ms
12,548 KB
testcase_38 AC 75 ms
11,316 KB
testcase_39 AC 83 ms
12,552 KB
testcase_40 AC 69 ms
10,876 KB
testcase_41 AC 82 ms
12,552 KB
testcase_42 AC 62 ms
10,228 KB
testcase_43 AC 82 ms
12,552 KB
testcase_44 AC 42 ms
7,956 KB
testcase_45 AC 83 ms
12,548 KB
testcase_46 AC 74 ms
11,624 KB
testcase_47 AC 83 ms
12,552 KB
testcase_48 AC 49 ms
8,996 KB
testcase_49 AC 76 ms
12,548 KB
testcase_50 AC 45 ms
8,720 KB
testcase_51 AC 72 ms
12,552 KB
testcase_52 AC 61 ms
11,036 KB
testcase_53 AC 79 ms
12,676 KB
testcase_54 AC 79 ms
12,544 KB
testcase_55 AC 79 ms
12,548 KB
testcase_56 AC 79 ms
12,548 KB
testcase_57 AC 41 ms
7,956 KB
testcase_58 AC 55 ms
9,644 KB
testcase_59 AC 53 ms
9,332 KB
testcase_60 AC 44 ms
8,404 KB
testcase_61 AC 40 ms
7,932 KB
testcase_62 AC 66 ms
10,996 KB
testcase_63 AC 2 ms
5,248 KB
testcase_64 AC 2 ms
5,248 KB
testcase_65 AC 2 ms
5,248 KB
testcase_66 AC 2 ms
5,248 KB
testcase_67 AC 2 ms
5,248 KB
testcase_68 AC 2 ms
5,248 KB
testcase_69 WA -
testcase_70 WA -
testcase_71 WA -
testcase_72 WA -
testcase_73 WA -
testcase_74 WA -
testcase_75 WA -
testcase_76 WA -
testcase_77 WA -
testcase_78 WA -
testcase_79 WA -
testcase_80 WA -
testcase_81 WA -
testcase_82 WA -
testcase_83 WA -
testcase_84 WA -
testcase_85 WA -
testcase_86 WA -
testcase_87 WA -
testcase_88 WA -
testcase_89 WA -
testcase_90 WA -
testcase_91 WA -
testcase_92 WA -
testcase_93 WA -
testcase_94 WA -
testcase_95 WA -
testcase_96 WA -
testcase_97 WA -
testcase_98 WA -
testcase_99 WA -
testcase_100 WA -
testcase_101 WA -
testcase_102 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
#include <random>
#include <chrono>
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(30); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto mul = [](T a, T b) -> T { return a * b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>; using VVVl = V<V<Vl>>; using VVVVl = V<V<V<Vl>>>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
    for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
    return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
    for (T& in : v) is >> in;
    return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
    F f;
    rec(F&& f_) : f(std::forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&... args) const {
        return f(*this, std::forward<Args>(args)...);
    }
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 2e18;
lint dx[8] = { 0, 1, 0, -1, 1, -1, 1, -1 }, dy[8] = { 1, 0, -1, 0, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
    lint from, to;
    lint cost;
    Edge() {

    }
    Edge(lint u, lint v, lint c) {
        cost = c;
        from = u;
        to = v;
    }
    bool operator<(const Edge& e) const {
        return cost < e.cost;
    }
};
struct WeightedEdge {
    lint to;
    lint cost;
    WeightedEdge(lint v, lint c) {
        to = v;
        cost = c;
    }
    bool operator<(const WeightedEdge& e) const {
        return cost < e.cost;
    }
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<lint, plint> tlint;
typedef pair<lint, V<tlint>> state;
typedef pair<ld, ld> pld;
typedef pair<lint, tlint> qlint;
typedef pair<lint, qlint> vlint;
typedef pair<Edge, lint> pEd;
typedef pair<plint, V<plint>> vVl;
typedef pair<string, string> pstr;
typedef pair<ld, lint> pint;
typedef pair<lint, set<pint>> pset;


template <std::int_fast64_t Modulus>
class modint
{
	using u64 = std::int_fast64_t;

public:
	u64 a;
	constexpr modint(const u64 x = 0) noexcept : a(x% Modulus) {}
	constexpr u64& value() noexcept { return a; }
	constexpr const u64& value() const noexcept { return a; }
	constexpr modint operator+(const modint rhs) const noexcept
	{
		return modint(*this) += rhs;
	}
	constexpr modint operator-(const modint rhs) const noexcept
	{
		return modint(*this) -= rhs;
	}
	constexpr modint operator*(const modint rhs) const noexcept
	{
		return modint(*this) *= rhs;
	}
	constexpr modint operator/(const modint rhs) const noexcept
	{
		return modint(*this) /= rhs;
	}
	constexpr modint& operator+=(const modint rhs) noexcept
	{
		a += rhs.a;
		if (a >= Modulus)
		{
			a -= Modulus;
		}
		return *this;
	}
	constexpr modint& operator-=(const modint rhs) noexcept
	{
		if (a < rhs.a)
		{
			a += Modulus;
		}
		a -= rhs.a;
		return *this;
	}
	constexpr modint& operator*=(const modint rhs) noexcept
	{
		a = a * rhs.a % Modulus;
		return *this;
	}
	constexpr modint& operator/=(modint rhs) noexcept
	{
		u64 exp = Modulus - 2;
		while (exp)
		{
			if (exp % 2)
			{
				*this *= rhs;
			}
			rhs *= rhs;
			exp /= 2;
		}
		return *this;
	}
};
typedef modint<MOD998244353> ModInt;

ModInt mod_pow(ModInt x, lint n) {
	ModInt ret = 1;
	while (n > 0) {
		if (n & 1) (ret *= x);
		(x *= x);
		n >>= 1;
	}
	return ret;
}

ModInt func[200000];
ModInt revfunc[200000];
void funcinit(int N)
{
	func[0] = 1;
	for (int i = 1; i <= N; i++)
	{
		func[i] = func[i - 1] * i;
	}
	revfunc[N] = (ModInt)1 / func[N];
	for (int i = N; i >= 1; i--)
	{
		revfunc[i - 1] = revfunc[i] * i;
	}
}
ModInt comb(ModInt n, ModInt r)
{
	if (n.a < 0 || n.a < r.a)
	{
		return 0;
	}
	return func[n.a] / (func[r.a] * func[(n - r).a]);
}

void solve() {
	lint N;
	cin >> N;
	Vl arr(N);
	cin >> arr;
	plint p = { -1, -1 };
	V<plint> _arr;
	REP(i, N) _arr.push_back({ arr[i], i });
	sort(ALL(_arr));
	REP(i, N - 1) {
		if (_arr[i + 1].first - _arr[i].first == 0) {
			p.first = _arr[i + 1].second;
			p.second = _arr[i].second;
		}
	}
	if (p.first == -1) {
		cout << -1 << endk;
		return;
	}
	lint d = max(1ll, arr[p.first] - arr[p.second]);
	VVl ans(2, Vl(N));
	ans[0][p.first] = 1;
	ans[0][p.second] = d + 1;
	ans[1][p.first] = d + 1;
	ans[1][p.second] = 1;
	
	lint idx = 0;
	REP(i, N) {
		if (1 == i + 1) continue;
		if (d + 1 == i + 1) continue;
		if (idx == p.first || idx == p.second) idx++;
		if (idx == p.first || idx == p.second) idx++;
		ans[0][idx] = i + 1;
		ans[1][idx] = i + 1;
		idx++;
	}
	REP(k, 2) cout << ans[k] << endk;
}

int main() {
    lint T = 1;
    //cin >> T;
    while (T--) solve();
}
0