結果
問題 | No.1268 Fruit Rush 2 |
ユーザー |
|
提出日時 | 2024-06-29 02:27:35 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 258 ms / 2,000 ms |
コード長 | 2,585 bytes |
コンパイル時間 | 3,958 ms |
コンパイル使用メモリ | 155,108 KB |
実行使用メモリ | 29,952 KB |
最終ジャッジ日時 | 2024-06-29 02:27:45 |
合計ジャッジ時間 | 9,960 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 |
ソースコード
#include <algorithm>#include <cassert>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <iostream>#include <numeric>#include <vector>#include <map>#include <set>#include <queue>#include <functional>#include <iomanip>using namespace std;using ll = long long;class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}";}template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}";}template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", ";return os << "}"; }template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; }#ifdef ONLINE_JUDGE#define dump(expr) ;#else#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }#endifnamespace solver {template<typename T1, typename T2> struct In2 {T1 a; T2 b;friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; }};template<typename T1, typename T2, typename T3> struct In3 {T1 a; T2 b; T3 c;friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; }};ll n;vector<ll> vs;void read() {cin >> n;take(vs, n);}using RetType = ll;RetType run() {map<ll, ll> dp;ranges::sort(vs);for (ll i = n - 1; i >= 0; --i) {dp[vs[i]] = dp[vs[i] + 2] + 1;}ll res = n;for (ll i : range(1, n)) if (vs[i - 1] + 1 == vs[i]) {res += dp[vs[i]];}return res;}} // namespacetemplate <typename F>void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; }int main(int argc, char** argv) {cerr << fixed << setprecision(12);cout << fixed << setprecision(12);int testcase = 1;if (argc > 1) testcase = atoi(argv[1]);while (testcase--) {solver::read();}run(solver::run);}