#411554 (C++14) No.955 ax^2+bx+c=0

提出ソース

結果

問題	No.955 ax^2+bx+c=0
ユーザー	ningenMe
提出日時	2019-12-24 01:17:12
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	3,092 bytes
コンパイル時間	1,365 ms
コンパイル使用メモリ	168,512 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-09-19 05:44:30
合計ジャッジ時間	3,802 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,816 KB
testcase_01	AC	1 ms 6,940 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	1 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	1 ms 6,940 KB
testcase_09	AC	1 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	1 ms 6,944 KB
testcase_12	AC	1 ms 6,940 KB
testcase_13	AC	1 ms 6,944 KB
testcase_14	AC	1 ms 6,940 KB
testcase_15	AC	1 ms 6,944 KB
testcase_16	AC	1 ms 6,944 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	2 ms 6,944 KB
testcase_19	AC	2 ms 6,940 KB
testcase_20	AC	1 ms 6,940 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	2 ms 6,944 KB
testcase_23	AC	2 ms 6,940 KB
testcase_24	AC	1 ms 6,944 KB
testcase_25	AC	1 ms 6,940 KB
testcase_26	AC	1 ms 6,940 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	1 ms 6,944 KB
testcase_29	AC	1 ms 6,940 KB
testcase_30	AC	1 ms 6,940 KB
testcase_31	AC	2 ms 6,944 KB
testcase_32	AC	1 ms 6,944 KB
testcase_33	AC	2 ms 6,944 KB
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	WA	-
testcase_50	WA	-
testcase_51	WA	-
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	AC	2 ms 6,940 KB
testcase_59	WA	-
testcase_60	AC	2 ms 6,944 KB
testcase_61	AC	2 ms 6,944 KB
testcase_62	AC	2 ms 6,940 KB
testcase_63	WA	-
testcase_64	AC	1 ms 6,944 KB
testcase_65	WA	-
testcase_66	AC	1 ms 6,940 KB
testcase_67	AC	2 ms 6,944 KB
testcase_68	AC	2 ms 6,944 KB
testcase_69	AC	2 ms 6,940 KB
testcase_70	WA	-
testcase_71	AC	2 ms 6,944 KB
testcase_72	AC	1 ms 6,940 KB
testcase_73	AC	1 ms 6,940 KB
testcase_74	AC	1 ms 6,944 KB
testcase_75	AC	2 ms 6,940 KB
testcase_76	AC	1 ms 6,940 KB
testcase_77	WA	-
testcase_78	WA	-
testcase_79	WA	-
testcase_80	AC	2 ms 6,940 KB
testcase_81	AC	2 ms 6,944 KB
testcase_82	AC	1 ms 6,940 KB
testcase_83	AC	1 ms 6,940 KB
testcase_84	AC	2 ms 6,940 KB
testcase_85	AC	2 ms 6,944 KB
testcase_86	AC	1 ms 6,940 KB
testcase_87	AC	2 ms 6,944 KB
testcase_88	AC	2 ms 6,940 KB
testcase_89	AC	2 ms 6,944 KB
testcase_90	AC	1 ms 6,944 KB
testcase_91	AC	2 ms 6,940 KB
testcase_92	AC	1 ms 6,940 KB
testcase_93	AC	2 ms 6,944 KB
testcase_94	AC	1 ms 6,940 KB
testcase_95	AC	2 ms 6,940 KB
testcase_96	AC	1 ms 6,940 KB
testcase_97	AC	1 ms 6,944 KB
testcase_98	AC	1 ms 6,944 KB
testcase_99	AC	2 ms 6,944 KB
testcase_100	AC	2 ms 6,940 KB
testcase_101	AC	2 ms 6,944 KB
testcase_102	AC	2 ms 6,944 KB
testcase_103	AC	1 ms 6,940 KB
testcase_104	AC	2 ms 6,940 KB
testcase_105	AC	1 ms 6,940 KB
testcase_106	AC	2 ms 6,940 KB
testcase_107	AC	2 ms 6,944 KB
testcase_108	AC	2 ms 6,944 KB
testcase_109	AC	1 ms 6,940 KB
testcase_110	AC	2 ms 6,940 KB
testcase_111	AC	1 ms 6,944 KB
testcase_112	AC	1 ms 6,944 KB
testcase_113	AC	2 ms 6,940 KB
testcase_114	AC	1 ms 6,940 KB
testcase_115	AC	2 ms 6,944 KB
testcase_116	AC	1 ms 6,944 KB
testcase_117	AC	1 ms 6,940 KB
testcase_118	AC	1 ms 6,940 KB
testcase_119	AC	1 ms 6,940 KB
testcase_120	AC	1 ms 6,944 KB
testcase_121	AC	1 ms 6,940 KB
testcase_122	AC	2 ms 6,944 KB
testcase_123	AC	1 ms 6,940 KB
testcase_124	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
 
#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
 
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
 
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
 
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}


int main() {
	long double a,b,c; cin >> a >> b >> c;
	corner(a==0&&b==0&&c==0,-1);
	corner(a==0&&b==0&&c!=0,0);
	if(a==0){
		printf("1\n%.18Lf\n",-c/b);
		return 0;
	}
	corner(b*b<4*a*c,0);
	if(b*b==4*a*c){
		printf("1\n%.18Lf\n",-b/(2*a));
		return 0;
	}
	c = b*b-4*a*c;
	printf("2\n%.18Lf\n%.18Lf\n",(-b-sqrtl(c))/(2*a),(-b+sqrtl(c))/(2*a));
	return 0;
}

yukicoder

結果

テストケース

ソースコード