QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#677256#7693. Convex Hull Extensionnew_game_plus_players#AC ✓649ms3808kbC++143.1kb2024-10-26 10:49:382024-10-26 10:49:39

Judging History

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

  • [2024-10-26 10:49:39]
  • 评测
  • 测评结果:AC
  • 用时:649ms
  • 内存:3808kb
  • [2024-10-26 10:49:38]
  • 提交

answer

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define double long double
struct point {
	double x, y;
	point (double X=0, double Y=0) {x=X; y=Y;}
	point operator + (const point &t) const {return point(x+t.x, y+t.y);}
	point operator - (const point &t) const {return point(x-t.x, y-t.y);}
	point operator * (const double &t) const {return point(x*t, y*t);}
	double det(const point &t) const {return x*t.y - y*t.x;}
	double dot(const point &t) const {return x*t.x + y*t.y;}
	double mx() const {return max(x, y);}
	double mn() const {return min(x, y);}
	void out() {
		cerr<<x<<','<<y<<" ";
	}
}a[55];
const double eps = 1e-7;
bool parallel(point a, point b, point c, point d) {
	return fabsl((b-a).det(d-c)) < eps;
}
point LxL(point a, point b, point c, point d) { // a-b x c-d
	double t = (c-a).det(d-a) / (b-a).det(d-c);
	return a + (b-a) * t;
}

int n;
bool in_triangle(point p, point a, point b, point c) {
	if ((b-a).det(p-a) < eps) return false;
	if ((c-b).det(p-b) < eps) return false;
	if ((a-c).det(p-c) < eps) return false;
	return true;
}
void solvex(point a, point b, int x, ll &l, ll &r) {
	if (fabsl(a.x - b.x) < eps) {
		return;
	}
	point p = LxL(a, b, point(x, 0), point(x, 1));
	if (a.x < b.x) {
		l = max(l, (ll)ceil(p.y + eps));
	} else {
		r = min(r, (ll)floor(p.y - eps));
	}
}
ll ANS;
const int inf = 1e18;
ll solve(point a, point b, point c) {
	double R = -inf;
	R = max(R, a.x);
	R = max(R, b.x);
	R = max(R, c.x);
	double L = inf;
	L = min(L, a.x);
	L = min(L, b.x);
	L = min(L, c.x);
	ll ret = 0;
	// cerr<<"solve:";
	// a.out();
	// b.out();
	// c.out();
	// cerr<<"["<<L<<","<<R<<"]"<<endl;

	for (int i=L-2; i<=R+2; i++) {
		ll l = -inf, r = inf;
		solvex(a, b, i, l, r);
		solvex(b, c, i, l, r);
		solvex(c, a, i, l, r);
		// cerr<<"i="<<i<<" "<<l<<","<<r<<endl;
		if (l<=r && l != -inf && r != inf) {
			if (in_triangle(point(i, l), a, b, c)) {
				ret += r-l+1;
			}
		}
		// for (int j=-1000; j<=1000; j++) {
		// 	ANS += in_triangle(point(i, j), a, b, c);
		// }
	}
	return ret;
}
int solve_parallel(point a, point b, point c, point d) {
	ll ret = 0;
	if (fabsl(a.x-b.x)<eps) {
		return fabsl(c.x - a.x) > 1.5;
	}
	for (int i=-2e6; i<=2e6; i++) {
		ll l = -inf, r = inf;
		solvex(a, b, i, l, r);
		solvex(c, d, i, l, r);
		// cerr<<"i="<<i<<" "<<l<<","<<r<<endl;
		if (l<=r && l != -inf && r != inf) {
			ret += r-l+1;
			return ret;
		}
	}
	return ret;
}
int main() {
	cin>>n;
	for (int i=1; i<=n; i++) {
		cin>>a[i].x>>a[i].y;
	}
	a[0] = a[n];
	a[n+1] = a[1];
	a[n+2] = a[2];
	ll ans = 0;
	for (int i=1; i<=n; i++) {
		if (parallel(a[i-1], a[i], a[i+1], a[i+2])) {
			int cnt = solve_parallel(a[i-1], a[i], a[i+1], a[i+2]);
			if (cnt>0) {
				puts("infinitely many");
				return 0;
			}
			continue;
		}
		point p = LxL(a[i-1], a[i], a[i+1], a[i+2]);
		double test = (p - a[i]).det(a[i+1] - a[i]);
		if (test < 0) {
			puts("infinitely many");
			return 0;
		}
		ans += solve(a[i], p, a[i+1]);
	}
	cout<<ans<<endl;
	// cerr<<"ANS="<<ANS<<endl;
	return 0;
}

