結果
問題 | No.550 夏休みの思い出(1) |
ユーザー |
|
提出日時 | 2022-08-26 00:31:14 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 1,642 bytes |
コンパイル時間 | 2,391 ms |
コンパイル使用メモリ | 202,440 KB |
最終ジャッジ日時 | 2025-01-31 03:59:42 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 55 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:51:13: warning: narrowing conversion of ‘a’ from ‘ld’ {aka ‘long double’} to ‘long long int’ [-Wnarrowing] 51 | vl s={1,a,b,c}; | ^ main.cpp:51:13: warning: narrowing conversion of ‘a’ from ‘ld’ {aka ‘long double’} to ‘long long int’ [-Wnarrowing] main.cpp:51:15: warning: narrowing conversion of ‘b’ from ‘ld’ {aka ‘long double’} to ‘long long int’ [-Wnarrowing] 51 | vl s={1,a,b,c}; | ^ main.cpp:51:15: warning: narrowing conversion of ‘b’ from ‘ld’ {aka ‘long double’} to ‘long long int’ [-Wnarrowing] main.cpp:51:17: warning: narrowing conversion of ‘c’ from ‘ld’ {aka ‘long double’} to ‘long long int’ [-Wnarrowing] 51 | vl s={1,a,b,c}; | ^ main.cpp:51:17: warning: narrowing conversion of ‘c’ from ‘ld’ {aka ‘long double’} to ‘long long int’ [-Wnarrowing]
ソースコード
#include<bits/stdc++.h> using namespace std; #define rep(i,n) for(ll i=0;i<n;i++) #define repl(i,l,r) for(ll i=(l);i<(r);i++) #define per(i,n) for(ll i=(n)-1;i>=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define ins insert #define pqueue(x) priority_queue<x,vector<x>,greater<x>> #define all(x) (x).begin(),(x).end() #define CST(x) cout<<fixed<<setprecision(x) #define rev(x) reverse(x); using ll=long long; using vl=vector<ll>; using vvl=vector<vector<ll>>; using pl=pair<ll,ll>; using vpl=vector<pl>; using vvpl=vector<vpl>; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={1,0,-1,0,1,1,-1,-1,0}; const ll dx[9]={0,1,0,-1,1,-1,1,-1,0}; template <typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template <typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } using ld=long double; ld a,b,c; ld fx(ld x){ return x*x*x+a*x*x+b*x+c; } int main(){ cin >> a >> b >> c; ld ok=inf,ng=-inf; rep(i,200){ ld mid=(ok+ng)/2; if(fx(mid)>=0)ok=mid; else ng=mid; } ll x=roundl(ok); //cout << x << endl; vl ans;ans.emplace_back(x); { vl s={1,a,b,c}; vl rs; rep(i,3){ rs.emplace_back(s[i]); s[i+1]-=s[i]*(-x); } //rep(i,3)cout << rs[i] <<" ";cout << endl; ll p=rs[1]*rs[1]-rs[2]*4; ll f=roundl(sqrtl(p)); //cout << (-rs[1]+f)/2 <<" " << (-rs[1]-f)/2 << endl; ans.emplace_back((-rs[1]+f)/2); ans.emplace_back((-rs[1]-f)/2); } sort(all(ans)); for(auto p:ans)cout << p << " ";cout << endl; }