結果
問題 | No.8072 Sum of sqrt(x) |
ユーザー | Xelmeph |
提出日時 | 2024-02-28 14:27:33 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
OLE
|
実行時間 | - |
コード長 | 4,189 bytes |
コンパイル時間 | 1,648 ms |
コンパイル使用メモリ | 139,820 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-09-29 12:21:42 |
合計ジャッジ時間 | 46,888 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,820 KB |
testcase_02 | AC | 3 ms
6,820 KB |
testcase_03 | AC | 3 ms
6,816 KB |
testcase_04 | AC | 3 ms
6,820 KB |
testcase_05 | AC | 3 ms
6,816 KB |
testcase_06 | AC | 3 ms
6,816 KB |
testcase_07 | OLE | - |
testcase_08 | OLE | - |
testcase_09 | OLE | - |
testcase_10 | OLE | - |
testcase_11 | OLE | - |
testcase_12 | OLE | - |
testcase_13 | OLE | - |
testcase_14 | OLE | - |
testcase_15 | OLE | - |
testcase_16 | OLE | - |
testcase_17 | OLE | - |
testcase_18 | OLE | - |
testcase_19 | OLE | - |
testcase_20 | OLE | - |
testcase_21 | OLE | - |
testcase_22 | OLE | - |
testcase_23 | OLE | - |
testcase_24 | OLE | - |
testcase_25 | OLE | - |
testcase_26 | OLE | - |
testcase_27 | OLE | - |
testcase_28 | OLE | - |
testcase_29 | OLE | - |
ソースコード
#include <iostream> #include <iomanip> #include <fstream> #include <string> #include <array> #include <vector> #include <deque> #include <list> #include <set> #include <map> #include <unordered_map> #include <unordered_set> #include <stack> #include <queue> #include <bitset> #include <tuple> #include <cmath> #include <complex> #include <algorithm> #include <utility> #include <regex> #include <cstdint> #include <numeric> #include <functional> #include <cassert> using namespace std; namespace utils{ #define ALL(x) begin(x), end(x) #define RALL(x) rbegin(x), rend(x) ///----- aliases using ll = long long int; using ull = unsigned long long; template<class T, class Compare> using p_queue = priority_queue<T, vector<T>, Compare>; template<class T> using min_queue = p_queue<T, greater<T>>; template<class T> using max_queue = p_queue<T, less<T>>; template<class T> inline bool CHMIN(T& X, const T& A){ if(X > A) {X = A; return true;} return false; } template<class T> inline bool CHMAX(T& X, const T& A){ if(X < A) {X = A; return true;} return false; } ///----- vector I/O template<class T> vector<T> VEC(size_t n, T t){ return vector<T>(n, t); } template<class ...Ts> auto VEC(size_t n, Ts ... ts){ return vector<decltype(VEC(ts...))>(n, VEC(ts...)); } template<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&x : v) { is >> x; } return is; } template<class T> ostream& operator<<(ostream& os, const vector<T>& v){ auto p = v.begin(); assert(p != v.end()); os << *p++; while(p != v.end()){ os << ' ' << *p++; } return os ; } template<class T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){ auto p = v.begin(); assert(p != v.end()); os << *p++; while(p != v.end()){ os << '\n' << *p++; } return os; } ///----- tuple I/O template <class S, class T> istream& operator>>(istream& is, tuple<S, T>& t){ return is >> get<0>(t) >> get<1>(t); } template <class S, class T> istream& operator>>(istream& is, pair<S, T>& t){ return is >> get<0>(t) >> get<1>(t); } template <class S, class T, class U> istream& operator>>(istream& is, tuple<S, T, U>& t){ return is >> get<0>(t) >> get<1>(t) >> get<2>(t); } template <class S, class T> ostream& operator<<(ostream& os, const tuple<S, T>& t){ return os << get<0>(t) << ' ' << get<1>(t); } template <class S, class T> ostream& operator<<(ostream& os, const pair<S, T>& t){ return os << get<0>(t) << ' ' << get<1>(t); } template <class S, class T, class U> ostream& operator<<(ostream& os, const tuple<S, T, U>& t){ return os << get<0>(t) << ' ' << get<1>(t) << ' ' << get<2>(t); } ///----- constants constexpr ll INFLL = 1'000'000'000'000'000'020ll; constexpr ll INF = 1'000'000'009; constexpr double PI = 3.14'159'265'358'979'323'846; constexpr double EPS = 1e-12; } using namespace utils; class solver{ istream& is; ostream& os; public: solver(istream& I, ostream& O) :is(I), os(O) {} vector<long double> x; bool input() { int N=0; is >> N; x.resize(N); is >> x; return !!is; } void run(); }; void solver::run(){ if(!input()) return; long double a = 0; for (auto &&xi: x) { a += sqrt(xi); os << a << '\n'; } // end xi } int main(int argc, char *argv[]) { cin.tie(nullptr); ios::sync_with_stdio(false); cout << setprecision(17) << scientific; #ifdef XELMH string test_cases = "test_a.txt"; cerr << test_cases << " -->" << endl; auto fs = fstream(test_cases, fstream::in); int loop = 0; while(fs) { loop++; cout << '#' << loop << "#------\n"; solver(fs, cout).run(); } if(loop <= 1) { cout << "===" << endl; while(cin) solver(cin, cout).run(); } #else solver(cin, cout).run(); #endif return 0; }