답안 #81832 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
81832	2018-10-27T05:52:11 Z	tmwilliamlin168	Fences (JOI18_fences)	C++14	51 / 100	88 ms	2104 KB

fences

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

const int mxN=100, mxM=2*mxN+4, MG1=1000696969;
int n, s, a[mxM], b[mxM], m;
double d[2*mxM][2*mxM], ans=6969;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> s;
	for(int i=0; i<n; ++i)
		cin >> a[2*i] >> b[2*i] >> a[2*i+1] >> b[2*i+1];
	a[2*n]=a[2*n+1]=b[2*n]=b[2*n+3]=s;
	a[2*n+2]=a[2*n+3]=b[2*n+1]=b[2*n+2]=-s;
	m=2*n+4;
	for(int i=0; i<2*m; ++i)
		for(int j=0; j<2*m; ++j)
			d[i][j]=8*s;
	auto o1=[&](long long x1, long long y1, int x2, int y2) {
		return x1*y2==x2*y1?0:(x1*y2>x2*y1?1:-1);
	};
	auto il=[&](int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4) {
		int a=o1(x2-x1, y2-y1, x3-x1, y3-y1), b=o1(x2-x1, y2-y1, x4-x1, y4-y1), c=o1(x4-x3, y4-y3, x1-x3, y1-y3), d=o1(x4-x3, y4-y3, x2-x3, y2-y3);
		return a&&b&&c&&d&&a!=b&&c!=d;
	};
	auto gc=[&](int x1, int y1, int x2, int y2) {
		return il(x1, y1, x2, y2, 0, 0, MG1, 1)?o1(x1, y1, MG1, 1):0;
	};
	auto aa=[&](int u, int v, double e, int c) {
		if(c>=0) {
			d[u][v+c*m]=min(e, d[u][v+c*m]);
			d[v+c*m][u]=min(e, d[v+c*m][u]);
		}
		if(c<=0) {
			d[u+m][v+(1+c)*m]=min(e, d[u+m][v+(1+c)*m]);
			d[v+(1+c)*m][u+m]=min(e, d[v+(1+c)*m][u+m]);
		}
	};
	for(int i=0; i<n; ++i)
		for(int j=i+1; j<n; ++j)
			if(il(a[2*i], b[2*i], a[2*i+1], b[2*i+1], a[2*j], b[2*j], a[2*j+1], b[2*j+1]))
				for(int k=0; k<4; ++k)
					aa(2*i+k%2, 2*j+k/2, 0, gc(a[2*i+k%2], b[2*i+k%2], a[2*j+k/2], b[2*j+k/2]));
	auto is=[&](long long x1, long long y1, int x2, int y2, int s, double &d) {
		for(int i=2*n; i<2*n+2; ++i)
			if(il(x1, y1, x2, y2, a[i]*s, b[i]*s, a[i+2]*s, b[i+2]*s))
				return;
		d=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2))/s;
	};
	for(int i=0; i<m; ++i) {
		for(int j=0; 2*j<m; ++j) {
			double d1=8*s;
			for(int k=2*j; k<2*j+2; ++k, d1=8*s) {
				is(a[i], b[i], a[k], b[k], 1, d1);
				if(d1<8*s)
					aa(i, k, d1, gc(a[i], b[i], a[k], b[k]));
			}
			if(j<n) {
				int bx=a[2*j+1]-a[2*j], by=b[2*j+1]-b[2*j], bm=bx*bx+by*by, adb=(a[i]-a[2*j])*bx+(b[i]-b[2*j])*by;
				if(0<=adb&&adb<=bm) {
					int cx=adb*bx+a[2*j]*bm, cy=adb*by+b[2*j]*bm;
					is(a[i]*bm, b[i]*bm, cx, cy, bm, d1);
					if(d1<8*s)
						for(int k=2*j; k<2*j+2; ++k)
							aa(i, k, d1, gc(a[i]*bm, b[i]*bm, cx, cy)+gc(cx, cy, a[k]*bm, b[k]*bm));
				}
			}
		}
	}
	for(int k=0; k<2*m; ++k)
		for(int i=0; i<2*m; ++i)
			for(int j=0; j<2*m; ++j)
				d[i][j]=min(d[i][k]+d[k][j], d[i][j]);
	for(int i=0; i<m; ++i)
		ans=min(d[i][i+m], ans);
	cout << fixed << setprecision(9) << ans;
}

