Submission #6730245
Source Code Expand
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
// #include <boost/foreach.hpp>
// #include <boost/range/algorithm.hpp>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define ll long long
#define Sort(v) sort(all(v))
//#define INF 1e9
#define LINF 1e18
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define MP make_pair
#define int long long
using namespace std;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
// int dx[]={0,1,0,-1};
// int dy[]={1,0,-1,0};
typedef pair<int,int> P;
const long long MOD=1000000007LL;
bool isupper(char c){if('A'<=c&&c<='Z')return 1;return 0;}
bool islower(char c){if('a'<=c&&c<='z')return 1;return 0;}
bool iskaibun(string s){for(int i=0;i<s.size()/2;i++)if(s[i]!=s[s.size()-i-1])return 0;return 1;}
bool isnumber(char c){return ('0'<=c&&c<='9');}
bool isalpha(char c){return (isupper(c)||islower(c));}
template<typename T>
void print(vector<T> v){
for(int i=0;i<v.size();i++){
cout<<i<<": ";
if(i)cout<<" ";
cout<<v[i];
}
cout<<endl;
}
int INF=1e18;
template<typename T>
void printendl(vector<T> v){
for(auto date:v)cout<<date<<endl;
}
template<typename T>
void printvv(vector<vector<T>> v){
for(int i=0;i<v.size();i++){
for(int j=0;j<v[i].size();j++){
if(j)cout<<" ";
cout<<v[i][j];
}
cout<<endl;
}
}
int gcd(int a,int b){
if(a<b)swap(a,b);
if(b==0)return a;
else return gcd(b,a%b);
}
struct Edge{
int to,cost;
};
bool issorted(vector<int>& v){
for(int i=1;i<v.size();i++){
if(v[i-1]>v[i])return false;
}
return true;
}
bool is_kaibun(string s){
for(int i=0;i<s.size();i++){
if(i>0 && s[i-1]==s[i])return true;
if(i>0 && i<s.size()-1 && s[i-1]==s[i+1])return true;
}
return false;
}
int r,n,m;
double f(int k){
if(k<=0 || k>=n)return 0;
double h=r-2.0*r*k/n;
return sqrt(1.0*r*r-h*h)*2;
}
signed main (){
cin>>r>>n>>m;
double ans=0;
rep(i,1,n+m){
ans+=max(f(i),f(i-m));
}
cout<<fixed<<setprecision(10)<<ans<<endl;
}
/*
*/
Submission Info
Submission Time |
|
Task |
B - ステップカット |
User |
gotutiyan |
Language |
C++14 (Clang 3.8.0) |
Score |
200 |
Code Size |
3769 Byte |
Status |
AC |
Exec Time |
7 ms |
Memory |
888 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
Status |
|
|
Set Name |
Test Cases |
Sample |
00_example_01.txt, 00_example_02.txt, 00_example_03.txt |
All |
00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 10_rand_01.txt, 10_rand_02.txt, 10_rand_03.txt, 10_rand_04.txt, 10_rand_05.txt, 10_rand_06.txt, 10_rand_07.txt, 10_rand_08.txt, 20_hand_01.txt, 20_hand_02.txt, 20_hand_03.txt, 20_hand_04.txt, 20_hand_05.txt |
Case Name |
Status |
Exec Time |
Memory |
00_example_01.txt |
AC |
7 ms |
888 KB |
00_example_02.txt |
AC |
1 ms |
256 KB |
00_example_03.txt |
AC |
4 ms |
256 KB |
10_rand_01.txt |
AC |
1 ms |
256 KB |
10_rand_02.txt |
AC |
1 ms |
256 KB |
10_rand_03.txt |
AC |
2 ms |
256 KB |
10_rand_04.txt |
AC |
1 ms |
256 KB |
10_rand_05.txt |
AC |
1 ms |
256 KB |
10_rand_06.txt |
AC |
1 ms |
256 KB |
10_rand_07.txt |
AC |
2 ms |
256 KB |
10_rand_08.txt |
AC |
2 ms |
256 KB |
20_hand_01.txt |
AC |
4 ms |
256 KB |
20_hand_02.txt |
AC |
4 ms |
256 KB |
20_hand_03.txt |
AC |
4 ms |
256 KB |
20_hand_04.txt |
AC |
1 ms |
256 KB |
20_hand_05.txt |
AC |
1 ms |
256 KB |