글 읽기 - 도와주세요

ontael333 4년 전 0

100퍼까지 올라갔다가 틀립니다..
어디가 틀렸는지 계속 찾아봐도 모르겠네요.. 도와주세요
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

struct pnt {
	long double x1;
	long double y1;
	long double x2;
	long double y2;
};

int n, m;
long double ans = 10000000.0;
vector<pnt> sinchon;
vector<pnt> annam;

long double distance(long double x1, long double y1, long double x2, long  double y2) {
	return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}

int main() {
	cout.tie(0);
	cin.tie(0);
	std::ios::sync_with_stdio(false);

	cin >> n >> m;

	for (int i = 0; i < n; i++) {
		long double a, b, c, d;
		cin >> a >> b >> c >> d;
		sinchon.push_back({ a,b,c,d });
	}
	for (int i = 0; i < m; i++) {
		long double a, b, c, d;
		cin >> a >> b >> c >> d;
		annam.push_back({ a,b,c,d });
	}

	for (int i = 0; i < sinchon.size(); i++) {
		for (int j = 0; j < annam.size(); j++) {
			long double min_dis = 10000000.0;
			min_dis = min(min_dis, distance(sinchon[i].x1, sinchon[i].y1, annam[j].x1, annam[j].y1));
			min_dis = min(min_dis, distance(sinchon[i].x1, sinchon[i].y1, annam[j].x2, annam[j].y2));
			min_dis = min(min_dis, distance(sinchon[i].x2, sinchon[i].y2, annam[j].x1, annam[j].y1));
			min_dis = min(min_dis, distance(sinchon[i].x2, sinchon[i].y2, annam[j].x2, annam[j].y2));

			long double ne1 = (sinchon[i].x1 - annam[j].x1) * (annam[j].x2 - annam[j].x1) + (sinchon[i].y1 - annam[j].y1) * (annam[j].y2 - annam[j].y1);
			long double ne2 = (sinchon[i].x1 - annam[j].x2) * (annam[j].x1 - annam[j].x2) + (sinchon[i].y1 - annam[j].y2) * (annam[j].y1 - annam[j].y2);

			if (ne1 * ne2 >= 0.0) {
				long double nee = (annam[j].x1 - sinchon[i].x1) * (annam[j].x2 - sinchon[i].x1) + (annam[j].y1 - sinchon[i].y1) * (annam[j].y2 - sinchon[i].y1);
				nee = nee / (distance(sinchon[i].x1, sinchon[i].y1, annam[j].x1, annam[j].y1) * distance(sinchon[i].x1, sinchon[i].y1, annam[j].x2, annam[j].y2));
				long double sinn = sqrt(1.0 - nee*nee);
				long double tri = (distance(sinchon[i].x1, sinchon[i].y1, annam[j].x1, annam[j].y1) * distance(sinchon[i].x1, sinchon[i].y1, annam[j].x2, annam[j].y2) * sinn) / 2.0;
				long double height = (tri * 2.0) / distance(annam[j].x1, annam[j].y1, annam[j].x2, annam[j].y2);
				min_dis = min(min_dis, height);
			}

			ne1 = (sinchon[i].x2 - annam[j].x1) * (annam[j].x2 - annam[j].x1) + (sinchon[i].y2 - annam[j].y1) * (annam[j].y2 - annam[j].y1);
			ne2 = (sinchon[i].x2 - annam[j].x2) * (annam[j].x1 - annam[j].x2) + (sinchon[i].y2 - annam[j].y2) * (annam[j].y1 - annam[j].y2);

			if (ne1 * ne2 >= 0) {
				long double nee = (annam[j].x1 - sinchon[i].x2) * (annam[j].x2 - sinchon[i].x2) + (annam[j].y1 - sinchon[i].y2) * (annam[j].y2 - sinchon[i].y2);
				nee = nee / (distance(sinchon[i].x2, sinchon[i].y2, annam[j].x1, annam[j].y1) * distance(sinchon[i].x2, sinchon[i].y2, annam[j].x2, annam[j].y2));
				long double sinn = sqrt(1.0 - nee*nee);
				long double tri = (distance(sinchon[i].x2, sinchon[i].y2, annam[j].x1, annam[j].y1) * distance(sinchon[i].x2, sinchon[i].y2, annam[j].x2, annam[j].y2) * sinn) / 2.0;
				long double height = (tri * 2.0) / distance(annam[j].x1, annam[j].y1, annam[j].x2, annam[j].y2);
				min_dis = min(min_dis, height);
			}

			ne1 = (annam[j].x1 - sinchon[i].x1) * (sinchon[i].x2 - sinchon[i].x1) + (annam[j].y1 - sinchon[i].y1) * (sinchon[i].y2 - sinchon[i].y1);
			ne2 = (annam[j].x1 - sinchon[i].x2) * (sinchon[i].x1 - sinchon[i].x2) + (annam[j].y1 - sinchon[i].y2) * (sinchon[i].y1 - sinchon[i].y2);

			if (ne1 * ne2 >= 0) {
				long double nee = (sinchon[i].x1 - annam[j].x1) * (sinchon[i].x2 - annam[j].x1) + (sinchon[i].y1 - annam[j].y1) * (sinchon[i].y2 - annam[j].y1);
				nee = nee / (distance(annam[j].x1, annam[j].y1, sinchon[i].x1, sinchon[i].y1) * distance(annam[j].x1, annam[j].y1, sinchon[i].x2, sinchon[i].y2));
				long double sinn = sqrt(1.0 - nee*nee);
				long double tri = (distance(annam[j].x1, annam[j].y1, sinchon[i].x1, sinchon[i].y1) * distance(annam[j].x1, annam[j].y1, sinchon[i].x2, sinchon[i].y2) * sinn) / 2.0;
				long double height = (tri * 2.0) / distance(sinchon[i].x1, sinchon[i].y1, sinchon[i].x2, sinchon[i].y2);
				min_dis = min(min_dis, height);
			}

			ne1 = (annam[j].x2 - sinchon[i].x1) * (sinchon[i].x2 - sinchon[i].x1) + (annam[j].y2 - sinchon[i].y1) * (sinchon[i].y2 - sinchon[i].y1);
			ne2 = (annam[j].x2 - sinchon[i].x2) * (sinchon[i].x1 - sinchon[i].x2) + (annam[j].y2 - sinchon[i].y2) * (sinchon[i].y1 - sinchon[i].y2);

			if (ne1 * ne2 >= 0) {
				long double nee = (sinchon[i].x1 - annam[j].x2) * (sinchon[i].x2 - annam[j].x2) + (sinchon[i].y1 - annam[j].y2) * (sinchon[i].y2 - annam[j].y2);
				nee = nee / (distance(annam[j].x2, annam[j].y2, sinchon[i].x1, sinchon[i].y1) * distance(annam[j].x2, annam[j].y2, sinchon[i].x2, sinchon[i].y2));
				long double sinn = sqrt(1.0 - nee*nee);
				long double tri = (distance(annam[j].x2, annam[j].y2, sinchon[i].x1, sinchon[i].y1) * distance(annam[j].x2, annam[j].y2, sinchon[i].x2, sinchon[i].y2) * sinn) / 2.0;
				long double height = (tri * 2.0) / distance(sinchon[i].x1, sinchon[i].y1, sinchon[i].x2, sinchon[i].y2);
				min_dis = min(min_dis, height);
			}

			ans = min(ans, min_dis);
		}
	}
	cout << ans << "\n";

	return 0;
}
댓글을 작성하려면 로그인해야 합니다.
문제

문제

출처

ICPC

도와주세요

ontael333 4년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말
