結果
問題 | No.1077 Noelちゃんと星々4 |
ユーザー |
|
提出日時 | 2020-06-13 00:03:14 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 89 ms / 2,000 ms |
コード長 | 1,548 bytes |
コンパイル時間 | 1,513 ms |
コンパイル使用メモリ | 128,956 KB |
最終ジャッジ日時 | 2025-01-11 03:17:10 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:49:79: warning: ignoring return value of ‘std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = long long int; _Alloc = std::allocator<long long int>; reference = long long int&; size_type = long unsigned int]’, declared with attribute ‘nodiscard’ [-Wunused-result] 49 | vector<ll> y(n); for (int i = 0; i < n; i++) scanf("%lld", &y[i]), y[i]; | ^ In file included from /usr/include/c++/13/vector:66, from /usr/include/c++/13/queue:63, from main.cpp:8: /usr/include/c++/13/bits/stl_vector.h:1126:7: note: declared here 1126 | operator[](size_type __n) _GLIBCXX_NOEXCEPT | ^~~~~~~~ main.cpp:46:20: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 46 | ll n; scanf("%lld", &n); | ~~~~~^~~~~~~~~~~~ main.cpp:49:59: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 49 | vector<ll> y(n); for (int i = 0; i < n; i++) scanf("%lld", &y[i]), y[i]; | ~~~~~^~~~~~~~~~~~~~~
ソースコード
#include <cstdio>#include <iostream>#include <string>#include <sstream>#include <stack>#include <algorithm>#include <cmath>#include <queue>#include <map>#include <set>#include <cstdlib>#include <bitset>#include <tuple>#include <assert.h>#include <deque>#include <bitset>#include <iomanip>#include <limits>#include <chrono>#include <random>#include <array>#include <unordered_map>#include <functional>#include <complex>#include <numeric>template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }constexpr long long MAX = 5100000;constexpr long long INF = 1LL << 60;constexpr int inf = 1000000007;constexpr long long mod = 1000000007LL;//constexpr long long mod = 998244353LL;const long double PI = acos((long double)(-1));using namespace std;typedef unsigned long long ull;typedef long long ll;typedef long double ld;int main(){/*cin.tie(nullptr);ios::sync_with_stdio(false);*/ll n; scanf("%lld", &n);const ll mx = 10000;vector<vector<ll>> dp(n, vector<ll>(mx + 1, INF));vector<ll> y(n); for (int i = 0; i < n; i++) scanf("%lld", &y[i]), y[i];for (int i = 0; i <= mx; i++) dp[0][i] = llabs(i - y[0]);for (int i = 1; i < n; i++) {ll mn = INF;for (int j = 0; j <= mx; j++) {chmin(mn, dp[i - 1][j]);chmin(dp[i][j], mn + llabs(y[i] - j));}}ll res = INF;for (int i = 0; i <= mx; i++) chmin(res, dp[n - 1][i]);cout << res << endl;return 0;}