結果
問題 | No.1077 Noelちゃんと星々4 |
ユーザー |
![]() |
提出日時 | 2020-06-12 21:51:13 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,353 ms / 2,000 ms |
コード長 | 6,755 bytes |
コンパイル時間 | 1,325 ms |
コンパイル使用メモリ | 120,080 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-24 04:52:08 |
合計ジャッジ時間 | 15,350 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
#include<iostream>#include<string>#include<algorithm>#include<vector>#include<queue>#include<map>#include<math.h>#include<iomanip>#include<set>#include<numeric>#include<cstring>#include<cstdio>#include<functional>#include<bitset>#include<limits.h>#include<cassert>#include<iterator>#include<complex>#include<stack>#include<unordered_map>#include<unordered_set>#include<time.h>#include<random>#include<array>using namespace std;using ll = long long;#define rep(i, a, b) for(int i = a; i < b; i++)#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)#define ALL(a) a.begin(), a.end()using pii = pair<int,int>;using piii = pair<pii,int>;using pll = pair<long long, long long>;using plll = pair<pll, long long>;// #pragma GCC optimize("Ofast")#define pcnt __builtin_popcount#define buli(x) __builtin_popcountll(x)#define pb push_back#define mp make_pair#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );#define isSquare(x) (sqrt(x)*sqrt(x) == x)template<class T>inline bool chmax(T &a, const T &b) {if(a<b){a = b; return 1;} return 0; };template<class T>inline bool chmin(T &a, const T &b) {if(a>b){a = b; return 1;} return 0; };inline void in(void){return;}template <typename First, typename... Rest> void in(First& first, Rest&... rest){cin >> first;in(rest...);return;}inline void out(void){cout << "\n";return;}template <typename First, typename... Rest> void out(First first, Rest... rest){cout << first << " ";out(rest...);return;}const double EPS = 1e-9;const int mod = 1e9 + 7;// const int mod = 998244353;const int INF = 1e9;const long long INFLL = 1e18;void iosetup() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);}template< typename T1, typename T2 >ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {os << p.first << " " << p.second;return os;}template< typename T1, typename T2 >istream &operator>>(istream &is, pair< T1, T2 > &p) {is >> p.first >> p.second;return is;}template< typename T >ostream &operator<<(ostream &os, const vector< T > &v) {for(int i = 0; i < (int) v.size(); i++) {os << v[i] << (i + 1 != v.size() ? " " : "");}return os;}template< typename T >istream &operator>>(istream &is, vector< T > &v) {for(T &in : v) is >> in;return is;}template<class T> vector<T> make_vec(size_t a) {return vector<T>(a); }template<class T, class... Ts> auto make_vec(size_t a, Ts... ts){return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));}template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first+t.first, s.second+t.second);}template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first-t.first, s.second-t.second);}template<class S, class T> pair<S,T> operator*(const pair<S,T> &s, const S& t){return pair<S,T>(s.first*t, s.second*t);}template <typename T> void Exit(T first){cout << first << endl;exit(0); };template< int mod > struct ModInt {unsigned x; ModInt() : x(0) {}ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }static int get_mod() { return mod; }}; using modint = ModInt< mod >;const int dx[4] = {1, 0, -1, 0};const int dy[4] = {0, 1, 0, -1};const pii dxy[4] = {pii(1,0), pii(0, 1), pii(-1, 0), pii(0, -1)};bool range(int a, int b, int x){if(a <= x and x < b)return true;else return false;}bool range(int a, int b, int c, int d, pii p){if(a <= p.first and p.first < b and c <= p.second and p.second < d) return true;else return false;}// https://ei1333.github.io/algorithm/segment-tree.htmltemplate< typename Monoid >struct SegmentTree{using F = function< Monoid(Monoid, Monoid) >;int sz;vector< Monoid > seg;const F f;const Monoid M1;SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1){sz = 1;while(sz < n) sz <<= 1;seg.assign(2 * sz, M1);}void set(int k, const Monoid &x){seg[k + sz] = x;}void build(){for(int k = sz - 1; k > 0; k--) {seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);}}void update(int k, const Monoid &x){k += sz;seg[k] = x;while(k >>= 1) {seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);}}Monoid query(int a, int b){Monoid L = M1, R = M1;for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {if(a & 1) L = f(L, seg[a++]);if(b & 1) R = f(seg[--b], R);}return f(L, R);}Monoid operator[](const int &k) const{return seg[k + sz];}};// range min// SegmentTree< int > seg(N, [](int a, int b){ return min(a, b); }, INT_MAX);// range sum// SegmentTree< int > seg(N, [](int a, int b){ return a + b; }, 0);const int M = 10000;int main(){iosetup();int n; cin >> n;vector<int> y(n); cin >> y;SegmentTree< int > seg(M + 1, [](int a, int b){ return min(a, b); }, INT_MAX);rep(i, 0, M + 1) seg.update(i, INF);seg.update(0, 0);rep(i, 0, n){rrep(j, 0, M + 1){auto q = seg.query(0, j + 1);// if(y[i] > j) q += y[i] - j;seg.update(j, q + abs(y[i] - j));}}int ans = INF;// rep(i, 0, M + 1) cerr << seg.query(i, i + 1) << endl;rep(i, 0, M + 1) chmin(ans, seg.query(i, i + 1));cout << ans << endl;return 0;}