Subtask #1
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	424 KB	Output is correct
4	Correct	2 ms	632 KB	Output is correct
5	Correct	2 ms	632 KB	Output is correct
6	Correct	2 ms	676 KB	Output is correct
7	Correct	2 ms	676 KB	Output is correct
8	Correct	2 ms	676 KB	Output is correct
9	Correct	2 ms	676 KB	Output is correct
10	Correct	2 ms	676 KB	Output is correct
11	Correct	2 ms	676 KB	Output is correct
12	Correct	2 ms	676 KB	Output is correct
13	Correct	2 ms	676 KB	Output is correct
14	Correct	2 ms	676 KB	Output is correct
15	Correct	2 ms	676 KB	Output is correct
16	Correct	2 ms	676 KB	Output is correct
17	Correct	2 ms	676 KB	Output is correct
18	Correct	2 ms	676 KB	Output is correct
19	Correct	2 ms	748 KB	Output is correct
20	Correct	2 ms	748 KB	Output is correct

Subtask #2
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	424 KB	Output is correct
4	Correct	2 ms	632 KB	Output is correct
5	Correct	2 ms	632 KB	Output is correct
6	Correct	2 ms	676 KB	Output is correct
7	Correct	2 ms	676 KB	Output is correct
8	Correct	2 ms	676 KB	Output is correct
9	Correct	2 ms	676 KB	Output is correct
10	Correct	2 ms	676 KB	Output is correct
11	Correct	2 ms	676 KB	Output is correct
12	Correct	2 ms	676 KB	Output is correct
13	Correct	2 ms	676 KB	Output is correct
14	Correct	2 ms	676 KB	Output is correct
15	Correct	2 ms	676 KB	Output is correct
16	Correct	2 ms	676 KB	Output is correct
17	Correct	2 ms	676 KB	Output is correct
18	Correct	2 ms	676 KB	Output is correct
19	Correct	2 ms	748 KB	Output is correct
20	Correct	2 ms	748 KB	Output is correct
21	Correct	2 ms	748 KB	Output is correct
22	Correct	2 ms	748 KB	Output is correct
23	Correct	2 ms	748 KB	Output is correct
24	Correct	2 ms	748 KB	Output is correct
25	Correct	2 ms	748 KB	Output is correct
26	Correct	3 ms	748 KB	Output is correct
27	Correct	2 ms	748 KB	Output is correct
28	Correct	2 ms	764 KB	Output is correct
29	Correct	2 ms	764 KB	Output is correct
30	Correct	2 ms	764 KB	Output is correct
31	Correct	2 ms	764 KB	Output is correct
32	Correct	2 ms	764 KB	Output is correct
33	Correct	2 ms	764 KB	Output is correct
34	Correct	2 ms	764 KB	Output is correct
35	Correct	2 ms	764 KB	Output is correct
36	Correct	2 ms	764 KB	Output is correct
37	Correct	3 ms	764 KB	Output is correct
38	Correct	2 ms	764 KB	Output is correct
39	Correct	2 ms	764 KB	Output is correct
40	Correct	2 ms	764 KB	Output is correct
41	Correct	2 ms	764 KB	Output is correct
42	Correct	2 ms	764 KB	Output is correct
43	Correct	2 ms	764 KB	Output is correct

