結果
問題 | No.2289 順列ソート |
ユーザー |
|
提出日時 | 2023-05-28 12:41:59 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,206 bytes |
コンパイル時間 | 3,819 ms |
コンパイル使用メモリ | 254,544 KB |
最終ジャッジ日時 | 2025-02-13 09:35:08 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 21 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using ll = long long;#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)#define rep2(i, s, n) for (int i = (s); i < (int)(n); ++i)#define repc2(i, s, n) for (int i = (s); i <= (int)(n); ++i)constexpr int inf = 2000'000'000;constexpr ll linf = 4000000000000000000ll;constexpr ll M7 = 1000000007ll;constexpr ll M09 = 1000000009ll;constexpr ll M9 = 998244353ll;#define all(v) begin(v), end(v)#define rall(v) rbegin(v), rend(v)using namespace std;using namespace atcoder;template <typename T>inline ostream& operator<<(ostream& os, vector<T>& v) {for (auto& e : v) os << e << " ";return os;}template <typename T, typename U>std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) noexcept {return os << "(" << p.first << ", " << p.second << ")";}#ifdef ONLINE_JUDGE#define debug(...)#else#define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__)template <typename T>void debug_out(T t) {cerr << t << endl;}template <typename T, typename... Args>void debug_out(T t, Args... args) {cerr << t << ", ";debug_out(args...);}#endifint main() {ios_base::sync_with_stdio(false);cin.tie(NULL);int n;cin >> n;vector<int> a(n);rep(i, n) cin >> a.at(i);rep(i, n) a.at(i)--;auto perm_cycle = [&](const vector<int>& perm) {vector<vector<int>> cycles;const int n = perm.size();vector<bool> seen(n);rep(i, n) {if (seen.at(i))continue;vector<int> cycle;int u = i;while (!seen.at(u)) {seen.at(u) = true;cycle.emplace_back(u);u = perm.at(u);}cycles.emplace_back(cycle);}return cycles;};auto cycles = perm_cycle(a);int ans = 0;for (auto c : cycles) {ans += c.size() - 1;}cout << ans << "\n";return 0;}