結果
| 問題 |
No.120 傾向と対策：門松列（その１）
|
| コンテスト | |
| ユーザー |
 femto
|
| 提出日時 | 2015-04-06 00:17:54 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 6,305 bytes |
| コンパイル時間 | 1,061 ms |
| コンパイル使用メモリ | 120,272 KB |
| 実行使用メモリ | 26,872 KB |
| 最終ジャッジ日時 | 2024-07-04 02:21:37 |
| 合計ジャッジ時間 | 1,809 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | RE * 4 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Diagnostics;
using System.Collections.Generic;
using System.Linq;
using Enu = System.Linq.Enumerable;
class Solution {
int T, N;
int[] L;
const int MAX = 100;
void calc() {
T = ri();
var ans = new List<int>();
for (int loop = 0; loop < T; loop++) {
N = ri();
L = ria(N);
int[] count = new int[MAX + 1];
foreach (var l in L) {
count[l]++;
}
var q = new PriorityQueue<elem>((e1, e2) => e1.count.CompareTo(e2.count));
for (int i = 1; i <= MAX; i++) {
if (count[i] > 0) q.Push(new elem(i, count[i]));
}
int kadomatu = 0;
while (q.Count() >= 3) {
var elems = new elem[3];
for (int i = 0; i < 3; i++) {
elems[i] = q.Pop();
}
foreach (var e in elems) {
e.count--;
if (e.count > 0) q.Push(e);
}
kadomatu++;
}
ans.Add(kadomatu);
}
foreach (var a in ans) {
Console.WriteLine(a);
}
}
class elem {
public int num, count;
public elem(int num, int count) {
this.num = num; this.count = count;
}
}
static void Main(string[] args) {
new Solution().calc();
}
#region
static int ri() { return int.Parse(Console.ReadLine()); }
static int[] ria(int n) {
if (n <= 0) { Console.ReadLine(); return new int[0]; }
else return Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray();
}
static void rio(out int p1) { p1 = ri(); }
static void rio(out int p1, out int p2) { var r = ria(2); p1 = r[0]; p2 = r[1]; }
static void rio(out int p1, out int p2, out int p3) { var r = ria(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
static void rio(out int p1, out int p2, out int p3, out int p4) { var r = ria(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
static void rio(out int p1, out int p2, out int p3, out int p4, out int p5) { var r = ria(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
static long rl() { return long.Parse(Console.ReadLine()); }
static long[] rla(int n) {
if (n <= 0) { Console.ReadLine(); return new long[0]; }
else return Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray();
}
static void rlo(out long p1) { p1 = rl(); }
static void rlo(out long p1, out long p2) { var r = rla(2); p1 = r[0]; p2 = r[1]; }
static void rlo(out long p1, out long p2, out long p3) { var r = rla(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
static void rlo(out long p1, out long p2, out long p3, out long p4) { var r = rla(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
static void rlo(out long p1, out long p2, out long p3, out long p4, out long p5) { var r = rla(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
static double rd() { return double.Parse(Console.ReadLine()); }
static double[] rda(int n) {
if (n <= 0) { Console.ReadLine(); return new double[0]; }
else return Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray();
}
static void rdo(out double p1) { p1 = rd(); }
static void rdo(out double p1, out double p2) { var r = rda(2); p1 = r[0]; p2 = r[1]; }
static void rdo(out double p1, out double p2, out double p3) { var r = rda(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
static void rdo(out double p1, out double p2, out double p3, out double p4) { var r = rda(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
static void rdo(out double p1, out double p2, out double p3, out double p4, out double p5) { var r = rda(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
static void swap<T>(ref T x, ref T y) { T temp = x; x = y; y = temp; }
static void wa1<T>(T[] a) { Debug.WriteLine(string.Join(" ", a)); }
static void wa2<T>(T[][] a) {
foreach (var row in a) {
Debug.WriteLine(String.Join(" ", row));
}
}
[DebuggerDisplay("{x} , {y}")]
class point {
public int x, y;
public point(int x, int y) {
this.x = x; this.y = y;
}
}
#endregion
}
static class Extention {
public static T[][] ToJagArray<T>(this T[,] a) {
int n = a.GetLength(0), m = a.GetLength(1);
var ret = new T[n][];
for (int i = 0; i < n; i++) {
ret[i] = new T[m];
for (int j = 0; j < m; j++) {
ret[i][j] = a[i, j];
}
}
return ret;
}
}
public class PriorityQueue<T> {
private List<T> buffer;
private Comparison<T> comp;
// 昇順
// (e1, e2) => e2.CompareTo(e1)
// 降順
// (e1, e2) => e1.CompareTo(e2)
public PriorityQueue(Comparison<T> comp) {
buffer = new List<T>();
this.comp = comp;
}
public PriorityQueue(Comparison<T> comp, IEnumerable<T> data)
: this(comp) {
foreach (T e in data) Push(e);
}
public void Push(T elem) { PushHeap(this.buffer, elem); }
public T Pop() { return PopHeap(this.buffer); }
public int Count() { return buffer.Count; }
public T Top() { return buffer[0]; }
private void PushHeap(List<T> array, T elem) {
int n = array.Count;
array.Add(elem);
while (n != 0) {
int i = (n - 1) / 2;
// 親と値を入れ替え
if (comp(array[n], array[i]) > 0) {
T tmp = array[n]; array[n] = array[i]; array[i] = tmp;
}
n = i;
}
}
private T PopHeap(List<T> array) {
int n = array.Count - 1;
T returnelem = array[0];
array[0] = array[n];
array.RemoveAt(n);
for (int i = 0, j; (j = 2 * i + 1) < n; ) {
// 値の大きい方の子を選ぶ
if ((j != n - 1) && (comp(array[j], array[j + 1]) < 0))
j++;
// 子と値を入れ替え
if (comp(array[i], array[j]) < 0) {
T tmp = array[j]; array[j] = array[i]; array[i] = tmp;
}
i = j;
}
return returnelem;
}
}