結果

問題 No.2352 Sharpened Knife in Fall
ユーザー miscalcmiscalc
提出日時 2023-06-16 21:43:21
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 524 ms / 3,000 ms
コード長 2,966 bytes
コンパイル時間 4,654 ms
コンパイル使用メモリ 267,452 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-24 13:33:46
合計ジャッジ時間 18,085 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 493 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 523 ms
6,940 KB
testcase_07 AC 262 ms
6,944 KB
testcase_08 AC 524 ms
6,940 KB
testcase_09 AC 519 ms
6,940 KB
testcase_10 AC 518 ms
6,944 KB
testcase_11 AC 521 ms
6,940 KB
testcase_12 AC 522 ms
6,944 KB
testcase_13 AC 520 ms
6,944 KB
testcase_14 AC 248 ms
6,944 KB
testcase_15 AC 492 ms
6,944 KB
testcase_16 AC 27 ms
6,944 KB
testcase_17 AC 13 ms
6,940 KB
testcase_18 AC 189 ms
6,940 KB
testcase_19 AC 409 ms
6,944 KB
testcase_20 AC 162 ms
6,944 KB
testcase_21 AC 154 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll mul_limited(ll A, ll B, ll M = INF) { return B == 0 ? 0 : A > M / B ? M : A * B; }
ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *= A;} return res;}
ll logfloor(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp <= B / A; tmp *= A) {res++;} return res;}
ll logceil(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp < B; tmp *= A) {res++;} return res;}
ll arisum_ll(ll a, ll d, ll n) { return n * a + (n & 1 ? ((n - 1) >> 1) * n : (n >> 1) * (n - 1)) * d; }
ll arisum2_ll(ll a, ll l, ll n) { return n & 1 ? ((a + l) >> 1) * n : (n >> 1) * (a + l); }
ll arisum3_ll(ll a, ll l, ll d) { assert((l - a) % d == 0); return arisum2_ll(a, l, (l - a) / d + 1); }
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
//*/

const ld PI = acosl(-1.0L);

int main()
{
  ll R, K;
  cin >> R >> K;

  ld S = PI * R * R;

  auto f = [&](ld y) -> ld
  {
    ld x = sqrtl(R * R - y * y);
    ld theta = atan2l(x, y);
    return R * R * theta - x * y;
  };

  vector<ld> ans;
  for (ll i = 0; i < K / 2; i++)
  {
    ld ok = R, ng = 0;
    for (ll t = 0; t < 100; t++)
    {
      ld mid = (ok + ng) / 2;
      if (f(mid) <= (i + 1) * S / (K + 1))
        ok = mid;
      else
        ng = mid;
      //cerr << ok << " " << f(ok) << endl;
    }
    ans.push_back(ok);
    ans.push_back(-ok);
  }
  if (K % 2 != 0)
    ans.push_back(0);
  sort(ans.begin(), ans.end());
  printvect(ans);
}
0