結果
| 問題 | No.955 ax^2+bx+c=0 |
| ユーザー |
 hirono999
|
| 提出日時 | 2021-01-03 19:31:35 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,093 bytes |
| コンパイル時間 | 3,087 ms |
| コンパイル使用メモリ | 219,100 KB |
| 実行使用メモリ | 13,760 KB |
| 最終ジャッジ日時 | 2024-10-13 13:22:59 |
| 合計ジャッジ時間 | 7,113 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | OLE | - |
| testcase_02 | -- | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
| testcase_35 | -- | - |
| testcase_36 | -- | - |
| testcase_37 | -- | - |
| testcase_38 | -- | - |
| testcase_39 | -- | - |
| testcase_40 | -- | - |
| testcase_41 | -- | - |
| testcase_42 | -- | - |
| testcase_43 | -- | - |
| testcase_44 | -- | - |
| testcase_45 | -- | - |
| testcase_46 | -- | - |
| testcase_47 | -- | - |
| testcase_48 | -- | - |
| testcase_49 | -- | - |
| testcase_50 | -- | - |
| testcase_51 | -- | - |
| testcase_52 | -- | - |
| testcase_53 | -- | - |
| testcase_54 | -- | - |
| testcase_55 | -- | - |
| testcase_56 | -- | - |
| testcase_57 | -- | - |
| testcase_58 | -- | - |
| testcase_59 | -- | - |
| testcase_60 | -- | - |
| testcase_61 | -- | - |
| testcase_62 | -- | - |
| testcase_63 | -- | - |
| testcase_64 | -- | - |
| testcase_65 | -- | - |
| testcase_66 | -- | - |
| testcase_67 | -- | - |
| testcase_68 | -- | - |
| testcase_69 | -- | - |
| testcase_70 | -- | - |
| testcase_71 | -- | - |
| testcase_72 | -- | - |
| testcase_73 | -- | - |
| testcase_74 | -- | - |
| testcase_75 | -- | - |
| testcase_76 | -- | - |
| testcase_77 | -- | - |
| testcase_78 | -- | - |
| testcase_79 | -- | - |
| testcase_80 | -- | - |
| testcase_81 | -- | - |
| testcase_82 | -- | - |
| testcase_83 | -- | - |
| testcase_84 | -- | - |
| testcase_85 | -- | - |
| testcase_86 | -- | - |
| testcase_87 | -- | - |
| testcase_88 | -- | - |
| testcase_89 | -- | - |
| testcase_90 | -- | - |
| testcase_91 | -- | - |
| testcase_92 | -- | - |
| testcase_93 | -- | - |
| testcase_94 | -- | - |
| testcase_95 | -- | - |
| testcase_96 | -- | - |
| testcase_97 | -- | - |
| testcase_98 | -- | - |
| testcase_99 | -- | - |
| testcase_100 | -- | - |
| testcase_101 | -- | - |
| testcase_102 | -- | - |
| testcase_103 | -- | - |
| testcase_104 | -- | - |
| testcase_105 | -- | - |
| testcase_106 | -- | - |
| testcase_107 | -- | - |
| testcase_108 | -- | - |
| testcase_109 | -- | - |
| testcase_110 | -- | - |
| testcase_111 | -- | - |
| testcase_112 | -- | - |
| testcase_113 | -- | - |
| testcase_114 | -- | - |
| testcase_115 | -- | - |
| testcase_116 | -- | - |
| testcase_117 | -- | - |
| testcase_118 | -- | - |
| testcase_119 | -- | - |
| testcase_120 | -- | - |
| testcase_121 | -- | - |
| testcase_122 | -- | - |
| testcase_123 | -- | - |
| testcase_124 | -- | - |
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:212:22: warning: integer overflow in expression of type 'int' results in '2147483647' [-Woverflow]
212 | ll b = (1 << 31) - 1, c = (1 << 31) - 1, a = -((1 << 31) - 1);
| ~~~~~~~~~~^~~
main.cpp:212:41: warning: integer overflow in expression of type 'int' results in '2147483647' [-Woverflow]
212 | ll b = (1 << 31) - 1, c = (1 << 31) - 1, a = -((1 << 31) - 1);
| ~~~~~~~~~~^~~
main.cpp:212:62: warning: integer overflow in expression of type 'int' results in '2147483647' [-Woverflow]
212 | ll b = (1 << 31) - 1, c = (1 << 31) - 1, a = -((1 << 31) - 1);
| ~~~~~~~~~~^~~
ソースコード
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
constexpr long long INF = 1LL << 60;
double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define to_s to_string
#define len(v) (ll)v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define drop(x) cout << (x) << '\n', exit(0)
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> tpl;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef vector<vector<vector<ll>>> vec3;
template<class S, class T> inline bool chmax(S &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class S, class T> inline bool chmin(S &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline ll msb(ll v) { return 1 << (31 - __builtin_clzll(v)); }
inline ll devc(ll x, ll y) { return (x + y - 1) / y; }
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template< typename T1, typename T2 >
ostream &operator << (ostream &os, const pair< T1, T2 > &p) {
os << p.first << " " << p.second;
return os;
}
template< typename T1, typename T2 >
istream &operator >> (istream &is, pair< T1, T2 > &p) {
is >> p.first >> p.second;
return is;
}
template< typename T1, typename T2, typename T3 >
ostream &operator << (ostream &os, const tuple< T1, T2, T3 > &t) {
os << get<0>(t) << " " << get<1>(t) << " " << get<2>(t);
return os;
}
template< typename T1, typename T2, typename T3 >
istream &operator >> (istream &is, tuple< T1, T2, T3 > &t) {
is >> get<0>(t) >> get<1>(t) >> get<2>(t);
return is;
}
template< typename T >
ostream &operator << (ostream &os, const vector< T > &v){
for (int i = 0; i < (int)v.size(); ++i) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template< typename T >
istream &operator >> (istream &is, vector< T > &v){
for(T &in : v) is >> in;
return is;
}
template< typename T >
ostream &operator << (ostream &os, const set< T > &st){
int ct = 0;
for(auto& s : st) cout << s << (++ct != st.size() ? " " : "");
return os;
}
template <typename T>
constexpr set<T> &operator|= (set<T> &st1, const set<T> &st2) {
for(auto& s : st2) st1.insert(s);
return st1;
}
template <typename T>
constexpr set<T> &operator-= (set<T> &st1, const set<T> &st2) {
for(auto& s : st2) if(st1.count(s)) st1.erase(s);
return st1;
}
template <typename T>
constexpr set<T> &operator&= (set<T> &st1, const set<T> &st2) {
auto itr = st1.begin();
while(itr != st1.end()){
if(!st2.count(*itr)) itr = st1.erase(itr);
else ++itr;
}
return st1;
}
template <typename T>
constexpr set<T> operator| (const set<T> &st1, const set<T> &st2) {
set<T> res = st1;
res |= st2;
return res;
}
template <typename T>
constexpr set<T> operator- (const set<T> &st1, const set<T> &st2) {
set<T> res = st1;
res -= st2;
return res;
}
template <typename T>
constexpr set<T> operator& (const set<T> &st1, const set<T> &st2) {
set<T> res = st1;
res &= st2;
return res;
}
/*--------------------------------- Tools ------------------------------------------*/
template< typename T >
vector<T> cumsum(const vector<T> &X){
vector<T> res(X.size() + 1, 0);
for(int i = 0; i < X.size(); ++i) res[i + 1] += res[i] + X[i];
return res;
}
template< typename S, typename T, typename F>
pair<T, T> bisearch(S left, T right, F f) {
while(abs(right - left) > 1e-9){
T mid = (right + left) / 2;
if(f(mid)) right = mid;
else left = mid;
}
return {left, right};
}
template< typename S, typename T, typename F>
double trisearch(S left, T right, F f, int maxLoop = 90){
double low = left, high = right;
while(maxLoop--){
double mid_left = high / 3 + low * 2 / 3;
double mid_right = high * 2 / 3 + low / 3;
if(f(mid_left) >= f(mid_right)) low = mid_left;
else high = mid_right;
}
return (low + high) * 0.5;
}
template< typename F >
ll ternarySearch(ll L, ll R, F f) { //[L, R)
ll lo = L - 1, hi = R - 1;
while (lo + 1 != hi) {
ll mi = (lo + hi) / 2;
if (f(mi) <= f(mi + 1)) hi = mi;
else lo = mi;
}
return hi;
}
// #include <atcoder/all>
// using namespace atcoder;
constexpr long long MOD = 1000000007;
using ld = long double;
/*------------------------------- Main Code Here -----------------------------------------*/
int main()
{
ll T;
cin >> T;
while(T--){
ld a, b, c;
cin >> a >> b >> c;
if(a == 0){
if(b == 0){
if(c == 0) print(3);
else print(0);
}
else{
cout << 1 << " " << -c / b << endl;
}
}
else{
ld D = b * b - 4 * a * c;
if(D < 0) print(0);
else if(D == 0){
cout << 1 << " " << - b / (2 * a) << endl;
}
else{
long double ret1 = (-b - sqrt(D)) / (2 * a);
long double ret2 = (-b + sqrt(D)) / (2 * a);
cout << 2 << " " << min(ret1, ret2) << " " << max(ret1, ret2) << endl;
}
}
}
ll x = 0;
ll b = (1 << 31) - 1, c = (1 << 31) - 1, a = -((1 << 31) - 1);
x = b * b - 4 * a * c;
print(x);
return 0;
}