Submission #732970

#	Time	Username	Problem	Language	Result	Execution time	Memory
732970		williampsun	Mobile (BOI12_mobile)	Java	8 / 100	1080 ms	131072 KiB

mobile

import java.io.*;
import java.util.*;

public class mobile {

    static int N;
    static int L;
    static int[][] coordinates;

    public static void main(String[] args) throws IOException {
        BufferedReader br;
        PrintWriter out;
        StringTokenizer st;
        try {
            br = new BufferedReader(new FileReader("highcard.in"));
            out = new PrintWriter(new BufferedWriter(new FileWriter("highcard.out")));
            st = new StringTokenizer(br.readLine());
        } catch (Exception e) {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
            st = new StringTokenizer(br.readLine());
        }

        N = Integer.parseInt(st.nextToken());
        L = Integer.parseInt(st.nextToken());

        coordinates = new int[N][2];
        for(int i = 0; i < N; i++) {
            st = new StringTokenizer(br.readLine());
            coordinates[i][0] = Integer.parseInt(st.nextToken());
            coordinates[i][1] = Integer.parseInt(st.nextToken());
        }

        double left = 0;
        double right = 1500000000;
        double answer = 0;
        do {
            double mid = (left + right) / 2;
            boolean working = works(mid);
            if (working) {
                answer = mid;
                left = mid;
            } else {
                right = mid;
            }
        } while (Math.abs(left - right) > 0.00001);

        out.print(answer);
        out.close();
    }

    static boolean works(double radius) {
        ArrayList<Intercept> intercepts = new ArrayList<>();
        for(int[] c : coordinates) {
            int h = c[0];
            int k = c[1];
            double discriminant = radius * radius - k * k;
            if(discriminant > 0) {
                double sqrt = Math.sqrt(discriminant);
                intercepts.add(new Intercept(sqrt + h, 1));
                intercepts.add(new Intercept(-sqrt + h, 2));
            } else if (discriminant == 0) {
                intercepts.add(new Intercept(h, 0));
            }
        }

        if(intercepts.size() == 0) {
            return true;
        }

        intercepts.sort(new Compare());
        int numCircles = 0;
        for (Intercept intercept : intercepts) {
            if (intercept.x >= 0 && intercept.x <= L) {
                if(numCircles == 0 || (numCircles == 1 && intercept.type == 2)) {
                    return true;
                }
            }

            if (intercept.type == 1) {
                numCircles++;
            } else if (intercept.type == 2) {
                numCircles--;
            }
        }

        return false;
    }

    static class Intercept {
        double x;
        int type;

        public Intercept(double x, int t) {
            this.x = x;
            type = t;
        }
    }

    static class Compare implements Comparator<Intercept> {
        @Override
        public int compare(Intercept o1, Intercept o2) {
            if(o1.x < o2.x) {
                return -1;
            } else if (o1.x == o2.x) {
                return 0;
            }
            return 1;
        }
    }
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5