#8325 (Java21) No.120 傾向と対策：門松列（その１）

提出ソース

結果

問題	No.120 傾向と対策：門松列（その１）
ユーザー	threepipes_s
提出日時	2015-01-09 01:17:51
言語	Java21 (openjdk 21)
結果	AC
実行時間	334 ms / 5,000 ms
コード長	6,355 bytes
コンパイル時間	3,023 ms
コンパイル使用メモリ	84,292 KB
実行使用メモリ	45,252 KB
最終ジャッジ日時	2024-06-13 03:26:10
合計ジャッジ時間	5,049 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	334 ms 44,916 KB
testcase_01	AC	330 ms 44,416 KB
testcase_02	AC	276 ms 45,252 KB
testcase_03	AC	318 ms 45,012 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.PriorityQueue;
import java.util.TreeSet;
public class Main {
	public static int[] dp;
	public static int n;
	public static int d;
	public static int k;
	public static int max = 1;
	public static PriorityQueue<Integer> qu;
	public static void main(String[] args) throws NumberFormatException, IOException{
		ContestScanner in = new ContestScanner();
		int t = in.nextInt();
		for(int i=0; i<t; i++){
			int n = in.nextInt();
//			TreeSet<Take> take = new TreeSet<Take>();
			HashMap<Integer, Integer> take = new HashMap<Integer, Integer>();
			for(int j=0; j<n; j++){
				int l = in.nextInt();
				if(take.containsKey(l)){
					int num = take.get(l);
					take.put(l, num+1);
				}else{
					take.put(l, 1);
				}
			}
			Integer[] a = new Integer[take.size()];
			int j=0;
			for(int val: take.values()){
				a[j++] = val;
			}
			Arrays.sort(a, Collections.reverseOrder());
			System.out.println(search(a, n));
			
		}
	}
	
	public static int search(Integer[] a, int n){
		int max = n/3;
		boolean ok = false;
		while(max > 0 && !(ok = makePair(a.clone(), max--)));
		if(ok) max++;
		return max;
	}
	
	public static boolean makePair(Integer[] a, int pairnum){
		int size = a.length;
		int b[][] = new int[pairnum][3];
		int j = 0;
		boolean over = false;
		for(int i=0; i<size; i++){
			while(a[i] > 0){
				if(j >= pairnum && b[j%pairnum][j/pairnum-1] == i+1) break;
				b[j%pairnum][j/pairnum] = i+1;
				j++;
				a[i]--;
				if(j >= pairnum*3){
					over = true;
					break;
				}
			}
			if(over) break;
		}
		if(!over) return false;
//		for(int i=0; i<b.length; i++){
//			if(!isPair(b[i])) return false;
//		}
		return true;
	}
	
	public static boolean isPair(int[] b){
		if(b[0] != b[1] && b[1] != b[2] && b[2] != b[0]){
			return true;
		}
		return false;
	}
}

class Take implements Comparable<Take>{
	int l;
	int num;
	public Take(int l){
		this.l = l;
		num = 1;
	}
	
	public int compareTo(Take arg0) {
		return Integer.compare(num, arg0.num);
	}
}

class MyComp implements Comparator<int[]>{
	public int compare(int[] a, int[] b) {
		return a[0] - b[0];
	}
}


class Reverse implements Comparator<Integer>{
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}

class Node{
	int id;
	List<Node> edge = new ArrayList<Node>();
	public Node(int id){
		this.id = id;
	}
	public void createEdge(Node node){
		edge.add(node);
	}
}


class NodeW{
	int id;
	List<NodeW> edge = new ArrayList<NodeW>();
	List<Integer> costList = new ArrayList<Integer>();
	public NodeW(int id) {
		this.id = id;
	}
	public void createEdge(NodeW node, int cost) {
		edge.add(node);
		costList.add(cost);
	}
}

class Range<T extends Comparable<T>> implements Comparable<Range<T>>{
	T start;
	T end;
	public Range(T start, T end){
		this.start = start;
		this.end = end;
	}
	public boolean inRange(T val){
		if(start.compareTo(val) <= 0 && end.compareTo(val) >= 0){
			return true;
		}
		return false;
	}
	public boolean isCommon(Range<T> range){
		if(inRange(range.start) || inRange(range.end) || range.inRange(start)){
			return true;
		}
		return false;
	}
	public Range<T> connect(Range<T> range){
		if(!isCommon(range)) return null;
		Range<T> res = new Range<T>(start.compareTo(range.start) <= 0 ? start : range.start,
				end.compareTo(range.end) >= 0 ? end : range.end);
		return res;
	}
	public boolean connectToThis(Range<T> range){
		if(!isCommon(range)) return false;
		start = start.compareTo(range.start) <= 0 ? start : range.start;
		end = end.compareTo(range.end) >= 0 ? end : range.end;
		return true;
	}
	@Override
	public int compareTo(Range<T> range) {
		int res = start.compareTo(range.start);
		if(res == 0) return end.compareTo(range.end);
		return res;
	}
	public String toString(){
		return "["+start+","+end+"]";
	}
}

class RangeSet<T extends Comparable<T>>{
	TreeSet<Range<T>> ranges = new TreeSet<Range<T>>();
	public void add(Range<T> range){
		Range<T> con = ranges.floor(range);
		if(con != null){
			if(con.connectToThis(range))
				range = con;
		}
		con = ranges.ceiling(range);
		while(con != null && range.connectToThis(con)){
			ranges.remove(con);
			con = ranges.ceiling(range);
		}
		ranges.add(range);
	}
	public String toString(){
		StringBuilder bld = new StringBuilder();
		for(Range<T> r: ranges){
			bld.append(r+"\n");
		}
		return bld.toString();
	}
}


class MyMath{
	public final static double PIhalf = Math.PI/2.0;
	public static double pAngle(double x, double y){
		// ベクトル(1, 0)と(x, y)とのなす角を返す(rad:0 to 2pi)
		if(x == 0){
			if(y == 0){
				System.err.println("pAngle error: zero vector.");
				return 0;
			}else if(y < 0){
				return PIhalf*3.0;
			}else{
				return PIhalf;
			}
		}
		double rad = Math.atan(y/x);
		if(rad < 0){
			rad += Math.PI*2.0;
		}
		return rad;
	}
	public static long fact(long n){
		long res = 1;
		while(n > 0){
			res *= n--;
		}
		return res;
	}
	public static long[][] pascalT(int n){
		long[][] tri = new long[n][];
		for(int i=0; i<n; i++){
			tri[i] = new long[i+1];
			for(int j=0; j<i+1; j++){
				if(j == 0 || j == i){
					tri[i][j] = 1;
				}else{
					tri[i][j] = tri[i-1][j-1] + tri[i-1][j];
				}
			}
		}
		return tri;
	}

	// 最大公約数
	static int gcd(int a, int b){
		return b == 0 ? a : gcd(b, a % b);
	}

	// 最小公倍数
	static int lcm(int a, int b){
		return a * b / gcd(a, b);
	}
}

class ContestScanner{
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(System.in));
	}
	public String nextToken() throws IOException{
		if(line == null || line.length <= idx){
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	public long nextLong() throws IOException, NumberFormatException{
		return Long.parseLong(nextToken());
	}
	public int nextInt() throws NumberFormatException, IOException{
		return (int)nextLong();
	}
	public double nextDouble() throws NumberFormatException, IOException{
		return Double.parseDouble(nextToken());
	}
}

yukicoder

結果

テストケース

ソースコード