Submission #1386873


Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#define N 200010
using namespace std;

long double ans = 0;
long double a[N], d[N];

int main() {
	int n, d1, x;
	scanf("%d%d%d", &n, &d1, &x);
	a[0] = d1; d[0] = x;
	for (int i = 0; i < n; ++i) {
		a[i + 1] = ((2.0 * (n - i) + 2) * a[i] + 5.0 * d[i]) / (2.0 * (n - i));
		d[i + 1] = (2.0 * (n - i) + 4) * d[i] / 2.0 / (n - i);
//cout << a[i] << ' ' << d[i] << endl;
		ans += (2.0 * (n - i) * a[i] + ((n - i) * (2.0 * (n - i) - 1)) * d[i]) / (2.0 * (n - i));
	}
	printf("%.15f\n", (double)ans);
}

Submission Info

Submission Time
Task C - Pushing Balls
User dreamATD
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 595 Byte
Status AC
Exec Time 6 ms
Memory 6528 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &d1, &x);
                              ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 3
AC × 35
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 2 ms 2304 KB
001.txt AC 2 ms 2304 KB
002.txt AC 2 ms 2304 KB
003.txt AC 2 ms 2304 KB
004.txt AC 2 ms 2304 KB
005.txt AC 2 ms 2304 KB
006.txt AC 2 ms 2304 KB
007.txt AC 2 ms 2304 KB
008.txt AC 2 ms 2304 KB
009.txt AC 2 ms 2304 KB
010.txt AC 2 ms 2688 KB
011.txt AC 6 ms 6400 KB
012.txt AC 4 ms 5760 KB
013.txt AC 5 ms 6016 KB
014.txt AC 4 ms 5504 KB
015.txt AC 6 ms 6400 KB
016.txt AC 6 ms 6400 KB
017.txt AC 4 ms 5504 KB
018.txt AC 6 ms 6400 KB
019.txt AC 2 ms 2816 KB
020.txt AC 6 ms 6528 KB
021.txt AC 6 ms 6528 KB
022.txt AC 6 ms 6528 KB
023.txt AC 6 ms 6528 KB
024.txt AC 6 ms 6528 KB
025.txt AC 6 ms 6528 KB
026.txt AC 6 ms 6528 KB
027.txt AC 6 ms 6528 KB
028.txt AC 6 ms 6528 KB
029.txt AC 6 ms 6528 KB
030.txt AC 6 ms 6528 KB
031.txt AC 6 ms 6528 KB
example0.txt AC 2 ms 2304 KB
example1.txt AC 2 ms 2304 KB
example2.txt AC 2 ms 2304 KB