#881830 (C++17) No.2352 Sharpened Knife in Fall

• 問題: No.2352 Sharpened Knife in Fall
• ユーザー: kaikey
• 提出日時: 2023-06-16 22:15:16
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 453 ms / 3,000 ms
• コード長: 4,097 bytes
• コンパイル時間: 2,500 ms
• コンパイル使用メモリ: 205,256 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-24 14:43:52
• 合計ジャッジ時間: 18,533 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	311 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	453 ms; 5,376 KB
testcase_07	AC	225 ms; 5,376 KB
testcase_08	AC	451 ms; 5,376 KB
testcase_09	AC	446 ms; 5,376 KB
testcase_10	AC	450 ms; 5,376 KB
testcase_11	AC	451 ms; 5,376 KB
testcase_12	AC	449 ms; 5,376 KB
testcase_13	AC	450 ms; 5,376 KB
testcase_14	AC	211 ms; 5,376 KB
testcase_15	AC	419 ms; 5,376 KB
testcase_16	AC	24 ms; 5,376 KB
testcase_17	AC	12 ms; 5,376 KB
testcase_18	AC	162 ms; 5,376 KB
testcase_19	AC	354 ms; 5,376 KB
testcase_20	AC	139 ms; 5,376 KB
testcase_21	AC	133 ms; 5,376 KB

ソースコード

#include "bits/stdc++.h"
#include <random>
#include <chrono>
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(30); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto mul = [](T a, T b) -> T { return a * b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>; using VVVl = V<V<Vl>>;
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<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 <class T>
T div_floor(T a, T b) {
	if (b < 0) a *= -1, b *= -1;
	return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
	if (b < 0) a *= -1, b *= -1;
	return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
	F f;
	rec(F&& f_) : f(std::forward<F>(f_)) {}
	template <class... Args> auto operator()(Args &&... args) const {
		return f(*this, std::forward<Args>(args)...);
	}
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const long long MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e18;
lint dx[8] = { 0, 1, 0, -1, 1, -1, 1, -1 }, dy[8] = { 1, 0, -1, 0, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
	lint from, to;
	lint cost;
	Edge() {

	}
	Edge(lint u, lint v, lint c) {
		cost = c;
		from = u;
		to = v;
	}
	bool operator<(const Edge& e) const {
		return cost < e.cost;
	}
};
struct WeightedEdge {
	lint to;
	lint cost;
	WeightedEdge(lint v, lint c) {
		to = v;
		cost = c;
	}
	bool operator<(const WeightedEdge& e) const {
		return cost < e.cost;
	}
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<lint, plint> tlint;
typedef pair<ld, ld> pld;
typedef pair<plint, plint> qlint;
typedef pair<Edge, lint> pEd;
typedef pair<lint, Vl> vVl;
typedef pair<set<lint>, set<lint>> pset;

long double PI = acos(-1);

int main() {
	lint R, K;
	cin >> R >> K;
	ld all = PI * R * R;
	V<ld> points, ans;
	REP(i, K) {
		points.push_back(all * (i + 1) / (K + 1));
	}

	REP(i, K) {
		auto check = [&](ld val) {
			ld sum = 0;
			ld tri = abs(val) * sqrtl(R * R - val * val);
			ld rad = acos(abs(val) / R);
			ld seg = all * rad / PI - tri;
			if (val < 0) {
				sum = seg;
			}
			else {
				sum = all - seg;
			}
			return points[i] < sum;
		};
		ld ng = -R, ok = R;
		REP(_, 50) {
			ld mid = (ok + ng) / 2;
			if (check(mid)) ok = mid;
			else ng = mid;
		}
		cout << ok << endk;
	}
}