結果
問題 | No.2673 A present from B |
ユーザー |
![]() |
提出日時 | 2024-03-16 12:51:18 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 235 ms / 2,000 ms |
コード長 | 2,273 bytes |
コンパイル時間 | 6,747 ms |
コンパイル使用メモリ | 344,096 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-09-30 03:56:06 |
合計ジャッジ時間 | 8,373 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("Ofast,unroll-loops")#include <bits/stdc++.h>#define rep(i, n) for (int i = 0; i < n; i++)#define per(i, n) for (int i = n - 1; i >= 0; i--)#define ALL(a) a.begin(), a.end()using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using mint = atcoder::modint998244353;istream &operator>>(istream &is, mint &a){int t;is >> t;a = t;return is;}ostream &operator<<(ostream &os, mint a){return os << a.val();}#endiftypedef long double ldouble;#undef long#define long long long#define vec vectortemplate <typename T>ostream &operator<<(ostream &os, vector<T> &a){const int n = a.size();rep(i, n){os << a[i];if (i + 1 != n)os << " ";}return os;}template <typename T, size_t n>ostream &operator<<(ostream &os, array<T, n> &a){rep(i, n) os << a[i] << " \n"[i + 1 == n];return os;}template <typename T>istream &operator>>(istream &is, vector<T> &a){for (T &i : a)is >> i;return is;}template <typename T, typename S>bool chmin(T &x, S y){if (x > (T)y){x = (T)y;return true;}return false;}template <typename T, typename S>bool chmax(T &x, S y){if (x < (T)y){x = (T)y;return true;}return false;}template <typename T>void operator++(vector<T> &a){for (T &i : a)++i;}template <typename T>void operator--(vector<T> &a){for (T &i : a)--i;}template <typename T>void operator++(vector<T> &a, int){for (T &i : a)i++;}template <typename T>void operator--(vector<T> &a, int){for (T &i : a)i--;}#undef endl#define endl '\n'void solve(){int n, m;cin >> n >> m;vec<int> a(m);cin >> a;a--;constexpr int inf = 1e9;int val;for (int idx = 1; idx < n; idx++){vec<int> dp(n);rep(i, n) dp[i] = abs(i - idx);for (int i : a){swap(dp[i], dp[i + 1]);val = inf;rep(j, n){chmin(val, dp[j] - j);chmin(dp[j], val + j);}val = inf;per(j, n){chmin(val, dp[j] + j);chmin(dp[j], val - j);}}cout << dp[0] << ' ';}}int main(){// srand((unsigned)time(NULL));cin.tie(nullptr);ios::sync_with_stdio(false);// cout << fixed << setprecision(40);int t = 1;// cin >> t;while (t--)solve();return 0;}