Subtask #3
0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	424 KB	Output is correct
4	Correct	2 ms	632 KB	Output is correct
5	Correct	2 ms	632 KB	Output is correct
6	Correct	2 ms	676 KB	Output is correct
7	Correct	2 ms	676 KB	Output is correct
8	Correct	2 ms	676 KB	Output is correct
9	Correct	2 ms	676 KB	Output is correct
10	Correct	2 ms	676 KB	Output is correct
11	Correct	2 ms	676 KB	Output is correct
12	Correct	2 ms	676 KB	Output is correct
13	Correct	2 ms	676 KB	Output is correct
14	Correct	2 ms	676 KB	Output is correct
15	Correct	2 ms	676 KB	Output is correct
16	Correct	2 ms	676 KB	Output is correct
17	Correct	2 ms	676 KB	Output is correct
18	Correct	2 ms	676 KB	Output is correct
19	Correct	2 ms	748 KB	Output is correct
20	Correct	2 ms	748 KB	Output is correct
21	Correct	2 ms	748 KB	Output is correct
22	Correct	2 ms	748 KB	Output is correct
23	Correct	2 ms	748 KB	Output is correct
24	Correct	2 ms	748 KB	Output is correct
25	Correct	2 ms	748 KB	Output is correct
26	Correct	3 ms	748 KB	Output is correct
27	Correct	2 ms	748 KB	Output is correct
28	Correct	2 ms	764 KB	Output is correct
29	Correct	2 ms	764 KB	Output is correct
30	Correct	2 ms	764 KB	Output is correct
31	Correct	2 ms	764 KB	Output is correct
32	Correct	2 ms	764 KB	Output is correct
33	Correct	2 ms	764 KB	Output is correct
34	Correct	2 ms	764 KB	Output is correct
35	Correct	2 ms	764 KB	Output is correct
36	Correct	2 ms	764 KB	Output is correct
37	Correct	3 ms	764 KB	Output is correct
38	Correct	2 ms	764 KB	Output is correct
39	Correct	2 ms	764 KB	Output is correct
40	Correct	2 ms	764 KB	Output is correct
41	Correct	2 ms	764 KB	Output is correct
42	Correct	2 ms	764 KB	Output is correct
43	Correct	2 ms	764 KB	Output is correct
44	Correct	75 ms	1952 KB	Output is correct
45	Correct	78 ms	1956 KB	Output is correct
46	Correct	73 ms	1956 KB	Output is correct
47	Correct	86 ms	1956 KB	Output is correct
48	Correct	71 ms	2068 KB	Output is correct
49	Correct	71 ms	2068 KB	Output is correct
50	Correct	73 ms	2068 KB	Output is correct
51	Correct	73 ms	2068 KB	Output is correct
52	Correct	71 ms	2084 KB	Output is correct
53	Correct	72 ms	2084 KB	Output is correct
54	Correct	71 ms	2084 KB	Output is correct
55	Correct	74 ms	2084 KB	Output is correct
56	Correct	74 ms	2084 KB	Output is correct
57	Correct	74 ms	2104 KB	Output is correct
58	Correct	85 ms	2104 KB	Output is correct
59	Correct	75 ms	2104 KB	Output is correct
60	Correct	72 ms	2104 KB	Output is correct
61	Correct	71 ms	2104 KB	Output is correct
62	Correct	3 ms	2104 KB	Output is correct
63	Correct	3 ms	2104 KB	Output is correct
64	Correct	67 ms	2104 KB	Output is correct
65	Correct	72 ms	2104 KB	Output is correct
66	Correct	65 ms	2104 KB	Output is correct
67	Incorrect	88 ms	2104 KB	Output isn't correct
68	Halted	0 ms	0 KB	-

답안 #81832

Compilation message

Subtask #1 18.0 / 18.0

Subtask #2 33.0 / 33.0

Subtask #3 0 / 49.0

Subtask #1
18.0 / 18.0

Subtask #2
33.0 / 33.0

Subtask #3
0 / 49.0