結果
問題 | No.2673 A present from B |
ユーザー |
![]() |
提出日時 | 2024-03-15 21:57:12 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,980 bytes |
コンパイル時間 | 2,264 ms |
コンパイル使用メモリ | 206,480 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-09-30 01:05:01 |
合計ジャッジ時間 | 13,423 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 21 TLE * 3 |
ソースコード
#pragma GCC optimize("O2")#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cctype>#include <cfenv>#include <cfloat>#include <chrono>#include <cinttypes>#include <climits>#include <cmath>#include <complex>#include <cstdarg>#include <cstddef>#include <cstdint>#include <cstdio>#include <cstdlib>#include <cstring>#include <deque>#include <fstream>#include <functional>#include <initializer_list>#include <iomanip>#include <ios>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <map>#include <memory>#include <new>#include <numeric>#include <ostream>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <streambuf>#include <string>#include <tuple>#include <type_traits>#include <variant>#if __cplusplus >= 202002L#include <bit>#include <compare>#include <concepts>#include <numbers>#include <ranges>#include <span>#else#define ssize(v) (int)(v).size()#define popcount(x) __builtin_popcountll(x)constexpr int bit_width(const unsigned int x) { return x == 0 ? 0 : ((sizeof(unsigned int) * CHAR_BIT) - __builtin_clz(x)); }constexpr int bit_width(const unsigned long long x) { return x == 0 ? 0 : ((sizeof(unsigned long long) * CHAR_BIT) - __builtin_clzll(x)); }constexpr int countr_zero(const unsigned int x) { return x == 0 ? sizeof(unsigned int) * CHAR_BIT : __builtin_ctz(x); }constexpr int countr_zero(const unsigned long long x) { return x == 0 ? sizeof(unsigned long long) * CHAR_BIT : __builtin_ctzll(x); }constexpr unsigned int bit_ceil(const unsigned int x) { return x == 0 ? 1 : (popcount(x) == 1 ? x : (1u << bit_width(x))); }constexpr unsigned long long bit_ceil(const unsigned long long x) { return x == 0 ? 1 : (popcount(x) == 1 ? x : (1ull << bit_width(x))); }#endif//#define int ll#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)#define INT128_MIN (-INT128_MAX - 1)#define clock chrono::steady_clock::now().time_since_epoch().count()#ifdef DEBUG#define dbg(x) cout << (#x) << " = " << x << '\n'#else#define dbg(x)#endifusing namespace std;using ll = long long;using ull = unsigned long long;using ldb = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;//#define double ldbtemplate<class T>ostream& operator<<(ostream& os, const pair<T, T> pr) {return os << pr.first << ' ' << pr.second;}template<class T, size_t N>ostream& operator<<(ostream& os, const array<T, N> &arr) {for(const T &X : arr)os << X << ' ';return os;}template<class T>ostream& operator<<(ostream& os, const vector<T> &vec) {for(const T &X : vec)os << X << ' ';return os;}template<class T>ostream& operator<<(ostream& os, const set<T> &s) {for(const T &x : s)os << x << ' ';return os;}signed main() {ios::sync_with_stdio(false), cin.tie(NULL);int n, m; cin >> n >> m;vector<int> a(m);for(int &x : a) {cin >> x;x--;}a.emplace_back(-2);for(int k = 1; k < n; k++) {vector<int> dp(n, INT_MAX);dp[k] = 0;for(int x : a) {vector<int> ord(n);iota(ord.begin(), ord.end(), 0);sort(ord.begin(), ord.end(), [&](int i, int j) { return dp[i] < dp[j]; });for(int i : ord) {if (dp[i] == INT_MAX) continue;{int j = i + 1;while(j < n and dp[j - 1] + 1 < dp[j])dp[j] = dp[j - 1] + 1, j++;}{int j = i - 1;while(j >= 0 and dp[j + 1] + 1 < dp[j])dp[j] = dp[j + 1] + 1, j--;}}vector<int> nxt(n, INT_MAX);for(int i = 0; i < n; i++) {if (x == i - 1) nxt[i - 1] = min(dp[i], nxt[i - 1]);else if (x == i) nxt[i + 1] = min(dp[i], nxt[i + 1]);else nxt[i] = min(nxt[i], dp[i]);}dp.swap(nxt);}cout << dp[0] << " \n"[k + 1 == n];}return 0;}