平面切割 Java

最新推荐文章于 2024-06-29 11:59:11 发布

涵_

最新推荐文章于 2024-06-29 11:59:11 发布

阅读量155

点赞数

文章标签： java 算法数据结构

本文链接：https://blog.csdn.net/ShuHan66612/article/details/129816330

版权

import java.io.BufferedInputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Scanner;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;

import java.util.Set;
public class Main {

    static class pair {
        double a;
        double b;

        public pair(double a, double b) {
            this.a = a;
            this.b = b;
        }

        @Override
        public int hashCode() {
            // TODO Auto-generated method stub
            return (int) a;
        }

        @Override
        public boolean equals(Object obj) {
            // TODO Auto-generated method stub
            pair p = (pair) obj;
            return this.a == p.a && this.b == p.b;
        }

    }
    public static void main(String[] args)throws IOException {
        PrintWriter out = new PrintWriter(System.out);
        StreamTokenizer in = new StreamTokenizer(new BufferedInputStream(System.in));

        Set<pair> set = new HashSet<>();
        Set<pair> point = new HashSet<>();
        in.nextToken();
        int n = (int) in.nval;
        for (int i = 0; i < n; i++) {
            in.nextToken();
            double a = in.nval;
            in.nextToken();
            double b = in.nval;
            set.add(new pair(a, b));
        }
        int len = set.size();
        List<pair> arr = new ArrayList<>();
        arr.addAll(set);
        int ans = 2; // 第一条直线把平面分成两块
        for (int i = 1; i < len; i++) {
            point.clear();// 记得清零
            for (int j = 0; j < i; j++) {
                double a1 = arr.get(i).a;
                double a2 = arr.get(j).a;
                double b1 = arr.get(i).b;
                double b2 = arr.get(j).b;
                if (a1 == a2) {
                    continue; // 平行没有交点
                }
                double x = (b2 - b1) / (a1 - a2);
                double y = a1 * x + b1;
                point.add(new pair(x, y));
            }
            ans += (point.size() + 1);
        }
        out.println(ans);
        out.flush();
    }
}