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

• 問題: No.120 傾向と対策：門松列（その１）
• ユーザー: yuya178
• 提出日時: 2017-11-20 16:49:18
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 172 ms / 5,000 ms
• コード長: 4,578 bytes
• コンパイル時間: 3,864 ms
• コンパイル使用メモリ: 85,560 KB
• 実行使用メモリ: 43,700 KB
• 最終ジャッジ日時: 2024-11-26 03:21:08
• 合計ジャッジ時間: 4,239 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	161 ms; 42,936 KB
testcase_01	AC	169 ms; 43,700 KB
testcase_02	AC	151 ms; 42,140 KB
testcase_03	AC	172 ms; 43,400 KB

ソースコード

import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    long MOD = 1_000_000_007;
    int inf = 10000000;
    void solve()
    {
        int T = ni();
        for(int i = 0; i < T; i++){
            HashMap<Integer, Integer> map = new HashMap<>();
            int n = ni();
            for(int j = 0; j < n; j++){
                int a = ni();
                map.merge(a, 1, (x,y) -> x + y);
            }
            int k = map.size();
            PriorityQueue<Integer> pq = new PriorityQueue<Integer>(Collections.reverseOrder());
            for(Map.Entry<Integer,Integer> v : map.entrySet()){
                int b = v.getValue();
                pq.add(b);
            }
            int ans = 0;
            while(pq.size()>=3){
                int a = pq.poll();
                int b = pq.poll();
                int c = pq.poll();
                a--;
                b--;
                c--;
                ans++;
                if(a>0) pq.add(a);
                if(b>0) pq.add(b);
                if(c>0) pq.add(c);
            }
            out.println(ans);

        }


    }
   
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}