#361029 (C++14) No.550 夏休みの思い出（１）

提出ソース

結果

問題	No.550 夏休みの思い出（１）
ユーザー	fumiphys
提出日時	2019-07-21 17:20:23
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	3 ms / 2,000 ms
コード長	4,473 bytes
コンパイル時間	1,636 ms
コンパイル使用メモリ	173,100 KB
実行使用メモリ	4,380 KB
最終ジャッジ日時	2023-09-04 12:22:22
合計ジャッジ時間	4,118 ms
ジャッジサーバーID （参考情報）	judge15 / judge14

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	3 ms 4,376 KB
testcase_01	AC	2 ms 4,376 KB
testcase_02	AC	3 ms 4,380 KB
testcase_03	AC	3 ms 4,376 KB
testcase_04	AC	2 ms 4,380 KB
testcase_05	AC	2 ms 4,376 KB
testcase_06	AC	3 ms 4,376 KB
testcase_07	AC	3 ms 4,380 KB
testcase_08	AC	2 ms 4,380 KB
testcase_09	AC	2 ms 4,376 KB
testcase_10	AC	3 ms 4,376 KB
testcase_11	AC	2 ms 4,376 KB
testcase_12	AC	3 ms 4,376 KB
testcase_13	AC	2 ms 4,380 KB
testcase_14	AC	3 ms 4,376 KB
testcase_15	AC	3 ms 4,376 KB
testcase_16	AC	3 ms 4,376 KB
testcase_17	AC	2 ms 4,376 KB
testcase_18	AC	3 ms 4,376 KB
testcase_19	AC	3 ms 4,376 KB
testcase_20	AC	2 ms 4,380 KB
testcase_21	AC	3 ms 4,376 KB
testcase_22	AC	2 ms 4,380 KB
testcase_23	AC	3 ms 4,380 KB
testcase_24	AC	2 ms 4,376 KB
testcase_25	AC	2 ms 4,380 KB
testcase_26	AC	3 ms 4,380 KB
testcase_27	AC	2 ms 4,380 KB
testcase_28	AC	2 ms 4,380 KB
testcase_29	AC	3 ms 4,376 KB
testcase_30	AC	3 ms 4,376 KB
testcase_31	AC	2 ms 4,376 KB
testcase_32	AC	3 ms 4,376 KB
testcase_33	AC	3 ms 4,380 KB
testcase_34	AC	2 ms 4,380 KB
testcase_35	AC	2 ms 4,376 KB
testcase_36	AC	3 ms 4,376 KB
testcase_37	AC	2 ms 4,380 KB
testcase_38	AC	3 ms 4,376 KB
testcase_39	AC	3 ms 4,376 KB
testcase_40	AC	2 ms 4,376 KB
testcase_41	AC	3 ms 4,380 KB
testcase_42	AC	3 ms 4,376 KB
testcase_43	AC	3 ms 4,376 KB
testcase_44	AC	3 ms 4,380 KB
testcase_45	AC	2 ms 4,380 KB
testcase_46	AC	2 ms 4,380 KB
testcase_47	AC	3 ms 4,376 KB
testcase_48	AC	3 ms 4,380 KB
testcase_49	AC	2 ms 4,380 KB
testcase_50	AC	3 ms 4,380 KB
testcase_51	AC	3 ms 4,380 KB
testcase_52	AC	3 ms 4,376 KB
testcase_53	AC	2 ms 4,376 KB
testcase_54	AC	2 ms 4,380 KB
testcase_55	AC	3 ms 4,376 KB
testcase_56	AC	3 ms 4,376 KB
testcase_57	AC	2 ms 4,376 KB

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

ソースコード

raw source code

// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
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> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
ll a, b, c;
double f(double x){
  return x * x * x + a * x * x + b * x + c;
}

double fp(double x){
  return 3 * x * x + 2 * a * x + b;
}

bool ft(ll x){
  vector<ll> MOD{mod, (ll)1e9+9LL, (ll)1e6+3, (ll)1e8+7};
  rep(i, sz(MOD)){
    ll am = a % MOD[i], bm = b % MOD[i], cm = c % MOD[i];
    ll xm = x % MOD[i];
    ll tmp = (xm * xm % MOD[i]) * xm % MOD[i];
    tmp = (tmp + (am * xm % MOD[i]) * xm % MOD[i]) % MOD[i];
    tmp = (tmp + (bm * xm % MOD[i])) % MOD[i];
    tmp = (tmp + cm) % MOD[i];
    if(tmp != 0)return false;
  }
  return true;
}

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  cin >> a >> b >> c;
  double x = 1e9;
  rep(i, 100){
    x = x - f(x) / fp(x);
  }
  double r2 = x;
  x = -1e9;
  rep(i, 1000){
    x = x - f(x) / fp(x);
  }
  double r0 = x;
  double ld = r0, rd = r2;
  rep(i, 1000){
    double md = (ld + rd) / 2.;
    if(f(md) >= 0.)ld = md;
    else rd = md;
  }
  double r1 = ld;
  ll l[3] = {(ll)r0, (ll)r1, (ll)r2};
  set<ll> st;
  rep(i, 3){
    for(int j = -1000; j <= 1000; j++){
      if(ft(l[i] + j)){
        st.insert(l[i] + j);
      }
    }
  }
  cout << st << endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード