Submission #7881271


Source Code Expand

Copy
#include<bits/stdc++.h>
using namespace std;

#define ld long double
const ld pi = acos(-1);
int N , L , arr[3003]; ld avex , avey;

int main(){
	cin >> N >> L; for(int i = 1 ; i <= N ; ++i) cin >> arr[i];
	
	for(int i = 1 ; i <= N ; ++i)
		for(int j = i + 1 ; j <= N ; ++j){
			int num = N - 2 - 2 * (j - i - 1);
			avex += num * cos(pi * (arr[i] + arr[j]) / L);
			avey += num * sin(pi * (arr[i] + arr[j]) / L);
		}

	avex = avex * 6 / N / (N - 1) / (N - 2);
	avey = avey * 6 / N / (N - 1) / (N - 2);
	cout << fixed << setprecision(10) << avex << ' ' << avey << endl; return 0;
}

Submission Info

Submission Time
Task D - Incenters
User Itst
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 601 Byte
Status AC
Exec Time 927 ms
Memory 384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 3
AC × 27
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 883 ms 384 KB
02.txt AC 881 ms 256 KB
03.txt AC 859 ms 256 KB
04.txt AC 875 ms 384 KB
05.txt AC 872 ms 256 KB
06.txt AC 861 ms 256 KB
07.txt AC 875 ms 256 KB
08.txt AC 880 ms 256 KB
09.txt AC 881 ms 256 KB
10.txt AC 884 ms 256 KB
11.txt AC 874 ms 256 KB
12.txt AC 869 ms 256 KB
13.txt AC 881 ms 256 KB
14.txt AC 880 ms 256 KB
15.txt AC 818 ms 256 KB
16.txt AC 808 ms 256 KB
17.txt AC 825 ms 256 KB
18.txt AC 817 ms 256 KB
19.txt AC 234 ms 256 KB
20.txt AC 233 ms 256 KB
21.txt AC 906 ms 256 KB
22.txt AC 927 ms 256 KB
23.txt AC 1 ms 256 KB
24.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB