QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#173704#5433. Absolute DifferenceaestheticTL 266ms4160kbC++202.1kb2023-09-10 01:14:062023-09-10 01:14:07

Judging History

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

  • [2023-09-10 01:14:07]
  • 评测
  • 测评结果:TL
  • 用时:266ms
  • 内存:4160kb
  • [2023-09-10 01:14:06]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

vector<pair<int, int>> split(const vector<pair<int, int>> &v, const vector<int> &pos)
{
	vector<pair<int, int>> ret;
	for(auto[l, r] : v)
	{
		if(l == r)
		{
			ret.emplace_back(l, r);
			continue;
		}
		int last = l;
		auto it = upper_bound(pos.begin(), pos.end(), l);
		while(it != pos.end() && (*it) <= r)
		{
			ret.emplace_back(last, *it);
			last = *it;
			it++;
		}
	}
	return ret;
}

long double f(int l1, int r1, int l2, int r2)
{
	if(l1 == l2 && r1 == r2)
	{
		return (r1 - l1) / 3.0L;
	}
	if(r1 <= l2 || r2 <= l1)
	{
		long double E1 = (l1 + r1) / 2.0L;
		long double E2 = (l2 + r2) / 2.0L;
		return abs(E1 - E2);
	}
	return 0;
	if(l1 < l2 && l2 < r1)
	{
		long double aux = f(l2, r1, l2, r2) * (r1 - l2) / (r1 - l1);
		return aux + f(l1, l2, l2, r2) * (l2 - l1) / (r1 - l1);
	}
	if(l1 < r2 && r2 < r1)
	{
		long double aux = f(l1, r2, l2, r2) * (r2 - l1) / (r1 - l1);
		return aux + f(r2, r1, l2, r2) * (r1 - r2) / (r1 - l1);
	}
	return f(l2, r2, l1, r1);
}

int main()
{
	ios_base::sync_with_stdio(false), cin.tie(NULL);
	int n, m;
	cin >> n >> m;
	vector<pair<int, int>> a(n), b(m);
	int tota = 0, totb = 0;
	for(int i = 0; i < n; ++i)
	{
		cin >> a[i].first >> a[i].second;
		tota += (a[i].second - a[i].first);
	}
	for(int i = 0; i < m; ++i)
	{
		cin >> b[i].first >> b[i].second;
		totb += (b[i].second - b[i].first);
	}
	vector<int> pos;
	for(auto[l, r] : a)
		pos.push_back(l), pos.push_back(r);
	for(auto[l, r] : b)
		pos.push_back(l), pos.push_back(r);
	sort(pos.begin(), pos.end());
	pos.erase(unique(pos.begin(), pos.end()), pos.end());

	a = split(a, pos);
	b = split(b, pos);
	n = a.size();
	m = b.size();

	long double ans = 0;
	for(int i = 0; i < n; ++i)
		for(int j = 0; j < m; ++j)
		{
			auto [l1, r1] = a[i];
			auto [l2, r2] = b[j];
			long double prob1 = 1.0L / n;
			long double prob2 = 1.0L / m;
			if(tota)
				prob1 = (r1 - l1) * 1.0L / tota;
			if(totb)
				prob2 = (r2 - l2) * 1.0L / totb;
		
			ans += prob1 * prob2 * f(l1, r1, l2, r2);
		}

	cout << setprecision(20) << fixed << ans << endl;
}

詳細信息

Test #1:

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

input:

1 1
0 1
0 1

output:

0.33333333333333333334

result:

ok found '0.333333333', expected '0.333333333', error '0.000000000'

Test #2:

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

input:

1 1
0 1
1 1

output:

0.50000000000000000000

result:

ok found '0.500000000', expected '0.500000000', error '0.000000000'

Test #3:

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

input:

1 1
-1000000000 1000000000
-1000000000 1000000000

output:

666666666.66666666668606922030

result:

ok found '666666666.666666627', expected '666666666.666666627', error '0.000000000'

Test #4:

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

input:

1 1
-1000000000 0
0 1000000000

output:

1000000000.00000000000000000000

result:

ok found '1000000000.000000000', expected '1000000000.000000000', error '0.000000000'

Test #5:

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

input:

1 1
-1000000000 -1000000000
-1000000000 1000000000

output:

1000000000.00000000000000000000

result:

ok found '1000000000.000000000', expected '1000000000.000000000', error '0.000000000'

Test #6:

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

input:

1 1
-999999999 1000000000
-1000000000 -1000000000

output:

1000000000.50000000000000000000

result:

ok found '1000000000.500000000', expected '1000000000.500000000', error '0.000000000'

Test #7:

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

input:

1 1
-1000000000 1000000000
-999999999 -999999999

output:

999999999.00000000046566128731

result:

ok found '999999999.000000000', expected '999999999.000000000', error '0.000000000'

Test #8:

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

input:

1 1
1000000000 1000000000
-1000000000 -1000000000

output:

2000000000.00000000000000000000

result:

ok found '2000000000.000000000', expected '2000000000.000000000', error '0.000000000'

Test #9:

score: 0
Accepted
time: 10ms
memory: 3964kb

input:

1000 1000
-2175 -2174
-1068 -1065
-1721 -1718
777 834
1162 1169
-3529 -3524
3966 3993
1934 1952
-234 -223
-4967 -4947
8500 8510
5272 5276
-6048 -6033
-34 -22
700 705
-7890 -7886
5538 5543
4114 4126
-9201 -9162
-1521 -1519
-5103 -5100
439 441
993 997
-1684 -1680
-8413 -8404
6724 6728
-3242 -3239
2616...

output:

6717.11714573945426964841

result:

ok found '6717.117145739', expected '6717.117145739', error '0.000000000'

Test #10:

score: 0
Accepted
time: 2ms
memory: 4128kb

input:

1000 1000
-5010 -4999
-2128 -2113
-5798 -5765
705 713
-3956 -3938
-5308 -5307
6759 6772
-772 -770
-860 -859
2308 2323
-5500 -5500
5140 5177
-6747 -6733
7509 7511
8864 8870
-6382 -6374
1901 1904
-5763 -5760
3019 3027
2962 2963
-314 -301
-222 -203
-726 -724
-62 -58
-1203 -1195
-5216 -5215
-4298 -4292
...

output:

6682.58112747143577658804

result:

ok found '6682.581127471', expected '6682.581127471', error '0.000000000'

Test #11:

score: 0
Accepted
time: 5ms
memory: 4120kb

input:

1000 1000
770 770
5869 5869
-8786 -8786
7549 7549
-4165 -4165
4023 4023
-9779 -9779
7797 7797
1105 1105
508 508
7653 7653
-359 -359
9393 9393
-9363 -9363
-4160 -4160
-3682 -3682
9409 9409
-8548 -8548
-9908 -9908
-7494 -7494
3751 3751
2326 2326
-3311 -3311
3651 3651
-7663 -7663
5376 5376
-7071 -7071
...

output:

6673.75681689103923721618

result:

ok found '6673.756816891', expected '6673.756816891', error '0.000000000'

Test #12:

score: 0
Accepted
time: 4ms
memory: 4052kb

input:

1000 1000
-735 -735
-829 -829
-6376 -6376
8558 8558
155 155
5533 5533
8800 8800
-1738 -1738
919 919
52 52
2076 2076
-6911 -6911
139 139
6733 6733
9923 9923
-4619 -4619
-9429 -9429
9902 9902
-5984 -5984
2580 2580
8738 8738
7960 7960
3388 3388
-2689 -2689
7986 7986
2565 2565
-8908 -8908
9359 9359
-434...

output:

6479.38467999999998525595

result:

ok found '6479.384680000', expected '6479.384680000', error '0.000000000'

Test #13:

score: 0
Accepted
time: 266ms
memory: 4036kb

input:

100 10000
82274 82408
61583 61902
-54304 -54007
-48488 -48316
-92517 -91939
85001 85160
33086 33374
36458 36573
-15785 -11838
93971 94863
50496 53064
-68609 -68302
-91873 -91176
-96937 -96753
9481 9976
83600 83691
17742 18693
55685 56039
56323 57845
88761 90277
22886 23642
30848 31047
-34662 -33470
...

output:

65016.29863479761317179850

result:

ok found '65016.298634798', expected '65016.298634798', error '0.000000000'

Test #14:

score: 0
Accepted
time: 148ms
memory: 4032kb

input:

100 10000
-89227 -88897
-70959 -68913
-60233 -59597
81753 81820
96806 97104
-58324 -57553
-38857 -37087
-81344 -81311
22701 22890
-68517 -66298
-19753 -19047
-80409 -79437
6355 7569
-13999 -12586
-84981 -82448
-29865 -29624
-76088 -75272
70697 72265
85493 86097
82574 84418
-8937 -8079
-92387 -90609
...

output:

65683.86970708786379447019

result:

ok found '65683.869707088', expected '65683.869707088', error '0.000000000'

Test #15:

score: 0
Accepted
time: 89ms
memory: 4136kb

input:

10000 100
-57904 -57904
21152 21152
60543 60543
50109 50109
-79601 -79601
-22525 -22525
28423 28423
48296 48296
-71861 -71861
-72518 -72518
-83776 -83776
77745 77745
21894 21894
-32330 -32330
82508 82508
63261 63261
-5358 -5358
3672 3672
12238 12238
-84298 -84298
-7608 -7608
3472 3472
17602 17602
56...

output:

67565.83534467324233219188

result:

ok found '67565.835344673', expected '67565.835344673', error '0.000000000'

Test #16:

score: 0
Accepted
time: 6ms
memory: 4160kb

input:

10000 100
30397 30397
62144 62144
53466 53466
-85377 -85377
-36472 -36472
-11689 -11689
18989 18989
85562 85562
-90083 -90083
51219 51219
19436 19436
-51762 -51762
28774 28774
10705 10705
83520 83520
11659 11659
-44907 -44907
62858 62858
69493 69493
59094 59094
9273 9273
-83311 -83311
94463 94463
50...

output:

68329.27048999999873757361

result:

ok found '68329.270490000', expected '68329.270490000', error '0.000000000'

Test #17:

score: -100
Time Limit Exceeded

input:

10 100000
-869747 -830724
-788440 -670325
117115 196471
908542 968596
650801 749354
370395 516964
-501924 -184650
-948338 -936663
-95487 58170
541118 558043
-159087 -159083
32299 32305
-973981 -973976
301160 301166
-865954 -865952
-213982 -213982
28063 28063
206739 206748
546600 546610
-387875 -3878...

output:


result: