結果

問題 No.1077 Noelちゃんと星々4
ユーザー ThistleThistle
提出日時 2020-06-12 21:58:01
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 265 ms / 2,000 ms
コード長 5,383 bytes
コンパイル時間 1,875 ms
コンパイル使用メモリ 130,572 KB
実行使用メモリ 248,808 KB
最終ジャッジ日時 2024-06-24 04:58:00
合計ジャッジ時間 5,402 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
17,384 KB
testcase_01 AC 10 ms
17,128 KB
testcase_02 AC 182 ms
175,336 KB
testcase_03 AC 232 ms
221,676 KB
testcase_04 AC 67 ms
78,564 KB
testcase_05 AC 51 ms
62,312 KB
testcase_06 AC 92 ms
96,236 KB
testcase_07 AC 103 ms
107,372 KB
testcase_08 AC 72 ms
82,660 KB
testcase_09 AC 61 ms
72,556 KB
testcase_10 AC 225 ms
222,440 KB
testcase_11 AC 148 ms
148,332 KB
testcase_12 AC 124 ms
125,672 KB
testcase_13 AC 49 ms
58,216 KB
testcase_14 AC 222 ms
217,324 KB
testcase_15 AC 119 ms
122,216 KB
testcase_16 AC 74 ms
84,964 KB
testcase_17 AC 133 ms
136,168 KB
testcase_18 AC 227 ms
226,152 KB
testcase_19 AC 46 ms
58,220 KB
testcase_20 AC 8 ms
11,808 KB
testcase_21 AC 265 ms
248,808 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
In function 'bool chmin(T&, const T&) [with T = long long int]',
    inlined from 'int main()' at main.cpp:168:22:
main.cpp:70:55: warning: iteration 30000 invokes undefined behavior [-Waggressive-loop-optimizations]
   70 | template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
      |                                                     ~~^~~
main.cpp: In function 'int main()':
main.cpp:45:40: note: within this loop
   45 | #define rng(i,s,n) for(int i = (s) ; i < (n) ; i++)
      |                                        ^
main.cpp:46:18: note: in expansion of macro 'rng'
   46 | #define rep(i,n) rng(i, 0, (n))
      |                  ^~~
main.cpp:168:9: note: in expansion of macro 'rep'
  168 |         rep(i, 300000) chmin(ans, dp[n - 1][i]);
      |         ^~~
main.cpp:156:41: warning: iteration 30000 invokes undefined behavior [-Waggressive-loop-optimizations]
  156 |                 rep(j, 300000) dp[i][j] = inf;
      |                                ~~~~~~~~~^~~~~
main.cpp:45:40: note: within this loop
   45 | #define rng(i,s,n) for(int i = (s) ; i < (n) ; i++)
      |                                        ^
main.cpp:46:18: note: in expansion of macro 'rng'
   46 | #define rep(i,n) rng(i, 0, (n))
      |                  ^~~
main.cpp:156:17: note: in expansion of macro 'rep'
  156 |                 rep(j, 300000) dp[i][j] = inf;
      |                 ^~~

ソースコード

diff # 

#pragma GCC target ("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define C complex<ld>
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define rng(i,s,n) for(int i = (s) ; i < (n) ; i++)
#define rep(i,n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define vi vec<int>
#define pb emplace_back
#define siz(a) (int)(a).size()
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) lower_bound(all(b),(i))-b.begin()
#define ssp(i,n) (i==(int)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) int quetimes_=(n);rep(qq123_,quetimes_)
#define gcj printf("Case #%lld: ",qq123_+1)
#define readv(a,n) a.resize(n,0);rep(i,(n)) a[i]=read()
//#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
constexpr int dx[] = { -1,1,0,0 }, dy[] = { 0,0,-1,1 };
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(bool g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }
bool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll popcount(ll x) {
	int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
	return sum;
}
class mint {
public:ll v;
	  mint(ll v = 0) { s(v % mod); }
	  constexpr static int mod = 1e9 + 7;
	  constexpr static int fn_ = 500005;
	  static mint fact[fn_], comp[fn_];
	  mint pow(mint x) const {
		  mint b(v), c(1);
		  while (x.v) {
			  if (x.v & 1) c *= b;
			  b *= b;
			  x.v >>= 1;
		  }
		  return c;
	  }
	  inline mint& s(int vv) {
		  v = vv < mod ? vv : vv - mod;
		  return *this;
	  }
	  inline mint inv()const { return pow(mod - 2); }
	  inline mint operator-()const { return mint() - *this; }
	  inline mint& operator+=(const mint b) { return s(v + b.v); }
	  inline mint& operator-=(const mint b) { return s(v + mod - b.v); }
	  inline mint& operator*=(const mint b) { v = v * b.v % mod; return *this; }
	  inline mint& operator/=(const mint b) { return (*this) *= b.inv(); }
	  inline mint operator+(const mint b) const { return mint(v) += b; }
	  inline mint operator-(const mint b) const { return mint(v) -= b; }
	  inline mint operator*(const mint b) const { return mint(v) *= b; }
	  inline mint operator/(const mint b) const { return mint(v) /= b; }
	  friend ostream& operator<<(ostream& os, const mint& m) {
		  return os << m.v;
	  }
	  friend istream& operator>>(istream& is, mint& m) {
		  int x; is >> x; m = mint(x);
		  return is;
	  }
	  bool operator<(const mint& r)const { return v < r.v; }
	  bool operator>(const mint& r)const { return v > r.v; }
	  bool operator<=(const mint& r)const { return v <= r.v; }
	  bool operator>=(const mint& r)const { return v >= r.v; }
	  bool operator==(const mint& r)const { return v == r.v; }
	  bool operator!=(const mint& r)const { return v != r.v; }
	  explicit operator bool()const { return v; }
	  explicit operator int()const { return v; }
	  mint comb(mint k) {
		  if (k > * this) return mint();
		  if (!fact[0]) combinit();
		  if (v >= fn_) {
			  if (k > * this - k) k = *this - k;
			  mint tmp(1);
			  for (int i = v; i >= v - k.v + 1; i--) tmp *= mint(i);
			  return tmp * comp[k.v];
		  }
		  else return fact[v] * comp[k.v] * comp[v - k.v];
	  }//nCk
	  static void combinit() {
		  fact[0] = 1;
		  for (int i = 1; i < fn_; i++) fact[i] = fact[i - 1] * mint(i);
		  comp[fn_ - 1] = fact[fn_ - 1].inv();
		  for (int i = fn_ - 2; i >= 0; i--) comp[i] = comp[i + 1] * mint(i + 1);
	  }
}; mint mint::fact[fn_], mint::comp[fn_];
//--------------------------------------------------------------
int n;
int y[2000];
int dp[2000][30000];
signed main() {
	cin >> n;
	rep(i, n) cin >> y[i];
	int mn = y[0];
	rep(i, n) chmin(mn, y[i] - i);
	rep(i, 30000) {
		dp[0][i] = abs((i - mn) - (y[0] - mn));
	}
	rng(i,1, n) {
		rep(j, 300000) dp[i][j] = inf;

		int tmp = inf;
		rep(j, 30000) {
			chmin(tmp, dp[i - 1][j]);


			chmin(dp[i][j], tmp + abs((j - mn) - (y[i] - mn)));
		}
	}

	int ans = inf;
	rep(i, 300000) chmin(ans, dp[n - 1][i]);
	cout << ans << endl;
}
0