結果

問題 No.1179 Quadratic Equation
ユーザー nullnull
提出日時 2020-08-21 22:27:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,715 bytes
コンパイル時間 1,386 ms
コンパイル使用メモリ 139,212 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-15 05:55:32
合計ジャッジ時間 1,979 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 1 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 WA -
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/algorithm:60,
                 from main.cpp:13:
In function 'constexpr const _Tp& std::min(const _Tp&, const _Tp&) [with _Tp = long double]',
    inlined from 'int main()' at main.cpp:137:32:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:235:7: warning: 'ans2' may be used uninitialized [-Wmaybe-uninitialized]
  235 |       if (__b < __a)
      |       ^~
main.cpp: In function 'int main()':
main.cpp:125:144: note: 'ans2' was declared here
  125 |                 long double left = -31415926315, right = 31415926315, mid, middle = -(long double)b / (long double)2.0 / (long double)a, ans1, ans2, aa = a, bb = b, cc = c;
      |                                                                                                                                                ^~~~
In function 'constexpr const _Tp& std::min(const _Tp&, const _Tp&) [with _Tp = long double]',
    inlined from 'int main()' at main.cpp:137:32:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:235:7: warning: 'ans1' may be used uninitialized [-Wmaybe-uninitialized]
  235 |       if (__b < __a)
      |       ^~
main.cpp: In function 'int main()':
main.cpp:125:138: note: 'ans1' was declared here
  125 |                 long double left = -31415926315, right = 31415926315, mid, middle = -(long double)b / (long double)2.0 / (long double)a, ans1, ans2, aa = a, bb = b, cc = c;
      |                                                                                                                                          ^~~~

ソースコード

diff # 

/*
このコード、と～おれ!
Be accepted!
∧＿∧　
（｡･ω･｡)つ━☆・*。
⊂　　 ノ 　　　・゜+.
　しーＪ　　　°。+ *´¨)
 　　　　　　　　　.· ´¸.·*´¨) ¸.·*¨)
		  　　　　　　　　　　(¸.·´ (¸.·'* ☆
*/

#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <functional>
#include <complex>
#include <list>
#include <cassert>
#include <iomanip>
#include <set>
#include <stack>
#include <bitset>

////多倍長整数, cpp_intで宣言
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;

//#pragma GCC target ("avx2")
//#pragma GCC optimization ("Ofast")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define repeat(i, n, m) for(int i = n; i < (m); ++i)
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printim(a) printf(a ? "possible\n" : "imposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printLdb(a) printf("%.50Lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) //string出力
#define all(x) (x).begin(), (x).end()
#define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI)
#define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L)
#define Please return
#define AC 0
#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d)) /*(a, b) から (c, d) のマンハッタン距離 */
#define inf numeric_limits<double>::infinity();
#define linf numeric_limits<long double>::infinity()

using ll = long long;
using ull = unsigned long long;

constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1e9 + 7;
constexpr ll mod = 998244353;
constexpr long double eps = 1e-6;
const long double PI = acosl(-1.0L);

using namespace std;

void scans(string& str) {
	char c;
	str = "";
	scanf("%c", &c);
	if (c == '\n')scanf("%c", &c);
	while (c != '\n' && c != -1 && c != ' ') {
		str += c;
		scanf("%c", &c);
	}
}

void scanc(char& str) {
	char c;
	scanf("%c", &c);
	if (c == -1)return;
	while (c == '\n') {
		scanf("%c", &c);
	}
	str = c;
}


double acot(double x) {
	return PI / 2 - atan(x);
}

ll LSB(ll n) { return (n & (-n)); }

template<typename T>
inline T chmin(T& a, const T& b) {
	if (a > b)a = b;
	return a;
}

template<typename T>
inline T chmax(T& a, const T& b) {
	if (a < b)a = b;
	return a;
}

/*-----------------------------------------ここからコード-----------------------------------------*/



int main() {

	int a, b, c;
	scanf("%d%d%d", &a, &b, &c);
	if (b * b - 4 * a * c < 0)puts("imaginary");
	else if (b * b - 4 * a * c == 0)printLdb(-(long double)b / (long double)2.0 / (long double)a + 0.0000001);
	else {
		long double left = -31415926315, right = 31415926315, mid, middle = -(long double)b / (long double)2.0 / (long double)a, ans1, ans2, aa = a, bb = b, cc = c;
		mid = middle;
		while (abs(left - mid) > 0.0000001) {
			ans1 = (left + mid) / 2.0;
			if (ans1 * ans1 * aa + bb * ans1 + cc >= 0)left = ans1;
			else mid = ans1;
		}
		while (abs(right - middle) > 0.0000001) {
			ans2 = (right + middle) / 2.0;
			if (ans2 * ans2 * aa + bb * ans2 + cc >= 0)right = ans2;
			else middle = ans2;
		}
		printf("%.50Lf %.50Lf\n", min(ans1, ans2), max(ans1, ans2));
	}

	Please AC;
}
0