PAT甲级 1109 Group Photo(17/25)Java

题目

Formation is very important when taking a group photo. Given the rules of forming K rows with N people as the following:

  • The number of people in each row must be N/K (round down to the nearest integer), with all the extra people (if any) standing in the last row;

  • All the people in the rear row must be no shorter than anyone standing in the front rows;

  • In each row, the tallest one stands at the central position (which is defined to be the position (m/2+1), where m is the total number of people in that row, and the division result must be rounded down to the nearest integer);

  • In each row, other people must enter the row in non-increasing order of their heights, alternately taking their positions first to the right and then to the left of the tallest one (For example, given five people with their heights 190, 188, 186, 175, and 170, the final formation would be 175, 188, 190, 186, and 170. Here we assume that you are facing the group so your left-hand side is the right-hand side of the one at the central position.);

  • When there are many people having the same height, they must be ordered in alphabetical (increasing) order of their names, and it is guaranteed that there is no duplication of names.

Now given the information of a group of people, you are supposed to write a program to output their formation.

Input Specification:

Each input file contains one test case. For each test case, the first line contains two positive integers N (≤104), the total number of people, and K (≤10), the total number of rows. Then N lines follow, each gives the name of a person (no more than 8 English letters without space) and his/her height (an integer in [30, 300]).

Output Specification:

For each case, print the formation -- that is, print the names of people in K lines. The names must be separated by exactly one space, but there must be no extra space at the end of each line. Note: since you are facing the group, people in the rear rows must be printed above the people in the front rows.

Sample Input:

10 3
Tom 188
Mike 170
Eva 168
Tim 160
Joe 190
Ann 168
Bob 175
Nick 186
Amy 160
John 159

Sample Output:

Bob Tom Joe Nick
Ann Mike Eva
Tim Amy John

 两个版本都是17分

代码1

感觉已经最优了,┭┮﹏┭┮

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.LinkedList;

public class Main {
    public static void main(String[] args) throws IOException {
        //直接仿柳神C++的,Java也没有办法AC
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] line = br.readLine().split(" ");
        int n = Integer.parseInt(line[0]);
        int k = Integer.parseInt(line[1]);
        Student[] studentsArray = new Student[n];
        int g=0;
        while (g<n) {
            line = br.readLine().split(" ");
            studentsArray[g]=new Student(line[0], Integer.parseInt(line[1]));
            g++;
        }
        Arrays.sort(studentsArray, new Comparator<Student>() {
            @Override
            public int compare(Student o1, Student o2) {
                if (o1.age != o2.age) {
                    return o2.age - o1.age;
                } else {
                    return o1.name.compareTo(o2.name);
                }
            }
        });
        int t=0,row=k,m=0;
        int j=0;
        String[] answers = new String[2 * n / k];
        while (row>0){
            if (row==k){
                //输出的第一行
                m=n-(n/k*(k-1));
            }else {
                //之后除第一行
                m=n/k;
            }
            answers[m/2]=studentsArray[t].name;
            //处理左边的
            j=m/2-1;
            for (int i = t+1; i <t+m ; i+=2) {
                answers[j--]=studentsArray[i].name;
            }
            //处理右边的
            j=m/2+1;
            for (int i = t+2; i < t + m; i+=2) {
                answers[j++]=studentsArray[i].name;
            }
            //输出
            System.out.print(answers[0]);
            for (int i = 1; i < m; i++) {
                System.out.print(" "+answers[i]);
            }
            System.out.println();
            t+=m;
            row--;
        }
    }
}
class Student {
    String name;
    int age;

    public Student(String name, int age) {
        this.name = name;
        this.age = age;
    }

    @Override
    public String toString() {
        return "Student{" +
                "name='" + name + '\'' +
                ", age=" + age +
                '}';
    }
}

代码2

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Comparator;
import java.util.LinkedList;

//也是17分
public class Main{
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] line = br.readLine().split(" ");
        int n = Integer.parseInt(line[0]);
        int k = Integer.parseInt(line[1]);
        LinkedList<Student> students = new LinkedList<>();
        while (n-- > 0) {
            line = br.readLine().split(" ");
            students.addLast(new Student(line[0], Integer.parseInt(line[1])));
        }
        students.sort(new Comparator<Student>() {
            @Override
            public int compare(Student o1, Student o2) {
                if (o1.age != o2.age) {
                    return o2.age - o1.age;
                } else {
                    return o1.name.compareTo(o2.name);
                }
            }
        });
//        students.forEach(System.out::println);
        LinkedList<String> printList = new LinkedList<>();
        int students_i=0;
        if (students.size() < k) {
            boolean flag = false;
            //flag为false就右,true就为左
            while (students.size() != 0) {
                if (flag) {
                    printList.addFirst(students.get(students_i).name);
                    students_i++;
                } else {
                    printList.addLast(students.get(students_i).name);
                    students_i++;
                }
                flag = !flag;
            }
            //输出
            for (int i = 0; i < printList.size(); i++) {
                if (i == 0) System.out.print(printList.get(i));
                else System.out.print(" " + printList.get(i));
            }
        } else {
            int left = students.size() % k;
            //第一次
            int time = k + left;
            boolean flag = false;
            while (time-- > 0) {
                //flag为false就右,true就为左
                if (flag) {
                    printList.addFirst(students.get(students_i).name);
                    students_i++;
                } else {
                    printList.addLast(students.get(students_i).name);
                    students_i++;
                }
                flag = !flag;
            }
            //输出
            for (int i = 0; i < printList.size(); i++) {
                if (i == 0) System.out.print(printList.get(i));
                else System.out.print(" " + printList.get(i));
            }
            System.out.println();
            printList.clear();
            //之后的
            time=(students.size()/k)-1;
            while (time-->0){
                flag=false;
                int time2=k;
                while (time2-->0){
                    //flag为false就右,true就为左
                    if (flag) {
                        printList.addFirst(students.get(students_i).name);
                        students_i++;
                    } else {
                        printList.addLast(students.get(students_i).name);
                        students_i++;
                    }
                    flag = !flag;
                }
                //输出
                for (int i = 0; i < printList.size(); i++) {
                    if (i == 0) System.out.print(printList.get(i));
                    else System.out.print(" " + printList.get(i));
                }
                System.out.println();
                printList.clear();
            }

        }

    }
}

class Student {
    String name;
    int age;

    public Student(String name, int age) {
        this.name = name;
        this.age = age;
    }

    @Override
    public String toString() {
        return "Student{" +
                "name='" + name + '\'' +
                ", age=" + age +
                '}';
    }
}

  • 6
    点赞
  • 6
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

十有久诚

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值