详细

Test #1:

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

input:

5
0 2
-2 0
-1 -3
1 -3
2 1

output:

23

result:

ok single line: '23'

Test #2:

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

input:

4
-7 -7
7 -7
7 7
-7 7

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #3:

score: 0
Accepted
time: 322ms
memory: 3740kb

input:

4
-1000 1000
-1000 999
-999 999
-999 1000

output:

0

result:

ok single line: '0'

Test #4:

score: 0
Accepted
time: 88ms
memory: 3796kb

input:

6
0 -901
900 -900
900 900
0 901
-900 900
-900 -900

output:

1457999998

result:

ok single line: '1457999998'

Test #5:

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

input:

6
900 -900
901 0
900 900
-900 900
-901 0
-900 -900

output:

1457999998

result:

ok single line: '1457999998'

Test #6:

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

input:

6
0 0
400 1
400 2
0 3
-400 2
-400 1

output:

1596

result:

ok single line: '1596'

Test #7:

score: 0
Accepted
time: 59ms
memory: 3672kb

input:

6
0 -901
900 -899
900 900
0 901
-900 900
-900 -899

output:

970921796

result:

ok single line: '970921796'

Test #8:

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

input:

6
2 -2
401 399
399 401
-2 2
-401 -399
-399 -401

output:

4794

result:

ok single line: '4794'

Test #9:

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

input:

6
399 -401
401 -399
2 2
-399 401
-401 399
-2 -2

output:

4794

result:

ok single line: '4794'

Test #10:

score: 0
Accepted
time: 323ms
memory: 3796kb

input:

4
-1 -1
-2 -2
-2 -3
-1 -2

output:

0

result:

ok single line: '0'

Test #11:

score: 0
Accepted
time: 321ms
memory: 3724kb

input:

4
0 0
0 1
-1 2
-1 1

output:

0

result:

ok single line: '0'

Test #12:

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

input:

48
5 -70
14 -68
22 -66
31 -63
39 -58
46 -52
52 -46
58 -39
63 -31
66 -22
68 -14
70 -5
70 5
68 14
66 22
63 31
58 39
52 46
46 52
39 58
31 63
22 66
14 68
5 70
-5 70
-14 68
-22 66
-31 63
-39 58
-46 52
-52 46
-58 39
-63 31
-66 22
-68 14
-70 5
-70 -5
-68 -14
-66 -22
-63 -31
-58 -39
-52 -46
-46 -52
-39 -58
...

output:

36

result:

ok single line: '36'

Test #13:

score: 0
Accepted
time: 322ms
memory: 3668kb

input:

4
-10 -10
-11 11
-11 10
-10 -11

output:

0

result:

ok single line: '0'

Test #14:

score: 0
Accepted
time: 322ms
memory: 3680kb

input:

4
10 -10
10 -11
11 10
11 11

output:

0

result:

ok single line: '0'

Test #15:

score: 0
Accepted
time: 649ms
memory: 3800kb

input:

4
5 5
6 5
-5 6
-6 6

output:

0

result:

ok single line: '0'

Test #16:

score: 0
Accepted
time: 647ms
memory: 3624kb

input:

4
100 -99
-99 -98
-100 -98
99 -99

output:

0

result:

ok single line: '0'

Test #17:

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

input:

4
0 1
-1 0
0 -1
1 0

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #18:

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

input:

4
-1000 0
0 -1000
1000 0
0 1000

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #19:

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

input:

4
-1000 1000
-1000 -1000
1000 -1000
1000 1000

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #20:

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

input:

4
0 0
0 2
-1 2
-1 1

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #21:

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

input:

4
-3 -2
-4 -2
-4 -3
-3 -4

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #22:

score: 0
Accepted
time: 161ms
memory: 3620kb

input:

4
6 -2
5 -2
4 -3
6 -3

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #23:

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

input:

48
4 -60
12 -59
19 -57
26 -54
33 -50
39 -45
45 -39
50 -33
54 -26
57 -19
59 -12
60 -4
60 4
59 12
57 19
54 26
50 33
45 39
39 45
33 50
26 54
19 57
12 59
4 60
-4 60
-12 59
-19 57
-26 54
-33 50
-39 45
-45 39
-50 33
-54 26
-57 19
-59 12
-60 4
-60 -4
-59 -12
-57 -19
-54 -26
-50 -33
-45 -39
-39 -45
-33 -50
...

output:

40

result:

ok single line: '40'

Test #24:

score: 0
Accepted
time: 162ms
memory: 3788kb

input:

4
7 3
7 4
5 4
6 3

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #25:

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

input:

4
-1000 0
-999 -1000
-998 0
-999 1000

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #26:

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

