結果
問題 | No.944 煎っぞ! |
ユーザー | cutmdo |
提出日時 | 2019-12-07 21:13:01 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 10 ms / 3,000 ms |
コード長 | 3,837 bytes |
コンパイル時間 | 1,210 ms |
コンパイル使用メモリ | 126,648 KB |
実行使用メモリ | 4,380 KB |
最終ジャッジ日時 | 2023-08-27 02:40:20 |
合計ジャッジ時間 | 2,961 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 8 ms
4,380 KB |
testcase_01 | AC | 8 ms
4,376 KB |
testcase_02 | AC | 8 ms
4,376 KB |
testcase_03 | AC | 8 ms
4,380 KB |
testcase_04 | AC | 8 ms
4,376 KB |
testcase_05 | AC | 8 ms
4,380 KB |
testcase_06 | AC | 8 ms
4,376 KB |
testcase_07 | AC | 8 ms
4,376 KB |
testcase_08 | AC | 8 ms
4,380 KB |
testcase_09 | AC | 7 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 3 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 3 ms
4,380 KB |
testcase_15 | AC | 2 ms
4,376 KB |
testcase_16 | AC | 2 ms
4,376 KB |
testcase_17 | AC | 2 ms
4,380 KB |
testcase_18 | AC | 3 ms
4,376 KB |
testcase_19 | AC | 3 ms
4,376 KB |
testcase_20 | AC | 8 ms
4,380 KB |
testcase_21 | AC | 9 ms
4,376 KB |
testcase_22 | AC | 8 ms
4,376 KB |
testcase_23 | AC | 8 ms
4,376 KB |
testcase_24 | AC | 8 ms
4,380 KB |
testcase_25 | AC | 8 ms
4,376 KB |
testcase_26 | AC | 8 ms
4,376 KB |
testcase_27 | AC | 9 ms
4,376 KB |
testcase_28 | AC | 2 ms
4,380 KB |
testcase_29 | AC | 2 ms
4,376 KB |
testcase_30 | AC | 8 ms
4,376 KB |
testcase_31 | AC | 10 ms
4,380 KB |
testcase_32 | AC | 9 ms
4,376 KB |
testcase_33 | AC | 9 ms
4,380 KB |
testcase_34 | AC | 9 ms
4,380 KB |
ソースコード
#include <algorithm> #include <bitset> #include <cassert> #include <cmath> #include <iomanip> #include <iostream> #include <list> #include <map> #include <numeric> #include <queue> #include <set> #include <stack> #include <string> #include <unordered_map> #include <unordered_set> #include <vector> #ifdef DEBUG #include "./CompetitiveProgrammingCpp/Timer.hpp" #include "./CompetitiveProgrammingCpp/debug.hpp" #include "./CompetitiveProgrammingCpp/sample.hpp" #else #define dump(...) template <class T> inline auto d_val(T a, T b) { return a; } #endif /* (=^o^=) */ #define int ll /* macro */ #define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i) #define RFOR(i, b, e) for (ll i = (ll)(e - 1); i >= (ll)(b); --i) #define REP(i, n) FOR(i, 0, n) #define RREP(i, n) RFOR(i, 0, n) #define REPC(x, c) for (const auto& x : (c)) #define REPI2(it, b, e) for (auto it = (b); it != (e); ++it) #define REPI(it, c) REPI2(it, (c).begin(), (c).end()) #define RREPI(it, c) REPI2(it, (c).rbegin(), (c).rend()) #define REPI_ERACE2(it, b, e) for (auto it = (b); it != (e);) #define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end()) #define ALL(x) (x).begin(), (x).end() #define cauto const auto& /* macro func */ template <class T> inline auto sort(T& t) { std::sort(ALL(t)); } template <class T> inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); } template <class T> inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); } template <class T, class S> inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; } template <class T, class S> inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; } inline auto BR() { std::cout << "\n"; } /* type define */ using ll = long long; using PAIR = std::pair<ll, ll>; using VS = std::vector<std::string>; using VL = std::vector<long long>; using VVL = std::vector<VL>; using VVVL = std::vector<VVL>; using VD = std::vector<double>; template <class T> using V = std::vector<T>; /* using std */ using std::cout; constexpr char endl = '\n'; using std::bitset; using std::cin; using std::list; using std::map; using std::multimap; using std::multiset; using std::pair; using std::priority_queue; using std::queue; using std::set; using std::stack; using std::string; using std::unordered_map; using std::unordered_multimap; using std::unordered_multiset; using std::unordered_set; using std::vector; /* constant value */ constexpr ll MOD = 1000000007; // constexpr ll MOD = 998244353; /* Initial processing */ struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; } _Preprocessing; /* Remove the source of the bug */ signed pow(signed, signed) { assert(false); return -1; } /* define hash */ namespace std { template <> class hash<std::pair<ll, ll>> { public: size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } }; } // namespace std /* input */ template <class T> std::istream& operator>>(std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; } //============================================================================================= unordered_set<ll> d(ll n) { unordered_set<ll> s; FOR(i, 1, std::sqrt(n) + 5) { if (n % i == 0) { s.emplace(i); s.emplace(n / i); } } return s; } signed main() { ll n; cin >> n; VL v(n); cin >> v; ll sum = 0; REPC(x, v) { sum += x; } auto s = d(sum); ll ans = 0; REPC(x, s) { ll now = 0; bool flg = true; REPC(t, v) { now += t; if (now == x) { now = 0; } else if (now > x) { flg = false; break; } } if (flg) { chmax(ans, sum / x); } } cout << ans << endl; }