Submission #1317795
Source Code Expand
// clang-format off #include <bits/stdc++.h> #define int long long #define main signed main() // #define main int main() #define bye return 0 #define loop(i, a, n) for (int i = (a); i < (n); i++) #define rep(i, n) loop(i, 0, n) #define all(v) (v).begin(), (v).end() #define rall(v) (v).rbegin(), (v).rend() #define prec(n) fixed << setprecision(n) #define stlice(from, to) substr(from, (to) - (from) + 1) #define min(...) min({__VA_ARGS__}) #define max(...) max({__VA_ARGS__}) #define pb push_back #define mp make_pair #define mt make_tuple #define fi first #define se second using namespace std; using pii = pair<int, int>; using vi = vector<int>; using vd = vector<double>; using vb = vector<bool>; using vvi = vector<vi>; using vc = vector<char>; using vs = vector<string>; using vpii = vector<pii>; template<typename A> using fn = function<A>; constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000; constexpr int MOD = 1000000007; constexpr double PI = acos(-1); constexpr int dx[4] = {0, 0, -1, 1}, dy[4] = {-1, 1, 0, 0}; template<typename A, typename B> bool cmin(A &a, const B &b) { if (a > b) { a = b; return true; } else return false; } template<typename A, typename B> bool cmax(A &a, const B &b) { if (a < b) { a = b; return true; } else return false; } namespace ftl { template<typename V, typename F> constexpr V fmap(V v, const F &f) { transform(all(v), v.begin(), f); return v; } template<typename V, typename F> constexpr V filterNot(V v, const F &f) { v.erase(remove_if(all(v), f), v.end()); return v; } template<typename V, typename F> constexpr V filter(V v, const F &f) { return filterNot(v, [&](typename V::value_type x) { return !f(x); }); } template<typename X, typename V, typename F> constexpr X fold(const X &x, const V &v, const F &f) { return accumulate(all(v), x, f); } template<typename V> constexpr typename V::value_type sum(const V &v) { return accumulate(all(v), 0); } constexpr bool odd(const int &n) { return n & 1; } constexpr bool even(const int &n) { return !odd(n); } template<typename V, typename F> constexpr bool andall(const V &v, const F &f) { bool b = true; for (auto &p : v) b &= f(p); return b; } template<typename V, typename F> constexpr bool orany(const V &v, const F &f) { bool b = false; for (auto &p : v) b |= f(p); return b; } constexpr int gcd(int a, int b) { int c = 0; while (a) { c = a; a = b % a; b = c; } return b; } constexpr int pows(int a, int b) { int c = 1; while (b) { if (odd(b)) c *= a; b >>= 1; a *= a; } return c; } } using namespace ftl; // clang-format on main { int n; cin >> n; vi d(n); rep(i, n) cin >> d[i]; int s = sum(d); cout << s << endl << max(0LL, *max_element(all(d)) * 2 - s) << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 2点間距離の最大と最小 ( Maximum and Minimum ) |
User | AyaMorisawa |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2810 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 02_rnd2_00.txt, 02_rnd2_01.txt, 02_rnd2_02.txt, 02_rnd2_03.txt, 02_rnd2_04.txt, 02_rnd2_05.txt, 02_rnd2_06.txt, 02_rnd2_07.txt, 02_rnd2_08.txt, 02_rnd2_09.txt, 02_rnd2_10.txt, 02_rnd2_11.txt, 02_rnd2_12.txt, 02_rnd2_13.txt, 02_rnd2_14.txt, 02_rnd2_15.txt, 02_rnd2_16.txt, 02_rnd2_17.txt, 02_rnd2_18.txt, 02_rnd2_19.txt, 02_rnd2_20.txt, 02_rnd2_21.txt, 02_rnd2_22.txt, 02_rnd2_23.txt, 02_rnd2_24.txt, 02_rnd2_25.txt, 02_rnd2_26.txt, 02_rnd2_27.txt, 02_rnd2_28.txt, 02_rnd2_29.txt, 03_max_00.txt, 03_max_01.txt, 03_max_02.txt, 03_max_03.txt, 03_max_04.txt, 03_max_05.txt, 03_max_06.txt, 03_max_07.txt, 03_max_08.txt, 03_max_09.txt, 04_maxret_01.txt, 04_maxret_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 1 ms | 256 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
00_sample_03.txt | AC | 1 ms | 256 KB |
00_sample_04.txt | AC | 1 ms | 256 KB |
00_sample_05.txt | AC | 1 ms | 256 KB |
01_rnd_00.txt | AC | 1 ms | 256 KB |
01_rnd_01.txt | AC | 1 ms | 256 KB |
01_rnd_02.txt | AC | 1 ms | 256 KB |
01_rnd_03.txt | AC | 1 ms | 256 KB |
01_rnd_04.txt | AC | 1 ms | 256 KB |
01_rnd_05.txt | AC | 1 ms | 256 KB |
01_rnd_06.txt | AC | 1 ms | 256 KB |
01_rnd_07.txt | AC | 1 ms | 256 KB |
01_rnd_08.txt | AC | 1 ms | 256 KB |
01_rnd_09.txt | AC | 1 ms | 256 KB |
01_rnd_10.txt | AC | 1 ms | 256 KB |
01_rnd_11.txt | AC | 1 ms | 256 KB |
01_rnd_12.txt | AC | 1 ms | 256 KB |
01_rnd_13.txt | AC | 1 ms | 256 KB |
01_rnd_14.txt | AC | 1 ms | 256 KB |
01_rnd_15.txt | AC | 1 ms | 256 KB |
02_rnd2_00.txt | AC | 1 ms | 256 KB |
02_rnd2_01.txt | AC | 1 ms | 256 KB |
02_rnd2_02.txt | AC | 1 ms | 256 KB |
02_rnd2_03.txt | AC | 1 ms | 256 KB |
02_rnd2_04.txt | AC | 1 ms | 256 KB |
02_rnd2_05.txt | AC | 1 ms | 256 KB |
02_rnd2_06.txt | AC | 1 ms | 256 KB |
02_rnd2_07.txt | AC | 1 ms | 256 KB |
02_rnd2_08.txt | AC | 1 ms | 256 KB |
02_rnd2_09.txt | AC | 1 ms | 256 KB |
02_rnd2_10.txt | AC | 1 ms | 256 KB |
02_rnd2_11.txt | AC | 1 ms | 256 KB |
02_rnd2_12.txt | AC | 1 ms | 256 KB |
02_rnd2_13.txt | AC | 1 ms | 256 KB |
02_rnd2_14.txt | AC | 1 ms | 256 KB |
02_rnd2_15.txt | AC | 1 ms | 256 KB |
02_rnd2_16.txt | AC | 1 ms | 256 KB |
02_rnd2_17.txt | AC | 1 ms | 256 KB |
02_rnd2_18.txt | AC | 1 ms | 256 KB |
02_rnd2_19.txt | AC | 1 ms | 256 KB |
02_rnd2_20.txt | AC | 1 ms | 256 KB |
02_rnd2_21.txt | AC | 1 ms | 256 KB |
02_rnd2_22.txt | AC | 1 ms | 256 KB |
02_rnd2_23.txt | AC | 1 ms | 256 KB |
02_rnd2_24.txt | AC | 1 ms | 256 KB |
02_rnd2_25.txt | AC | 1 ms | 256 KB |
02_rnd2_26.txt | AC | 1 ms | 256 KB |
02_rnd2_27.txt | AC | 1 ms | 256 KB |
02_rnd2_28.txt | AC | 1 ms | 256 KB |
02_rnd2_29.txt | AC | 1 ms | 256 KB |
03_max_00.txt | AC | 1 ms | 256 KB |
03_max_01.txt | AC | 1 ms | 256 KB |
03_max_02.txt | AC | 1 ms | 256 KB |
03_max_03.txt | AC | 1 ms | 256 KB |
03_max_04.txt | AC | 1 ms | 256 KB |
03_max_05.txt | AC | 1 ms | 256 KB |
03_max_06.txt | AC | 1 ms | 256 KB |
03_max_07.txt | AC | 1 ms | 256 KB |
03_max_08.txt | AC | 1 ms | 256 KB |
03_max_09.txt | AC | 1 ms | 256 KB |
04_maxret_01.txt | AC | 1 ms | 256 KB |
04_maxret_02.txt | AC | 1 ms | 256 KB |