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

• 問題: No.2352 Sharpened Knife in Fall
• ユーザー: erbowl
• 提出日時: 2023-06-19 20:21:33
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2,586 ms / 3,000 ms
• コード長: 2,361 bytes
• コンパイル時間: 2,188 ms
• コンパイル使用メモリ: 200,912 KB
• 最終ジャッジ日時: 2025-02-14 23:03:09
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 19

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
#define int long long
ll isqrt(ll N){
   ll sqrtN=sqrt(N)-1;
   while(sqrtN+1<=N/(sqrtN+1))sqrtN++;
   return sqrtN;
}
// Union-Find
struct UnionFind {
    // core member
    vector<int> par;
    // constructor
    UnionFind() { }
    UnionFind(int n) : par(n, -1) { }
    void init(int n) { par.assign(n, -1); }
    
    // core methods
    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false;
        if (par[x] > par[y]) swap(x, y); // merge technique
        par[x] += par[y];
        par[y] = x;
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }
    
    // debug
    friend ostream& operator << (ostream &s, UnionFind uf) {
        map<int, vector<int>> groups;
        for (int i = 0; i < uf.par.size(); ++i) {
            int r = uf.root(i);
            groups[r].push_back(i);
        }
        for (const auto &it : groups) {
            s << "group: ";
            for (auto v : it.second) s << v << " ";
            s << endl;
        }
        return s;
    }
};
const double PI=3.14159265358979323846;
signed main(){
    ll r,k;
    std::cin >> r>>k;
    // k+1
    ld R;
    R=r;
    for (int i = 0; i < k; i++) {
        ld target = R*R*PI/ld(k+1)*ld(i+1);
        ld l,r;
        l = 0;
        r = PI;
        ll cnt = 100;
        while(cnt){
            cnt--;
            
            ld m = (l+r)/2.0;
            ld sum;
            if(m<PI/2.0){
                sum= PI*R*R*2*m/(2*PI)-R*R*sinl(m)*cosl(m);
            }else{
                sum= PI*R*R*2*m/(2*PI)+R*R*sinl(PI-m)*cosl(PI-m);
            }
            
            // std::cout << m<<" "<<sum<<" "<<target << std::endl;
            if(sum<=target){
                l = m;
            }else{
                r = m;
            }
        }
        if(k%2==1){
            if(i==k/2){
                std::cout << 0 << std::endl;
                continue;
            }
        }
        // std::cout << target<<" "<<l << std::endl;
        std::cout << setprecision(20)<<-cosl(l)*R << std::endl;
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX