#959875 (C++23) No.2673 A present from B

• 問題: No.2673 A present from B
• ユーザー: 遭難者
• 提出日時: 2024-03-15 21:26:22
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 2,184 bytes
• コンパイル時間: 7,399 ms
• コンパイル使用メモリ: 344,828 KB
• 実行使用メモリ: 6,676 KB
• 最終ジャッジ日時: 2024-03-15 21:26:32
• 合計ジャッジ時間: 9,444 ms
• ジャッジサーバーID （参考情報）: judge12 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	2 ms; 6,676 KB
testcase_02	AC	2 ms; 6,676 KB
testcase_03	AC	2 ms; 6,676 KB
testcase_04	AC	2 ms; 6,676 KB
testcase_05	AC	1 ms; 6,676 KB
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	AC	2 ms; 6,676 KB
testcase_10	AC	2 ms; 6,676 KB
testcase_11	AC	2 ms; 6,676 KB
testcase_12	AC	42 ms; 6,676 KB
testcase_13	AC	22 ms; 6,676 KB
testcase_14	AC	76 ms; 6,676 KB
testcase_15	AC	17 ms; 6,676 KB
testcase_16	AC	16 ms; 6,676 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	3 ms; 6,676 KB
testcase_20	AC	64 ms; 6,676 KB
testcase_21	WA	-
testcase_22	AC	2 ms; 6,676 KB
testcase_23	AC	1 ms; 6,676 KB
testcase_24	WA	-
testcase_25	AC	2 ms; 6,676 KB
testcase_26	AC	2 ms; 6,676 KB

ソースコード

#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();
}
#endif
typedef long double ldouble;
#undef long
#define long long long
#define vec vector
template <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;
	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]);
			rep(j, n) chmin(dp[j], dp[i] + abs(j - i));
			rep(j, n) chmin(dp[j], dp[i + 1] + abs(j - i - 1));
		}
		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;
}