結果

問題 No.2352 Sharpened Knife in Fall
ユーザー jabeejabee
提出日時 2023-06-16 22:02:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 606 ms / 3,000 ms
コード長 4,894 bytes
コンパイル時間 4,314 ms
コンパイル使用メモリ 269,808 KB
実行使用メモリ 21,300 KB
最終ジャッジ日時 2023-09-06 19:52:08
合計ジャッジ時間 21,151 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
18,644 KB
testcase_01 AC 26 ms
18,768 KB
testcase_02 AC 27 ms
18,548 KB
testcase_03 AC 27 ms
18,708 KB
testcase_04 AC 496 ms
20,596 KB
testcase_05 AC 27 ms
18,700 KB
testcase_06 AC 597 ms
20,508 KB
testcase_07 AC 306 ms
19,952 KB
testcase_08 AC 604 ms
20,536 KB
testcase_09 AC 606 ms
21,300 KB
testcase_10 AC 600 ms
20,508 KB
testcase_11 AC 600 ms
20,508 KB
testcase_12 AC 603 ms
20,512 KB
testcase_13 AC 593 ms
20,612 KB
testcase_14 AC 292 ms
19,876 KB
testcase_15 AC 564 ms
21,244 KB
testcase_16 AC 54 ms
19,784 KB
testcase_17 AC 40 ms
18,704 KB
testcase_18 AC 238 ms
19,920 KB
testcase_19 AC 477 ms
21,128 KB
testcase_20 AC 204 ms
20,056 KB
testcase_21 AC 194 ms
19,904 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
 
//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
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 (b < a) { a = b; return 1; } return 0; }
 
//---------------------------------------------------------------------------------------------------
 
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";
 
#endif // templete
//---------------------------------------------------------------------------------------------------
ll r,k;
double dr;
double calc(double h){
    double res = 0;
    double t = acos(double(1) - h / dr);
    t *= 2;
    res = t/2 * dr * dr - (dr - h)*sqrt(h * (dr * 2 - h));
    return res;
}
void _main() {
  cin >> r >> k;
  dr = r;
  
  double check = dr * dr * M_PI;
  
  check /= k + 1;

  vector<double>temp;
  double now = check;
  rep(i,0,k/2){
    double h = r;
  double l = 0;
  rep(t,0,100){
    double c1 = (h*2 + l)/3;
    double c2 = (h + l*2)/3;
    double s1 = calc(r-c1);
    double s2 = calc(r-c2);
    if(abs(s1 - now) < abs(s2 - now))l = c2;
    else h = c1;
  }
  temp.push_back(h);
  now += check;
  }
  vector<double>ans = temp;
  rep(i,0,temp.size())ans.push_back(temp[i] * -1);
  if(k % 2 == 1)ans.push_back(0);
  sort(all(ans));
  cout << fixed << setprecision(20);
  rep(i,0,k)cout << ans[i] << endl;
}
0