Submission #1690805
Source Code Expand
/* n个球的情况移动一个球后变成n-1个球的情况,且问题形式完全相同 计算出这次移动对答案的贡献 考虑计算新情况中每条边的期望长度,即可正确统计答案,把问题转化成子问题!!! 原图中边是等差数列-->新图中边也是等差数列 递归至n=1即可 */ #include<cstdio> #include<cstring> #define ld long double using namespace std; int n, d, x; ld ans; inline void solve(int n, ld d, ld x){ ans+=d+(2*n-1)*x/2; if(n==1)return; solve(n-1, (ld)(n+1)/n*d+(ld)5/(2*n)*x, (ld)(n+2)/n*x); } int main(){ scanf("%d%d%d", &n, &d, &x); ans=0; solve(n, d, x); printf("%.15Lf", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Pushing Balls |
User | leoly |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 686 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:19:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d", &n, &d, &x); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 1000 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt, example2.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, example0.txt, example1.txt, example2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 1 ms | 128 KB |
001.txt | AC | 1 ms | 128 KB |
002.txt | AC | 1 ms | 128 KB |
003.txt | AC | 1 ms | 128 KB |
004.txt | AC | 1 ms | 128 KB |
005.txt | AC | 1 ms | 128 KB |
006.txt | AC | 1 ms | 128 KB |
007.txt | AC | 1 ms | 128 KB |
008.txt | AC | 1 ms | 128 KB |
009.txt | AC | 1 ms | 128 KB |
010.txt | AC | 1 ms | 128 KB |
011.txt | AC | 4 ms | 128 KB |
012.txt | AC | 2 ms | 128 KB |
013.txt | AC | 2 ms | 128 KB |
014.txt | AC | 2 ms | 128 KB |
015.txt | AC | 4 ms | 128 KB |
016.txt | AC | 4 ms | 128 KB |
017.txt | AC | 2 ms | 128 KB |
018.txt | AC | 4 ms | 128 KB |
019.txt | AC | 1 ms | 128 KB |
020.txt | AC | 4 ms | 128 KB |
021.txt | AC | 4 ms | 128 KB |
022.txt | AC | 4 ms | 128 KB |
023.txt | AC | 4 ms | 128 KB |
024.txt | AC | 4 ms | 128 KB |
025.txt | AC | 4 ms | 128 KB |
026.txt | AC | 4 ms | 128 KB |
027.txt | AC | 4 ms | 128 KB |
028.txt | AC | 4 ms | 128 KB |
029.txt | AC | 4 ms | 128 KB |
030.txt | AC | 4 ms | 128 KB |
031.txt | AC | 5 ms | 128 KB |
example0.txt | AC | 1 ms | 128 KB |
example1.txt | AC | 1 ms | 128 KB |
example2.txt | AC | 1 ms | 128 KB |