input:

4
0 -1000
1000 -999
0 -998
-1000 -999

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #27:

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

input:

3
999 -1000
1000 -1000
1000 -999

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #28:

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

input:

3
-2 -1
-2 -2
-1 -2

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #29:

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

input:

3
-1 0
0 1
-1 1

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #30:

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

input:

3
5 0
5 1
4 1

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #31:

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

input:

3
-777 -777
777 776
0 0

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #32:

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

input:

3
42 -13
42 -14
44 -13

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #33:

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

input:

3
-123 55
-122 57
-123 57

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #34:

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

input:

48
7 -99
19 -98
32 -94
44 -89
55 -83
66 -75
75 -66
83 -55
89 -44
94 -32
98 -19
99 -7
99 7
98 19
94 32
89 44
83 55
75 66
66 75
55 83
44 89
32 94
19 98
7 99
-7 99
-19 98
-32 94
-44 89
-55 83
-66 75
-75 66
-83 55
-89 44
-94 32
-98 19
-99 7
-99 -7
-98 -19
-94 -32
-89 -44
-83 -55
-75 -66
-66 -75
-55 -83
...

output:

156

result:

ok single line: '156'

Test #35:

score: 0
Accepted
time: 239ms
memory: 3680kb

input:

5
0 -1000
1000 -999
999 1000
-1000 1000
-1000 -999

output:

7986005002

result:

ok single line: '7986005002'

Test #36:

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

input:

6
-999 1000
-1000 0
-999 -1000
999 -1000
999 -1
998 999

output:

2992004004

result:

ok single line: '2992004004'

Test #37:

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

input:

12
-923 -771
-612 -869
778 -976
933 -289
930 553
907 731
845 822
324 920
-913 699
-957 596
-967 269
-946 -455

output:

609372

result:

ok single line: '609372'

Test #38:

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

input:

9
-497 -908
741 -696
978 -393
892 690
863 986
-510 934
-672 659
-972 60
-963 -762

output:

1867855

result:

ok single line: '1867855'

Test #39:

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

input:

21
-804 -988
-393 -993
806 -997
893 -982
986 -870
996 -744
1000 -268
1000 194
999 638
997 666
971 928
957 943
828 989
778 992
501 997
-692 1000
-964 991
-990 936
-993 521
-995 -929
-965 -956

output:

34183

result:

ok single line: '34183'

Test #40:

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

input:

15
-947 -801
-516 -997
427 -998
541 -998
566 -997
927 -966
990 -932
998 471
991 896
817 964
536 997
-715 998
-868 922
-993 664
-958 -492

output:

170756

result:

ok single line: '170756'

Test #41:

score: 0
Accepted
time: 263ms
memory: 3744kb

input:

5
1000 998
-999 1000
-1000 999
-998 -999
999 -1000

output:

5326010345

result:

ok single line: '5326010345'

Test #42:

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

input:

8
0 2
0 1
1 0
2 0
3 1
3 2
2 3
1 3

output:

0

result:

ok single line: '0'

Test #43:

score: 0
Accepted
time: 216ms
memory: 3732kb

input:

5
1000 0
999 1000
-1000 999
-1000 -1000
999 -1000

output:

7986005002

result:

ok single line: '7986005002'

Test #44:

score: 0
Accepted
time: 240ms
memory: 3732kb

input:

5
0 1000
-1000 999
-999 -1000
1000 -1000
1000 999

output:

7986005002

result:

ok single line: '7986005002'

Test #45:

score: 0
Accepted
time: 319ms
memory: 3800kb

input:

4
1000 1000
999 1000
999 999
1000 999

output:

0

result:

ok single line: '0'

Test #46:

score: 0
Accepted
time: 216ms
memory: 3728kb

input:

5
-1000 0
-999 -1000
1000 -999
1000 1000
-999 1000

output:

7986005002

result:

ok single line: '7986005002'

Test #47:

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

input:

50
883 0
876 110
855 219
820 325
773 425
714 519
643 604
562 680
473 745
375 798
272 839
165 867
55 881
-55 881
-165 867
-272 839
-375 798
-473 745
-562 680
-643 604
-714 519
-773 425
-820 325
-855 219
-876 110
-883 0
-876 -110
-855 -219
-820 -325
-773 -425
-714 -519
-643 -604
-562 -680
-473 -745
-3...

output:

19136

result:

ok single line: '19136'

Test #48:

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

input:

