QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#857430#8864. Ball Passingasdfsdf#AC ✓1ms4096kbC++231.0kb2025-01-15 17:56:422025-01-15 17:56:42

Judging History

你现在查看的是最新测评结果

  • [2025-01-15 17:56:42]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:4096kb
  • [2025-01-15 17:56:42]
  • 提交

answer

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 303030
#define MAXS 70
#define INF 1'000'000'100'000'000'000
#define bb ' '
#define ln '\n'
#define Ln '\n'
#define MOD 1'000'000'007
#define TC 1
typedef long double ld;
ll sq(ll x) { return x * x; }
ld getdis(pii p1, pii p2) {
	return sqrt(sq(p1.first - p2.first) + sq(p1.second - p2.second));
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int N;
	cin >> N;
	string s;
	cin >> s;
	int i;
	vector<pii> arr[2];
	int a, b;
	for (i = 1; i <= N; i++) {
		cin >> a >> b;
		arr[s[i - 1] == 'B'].push_back(pii(a, b));
	}
	long double sum = 0;
	for (auto c : { 0, 1 }) {
		int n = arr[c].size();
		n >>= 1;
		for (i = 0; i < n; i++) sum += getdis(arr[c][i], arr[c][i + n]);
	}
	cout << fixed;
	cout.precision(20);
	cout << sum;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 4096kb

input:

4
BBGG
-1 -10
-10 -2
-8 7
7 -8

output:

33.25479801438872229369

result:

ok found '33.2547980', expected '33.2547980', error '0.0000000'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3968kb

input:

10
GBGBBBGBBG
-30 2
-28 10
-5 30
6 29
15 26
22 20
29 9
27 -12
-14 -27
-22 -20

output:

269.69538304512015969294

result:

ok found '269.6953830', expected '269.6953830', error '0.0000000'

Test #3:

score: 0
Accepted
time: 1ms
memory: 4096kb

input:

18
GBBBBGBGBGBBGGGGBB
-1820 -414
-1992 -92
-77 999
75 999
422 978
471 972
871 900
1343 741
1790 -446
556 -961
148 -997
28 -1000
23 -1000
-493 -969
-816 -913
-1002 -865
-1432 -698
-1671 -550

output:

21614.28139156574775370245

result:

ok found '21614.2813916', expected '21614.2813916', error '0.0000000'

Test #4:

score: 0
Accepted
time: 0ms
memory: 3968kb

input:

40
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
9506 -2484
9872 -1278
9980 -501
9992 -323
7528 5266
7447 5339
7074 5655
5984 6410
5834 6498
5537 6662
5459 6703
3250 7566
2640 7716
896 7968
637 7984
-1592 7898
-1863 7860
-2419 7762
-3277 7558
-3941 7353
-7798 5008
-9393 2745
-9617 2192
-9752 1772
-9882 -...

output:

351971.75325977568718371913

result:

ok found '351971.7532598', expected '351971.7532598', error '0.0000000'

Test #5:

score: 0
Accepted
time: 1ms
memory: 4096kb

input:

50
BBBGBGGGGGBGGGGGGGGBBGGGGBBBBBBGGGBGGBGBGGBBGBGBGG
1420 -4949
4182 -4542
4684 -4418
5875 -4046
6094 -3964
7896 -3068
8588 -2561
8764 -2408
8929 -2251
9377 -1737
9724 -1166
8443 2679
8109 2926
7842 3103
4660 4424
4561 4450
3837 4617
3542 4676
3281 4723
3208 4736
3008 4768
1136 4968
131 5000
-1002 ...

output:

331254.02414500589475210290

result:

ok found '331254.0241450', expected '331254.0241450', error '0.0000000'