글 읽기 - 런타임 에러... 어느 구문이 문제가 될까요?

yoodly 4년 전 0

처음에는 4%에서 에러나던 것을, 미친척하고 컨벡스헐로까지 전개를 했더니 그나마 9%에서 런타임 에러.. ㅠ

런타임 에러가 도대체 어디서 발생하는걸까요? 별의별 테스트 케이스를 다 떄려 넣어도 찾을 수가 없네요 ㅠ

도움을 간절히 부탁드려요~ 하루 왠 종일 붙들고 있습니다 흑...

import java.util.*;
import java.io.*;
 
public class Main {  // BOJ 1077 넓이
	static final int UPPER_INF = 10000, LOWER_INF = -10000;
    static double[] p0;
    public static void main(String[] args) throws Exception {
    	int N, M, x, y;
    	double ans = 0.0;
    	Point[] pn, pm;
    	ArrayList<double[]> ar = new ArrayList<double[]>();
    	
        System.setIn(new FileInputStream("src/BOJ1077.txt"));
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine().trim());
        
        N = Integer.parseInt(st.nextToken());
        M = Integer.parseInt(st.nextToken());
        pn = new Point[N]; pm = new Point[M];
        
        for (int i = 0; i < N; i++) {
        	st = new StringTokenizer(br.readLine());
        	x = Integer.parseInt(st.nextToken());
        	y = Integer.parseInt(st.nextToken());
        	pn[i] = new Point(x, y);
        }
        for (int i = 0; i < M; i++) {
        	st = new StringTokenizer(br.readLine());
        	x = Integer.parseInt(st.nextToken());
        	y = Integer.parseInt(st.nextToken());
        	pm[i] = new Point(x, y);
        }
        
        cross(pn, pm, ar);
        cross(pm, pn, ar);
        
        if (ar.size() == 0) {
        	System.out.println(0.0);
        }
        else {
            double[][] pt = ar.toArray(new double[ar.size()][2]);
            
        	Arrays.sort(pt, new Comparator<double[]>() {
            	@Override
            	public int compare(double[] p1, double[] p2) {
            		if (p1[0] < p2[0]) return -1;
            		else if (p1[0] > p2[0]) return 1;
            		else return 0;
            	}
            });
        	
        	p0 = pt[0];
            Arrays.sort(pt, 1, pt.length, new Comparator<double[]>() {
            	@Override
            	public int compare(double[] p1, double[] p2) {
            		int cal = ccw(p0, p1, p2);
            		if (cal != 0) return -1*cal;
            		else {
            			double dist1 = distance(p0, p1);
            			double dist2 = distance(p0, p2);
            			if (dist1 < dist2) return -1;
            			else if (dist1 == dist2) return 0;
            			else return 1;
            		}
            	}
            });
       
            convexhull(pt);
        }
    }
    static void convexhull(double[][] pt) {
    	int n = pt.length;
    	int idx = 0;
    	int[] hull = new int[n];
    	double ans = 0;
    	
    	for (int i = 0; i < n; i++) {
    		while (idx >= 2 && ccw(pt[hull[idx-2]], pt[hull[idx-1]], pt[i]) <= 0) {
    			idx--;
    		}
    		hull[idx++] = i;
    	}
    	for (int i = 0; i < idx; i++) {
    		ans += area(pt[hull[i]], pt[hull[(i+1)%idx]]);
    	}
    	System.out.println(Math.abs(ans));
    }
    static void cross(Point[] pn, Point[] pm, ArrayList<double[]> ar) {
    	int n = pn.length;
    	int m = pm.length;   
    	boolean[] included = new boolean[m];
    	Arrays.fill(included, true);
    	
    	for (int i = 0; i < n; i++) {
    		for (int j = 0; j < m; j++) {
    			if (ccw(pn[i], pn[(i+1)%n], pm[j]) < 0 && included[j]) {
    				included[j] = false;
    			}
    			if (intersect(pn[i], pn[(i+1)%n], pm[j], pm[(j+1)%m])) {
    				double[] cp = intersectPoint(pn[i], pn[(i+1)%n], pm[j], pm[(j+1)%m]);
    				ar.add(cp);
    			}
    		}
    	}

    	for (int i = 0; i < m; i++) {
    		if (included[i]) {
				double[] cp = new double[2];
				cp[0] = (double)pm[i].x; cp[1] = (double)pm[i].y;
				ar.add(cp);
    		}
    	}
    }
    static int ccw(Point p1, Point p2, Point p3) {
    	long cal = (p1.x*p2.y + p2.x*p3.y + p3.x*p1.y) - (p1.x*p3.y + p2.x*p1.y + p3.x*p2.y);
    	if (cal < 0) return -1;
    	else if (cal == 0) return 0;
    	else return 1;
    }
    static int ccw(double[] p1, double[] p2, double[] p3) {
    	double cal = (p1[0]*p2[1] + p2[0]*p3[1] + p3[0]*p1[1]) - (p1[0]*p3[1] + p2[0]*p1[1] + p3[0]*p2[1]);
    	if (cal < 0) return -1;
    	else if (cal == 0) return 0;
    	else return 1;
    }
    static double distance(double[] p1, double[] p2) {
    	return (p1[0]-p2[0])*(p1[0]-p2[0]) + (p1[1]-p2[1])*(p1[1]-p2[1]);    	
    }    
    static boolean intersect(Point p1, Point p2, Point p3, Point p4) {
    	if (ccw(p1, p2, p3)*ccw(p1, p2, p4) < 0 && ccw(p3, p4, p1)*ccw(p3, p4, p2) < 0) 
    		return true;
    	else return false;
    }
    static double[] intersectPoint(Point p1, Point p2, Point p3, Point p4) {
    	double[] ret = {UPPER_INF,UPPER_INF};    	
    	double s, t, under;
    	double x1, y1, x2, y2, x3, y3, x4, y4;
    	
    	x1 = (double)p1.x; y1 = (double)p1.y; x2 = (double)p2.x; y2 = (double)p2.y;
    	x3 = (double)p3.x; y3 = (double)p3.y; x4 = (double)p4.x; y4 = (double)p4.y;
    	
    	under = (x2 - x1)*(y4 - y3) - (x4 - x3)*(y2 - y1);
    	if (under == 0) return ret;
    	
    	t = ((x3 - x1)*(y4 - y3) - (x4 - x3)*(y3 - y1)) / under;
    	s = ((x3 - x1)*(y2 - y1) - (x2 - x1)*(y3 - y1)) / under;
    	
    	if (s < 0.0 || s > 1.0 || t < 0.0 || t > 1.0) return ret;
    	
    	ret[0] = x1 + (x2 - x1) * t;
    	ret[1] = y1 + (y2 - y1) * t;
    	
    	return ret;
    }
    static double area(double[] p1, double[] p2) {
    	return ((p1[0]*p2[1]) - (p2[0]*p1[1]))/2;
    }
}
class Point{
	int x, y;
	public Point(int x, int y) {
		this.x = x; this.y = y;
	}
}

댓글을 작성하려면 로그인해야 합니다.

문제

문제

출처

ICPC

런타임 에러... 어느 구문이 문제가 될까요?

yoodly 4년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말