49
750 0
743 95
725 190
695 281
653 368
601 448
538 521
467 586
388 641
303 685
213 719
119 740
24 749
-72 746
-166 731
-259 703
-346 664
-429 615
-504 555
-571 486
-628 409
-675 325
-711 236
-736 143
-748 48
-748 -48
-736 -143
-711 -236
-675 -325
-628 -409
-571 -486
-504 -555
-429 -615
-346 -664
-2...

output:

14376

result:

ok single line: '14376'

Test #49:

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

input:

42
1000 0
988 149
955 294
900 433
826 563
733 680
623 781
500 866
365 930
222 974
74 997
-74 997
-222 974
-365 930
-499 866
-623 781
-733 680
-826 563
-900 433
-955 294
-988 149
-1000 0
-988 -149
-955 -294
-900 -433
-826 -563
-733 -680
-623 -781
-500 -866
-365 -930
-222 -974
-74 -997
74 -997
222 -97...

output:

34900

result:

ok single line: '34900'

Test #50:

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

input:

33
100 0
98 18
92 37
84 54
72 69
58 81
41 90
23 97
4 99
-14 98
-32 94
-49 86
-65 75
-78 61
-88 45
-95 28
-99 9
-99 -9
-95 -28
-88 -45
-78 -61
-65 -75
-50 -86
-32 -94
-14 -98
4 -99
23 -97
41 -90
58 -81
72 -69
84 -54
92 -37
98 -18

output:

515

result:

ok single line: '515'

Test #51:

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

input:

25
500 0
484 124
438 240
364 342
267 422
154 475
31 499
-93 491
-212 452
-318 385
-404 293
-464 184
-496 62
-496 -62
-464 -184
-404 -293
-318 -385
-212 -452
-93 -491
31 -499
154 -475
267 -422
364 -342
438 -240
484 -124

output:

24994

result:

ok single line: '24994'

Test #52:

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

input:

19
900 0
851 292
710 552
492 753
220 872
-74 896
-361 824
-609 662
-791 428
-887 148
-887 -148
-791 -428
-609 -662
-361 -824
-74 -896
220 -872
492 -753
710 -552
851 -292

output:

142538

result:

ok single line: '142538'

Test #53:

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

input:

7
800 0
498 625
-178 779
-720 347
-720 -347
-178 -779
498 -625

output:

1054757

result:

ok single line: '1054757'

Test #54:

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

input:

6
999 0
499 865
-499 865
-999 0
-499 -865
499 -865

output:

2588522

result:

ok single line: '2588522'

Test #55:

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

input:

5
1000 0
309 951
-809 587
-809 -587
309 -951

output:

5311708

result:

ok single line: '5311708'

Test #56:

score: 0
Accepted
time: 322ms
memory: 3736kb

input:

4
999 -999
999 -1000
1000 -1000
1000 -999

output:

0

result:

ok single line: '0'

Test #57:

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

input:

5
6 4
5 10
4 13
5 7
6 3

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #58:

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

input:

5
-4 6
-10 5
-13 4
-7 5
-3 6

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #59:

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

input:

5
-6 -4
-5 -10
-4 -13
-5 -7
-6 -3

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #60:

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

input:

5
4 -6
10 -5
13 -4
7 -5
3 -6

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #61:

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

input:

5
-6 4
-6 3
-5 7
-4 13
-5 10

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #62:

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

input:

5
-4 -6
-3 -6
-7 -5
-13 -4
-10 -5

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #63:

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

input:

5
6 -4
6 -3
5 -7
4 -13
5 -10

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #64:

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

input:

5
4 6
3 6
7 5
13 4
10 5

output:

infinitely many

result:

ok single line: 'infinitely many'

Test #65:

score: 0
Accepted
time: 643ms
memory: 3764kb

input:

4
-800 -100
-799 -103
-798 -105
-799 -102

output:

0

result:

ok single line: '0'

Test #66:

score: 0
Accepted
time: 647ms
memory: 3736kb

input:

4
602 -59
600 -60
603 -59
605 -58

output:

0

result:

ok single line: '0'

Test #67:

score: 0
Accepted
time: 322ms
memory: 3744kb

input:

4
-999 -999
-1000 -999
-1000 -1000
-999 -1000

output:

0

result:

ok single line: '0'

Test #68:

score: 0
Accepted
time: 641ms
memory: 3804kb

input:

4
-50 50
-52 51
-51 50
-49 49

output:

0

result:

ok single line: '0'

Test #69:

score: 0
Accepted
time: 642ms
memory: 3744kb

input:

4
5 0
6 0
7 1
6 1

output:

0

result:

ok single line: '0'

Test #70:

score: 0
Accepted
time: 642ms
memory: 3804kb

input:

4
3 -3
4 -4
5 -4
4 -3

output:

0

result:

ok single line: '0'