Submission #3993751

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <string>
#include <algorithm>
#include <cmath>
#include <ctype.h>
using namespace std;
#define dump(a) cout << (a) << '\n';
typedef long long Int;
Int mod = 1e9+7;
Int MOD = 998244353;

int main() {
    ios::sync_with_stdio(false);
    double r, n, m;
    cin >> r >> n >> m;
    double res = 0;
    vector<double> cut;
    for (double i = 0; i <= n; i+=1.0) {
        double x = 2.0 * r / n;
        double a = x * i;
        cut.push_back(sqrt(r*r - (r-a)*(r-a)) * 2.0);
    }
    for (Int i = 0; i < n + m; i++) {
        if (i-m < 0) res += cut[i];
        else if (i < (Int)cut.size()) {
            res += max(cut[i-m], cut[i]);
        }
        else {
            res += cut[i-m];
        }
    }
    printf("%.12lf\n", res);
    return 0;  
}

Submission Info

Judge Result