#1119819 (C++17) No.3256 Permutation Equation

• 問題: No.3256 Permutation Equation
• ユーザー: tnakao0123
• 提出日時: 2025-09-07 12:54:23
• 言語: C++17 (gcc 15.2.0 + boost 1.90.0)
• 結果: AC
• 実行時間: 33 ms / 2,000 ms
• コード長: 2,035 bytes
• コンパイル時間: 489 ms
• コンパイル使用メモリ: 80,356 KB
• 実行使用メモリ: 8,564 KB
• 最終ジャッジ日時: 2026-07-14 22:16:28
• 合計ジャッジ時間: 5,899 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge3_0

ファイルパターン	結果
sample	AC * 3
other	AC * 48

コンパイルメッセージ

In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/vector:64,
                 from main.cpp:8:
In function 'void std::__fill_a1(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]',
    inlined from 'void std::__fill_a(_FIte, _FIte, const _Tp&) [with _FIte = int*; _Tp = int]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/bits/stl_algobase.h:979:21,
    inlined from 'void std::fill(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/bits/stl_algobase.h:1011:20,
    inlined from 'int main()' at main.cpp:65:7:
/home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/bits/stl_algobase.h:925:18: warning: 'void* __builtin_memset(void*, int, long unsigned int)' specified size between 18446744065119617024 and 18446744073709551612 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=]
  925 |         *__first = __val;
      |         ~~~~~~~~~^~~~~~~
main.cpp: In function 'int main()':
main.cpp:26:16: note: destination object allocated here
   26 | int ts[MAX_N], rs[MAX_N], qs[MAX_N];
      |                ^~
In function 'void std::__fill_a1(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]',
    inlined from 'void std::__fill_a(_FIte, _FIte, const _Tp&) [with _FIte = int*; _Tp = int]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/bits/stl_algobase.h:979:21,
    inlined from 'void std::fill(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/bits/stl_algobase.h:1011:20,
    inlined from 'int main()' at main.cpp:65:7:
/home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/bits/stl_algobase.h:925:18: warning: 'void* __builtin_memset(void*, int, long unsigned int)' specified size between 184

ソースコード

/* -*- coding: utf-8 -*-
 *
 * 3256.cc:  No.3256 Permutation Equation - yukicoder
 */

#include<cstdio>
#include<cassert>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

using vi = vector<int>;
using vvi = vector<vi>;

/* global variables */

int ps[MAX_N], ss[MAX_N];
bool used[MAX_N];
int ts[MAX_N], rs[MAX_N], qs[MAX_N];

/* subroutines */

bool cmpv(const vi &a, const vi &b) {
  return a.size() < b.size();
}

bool check(int n) {
  for (int i = 0; i < n; i++)
    if (ps[i] != qs[(qs[i] + 1) % n]) { puts("NG"); return false; }
  puts("GOOD");
  return true;
}

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", ps + i), ps[i]--;
  for (int i = 0; i < n; i++) ss[i] = (ps[i] + 1) % n;

  vvi cvs;
  for (int st = 0; st < n; st++)
    if (! used[st]) {
      vi v;
      for (int u = st; ! used[u]; u = ss[u])
	used[u] = true, v.push_back(u);
      cvs.push_back(v);
    }
  sort(cvs.begin(), cvs.end(), cmpv);
  int m = cvs.size();
  //for (int i = 0; i < m; i++) {
  //  printf("%d:", (int)cvs[i].size());
  //  for (auto u: cvs[i]) printf(" %d", u);
  //  putchar('\n');
  //}

  fill(rs, rs + n, -1);
  for (int i = 0; i < m;) {
    int j = i, lj = cvs[j].size();
    while (i < m && lj == cvs[i].size()) i++;

    if (lj & 1) {
      for (; j < i; j++) {
	auto &cv = cvs[j];
	for (int k = 0, u = 0; k < lj; k++, u = (u + 2) % lj)
	  ts[u] = cv[k];
	for (int k = 0; k < lj; k++)
	  rs[ts[k]] = ts[(k + 1) % lj];
      }
    }
    else {
      if ((i - j) & 1) { puts("No"); return 0; }
      for (; j < i; j += 2) {
	auto &cv0 = cvs[j], &cv1 = cvs[j + 1];
	for (int k = 0; k < lj; k++) {
	  rs[cv0[k]] = cv1[k];
	  rs[cv1[k]] = cv0[(k + 1) % lj];
	}
      }
    }
  }
  for (int i = 0; i < n; i++) assert(rs[i] >= 0);

  for (int i = 0; i < n; i++) qs[i] = (rs[i] + n - 1) % n;
  
  puts("Yes");
  for (int i = 0; i < n; i++)
    printf("%d%c", qs[i] + 1, (i + 1 < n) ? ' ' : '\n');

  //check(n);
  return 0;
}