Submission #7980900
Source Code Expand
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using static System.Console;
using static System.Convert;
using static System.Math;
using Pi = Pair<int, int>;
using PL = Pair<long, int>;
//using static System.Globalization.CultureInfo;
using System.Text;
class Program
{
public static bool chmin<T>(ref T num, T val) where T : IComparable<T>
{ if (num.CompareTo(val) == 1) { num = val; return true; } return false; }
public static bool chmax<T>(ref T num, T val) where T : IComparable<T>
{ if (num.CompareTo(val) == -1) { num = val; return true; } return false; }
public static void swap<T>(ref T v1, ref T v2)
{ var t = v2; v2 = v1; v1 = t; }
public static void Fail() => Fail("No");
public static void Fail<T>(T s) { WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
static void Main(string[] args)
{
var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
Console.SetOut(sw);
var p = new Program();
for (var i = 1; i > 0; --i)
p.Solve();
Console.Out.Flush();
}
void Solve()
{
WriteLine(1005);
}
}
public class Input
{
public static string read => ReadLine().Trim();
public static int[] ar => read.Split(' ').Select(int.Parse).ToArray();
public static int num => ToInt32(read);
public static long[] arL => read.Split(' ').Select(long.Parse).ToArray();
public static long numL => ToInt64(read);
public static T[] Create<T>(int n, Func<T> f)
=> Enumerable.Repeat(0, n).Select(_ => f()).ToArray();
public static char[][] grid(int h)
=> Create(h, () => read.ToCharArray());
public static int[] ar1D(int n)
=> Create(n, () => num);
public static long[] arL1D(int n)
=> Create(n, () => numL);
public static string[] strs(int n)
=> Create(n, () => read);
public static int[][] ar2D(int n)
=> Create(n, () => ar);
public static long[][] arL2D(int n)
=> Create(n, () => arL);
public static List<T>[] edge<T>(int n)
=> Create(n, () => new List<T>());
public static void Make<T1, T2>(out T1 v1, out T2 v2)
{
v1 = Next<T1>();
v2 = Next<T2>();
}
public static void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3)
{
Make(out v1, out v2);
v3 = Next<T3>();
}
public static void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4)
{
Make(out v1, out v2, out v3);
v4 = Next<T4>();
}
public static void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5)
{
Make(out v1, out v2, out v3, out v4);
v5 = Next<T5>();
}
public static void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6)
{
Make(out v1, out v2, out v3, out v4, out v5);
v6 = Next<T6>();
}
static Input()
{
sc = new Queue<string>();
dic = new Dictionary<Type, Func<string, object>>();
dic[typeof(int)] = s => int.Parse(s);
dic[typeof(long)] = s => long.Parse(s);
dic[typeof(char)] = s => char.Parse(s);
dic[typeof(double)] = s => double.Parse(s);
dic[typeof(uint)] = s => uint.Parse(s);
dic[typeof(ulong)] = s => ulong.Parse(s);
dic[typeof(string)] = s => s;
}
private static Dictionary<Type, Func<string, object>> dic;
private static Queue<string> sc;
public static T Next<T>() { if (sc.Count == 0) foreach (var item in read.Split(' ')) sc.Enqueue(item); return (T)dic[typeof(T)](sc.Dequeue()); }
public const int MOD = 1000000007;
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
public T1 v1 { get; set; }
public T2 v2 { get; set; }
public Pair() { v1 = Input.Next<T1>(); v2 = Input.Next<T2>(); }
public Pair(T1 v1, T2 v2)
{ this.v1 = v1; this.v2 = v2; }
public int CompareTo(Pair<T1, T2> p)
{
var c = Comparer<T1>.Default.Compare(v1, p.v1);
if (c == 0)
c = Comparer<T2>.Default.Compare(v2, p.v2);
return c;
}
public Pair<T1, T2, T3> Push<T3>(T3 val)
=> new Pair<T1, T2, T3>(v1, v2, val);
public override string ToString()
=> $"{v1.ToString()} {v2.ToString()}";
public override bool Equals(object obj)
=> this == (Pair<T1, T2>)obj;
public override int GetHashCode()
=> v1.GetHashCode() ^ v2.GetHashCode();
public static bool operator ==(Pair<T1, T2> p1, Pair<T1, T2> p2)
=> p1.CompareTo(p2) == 0;
public static bool operator !=(Pair<T1, T2> p1, Pair<T1, T2> p2)
=> p1.CompareTo(p2) != 0;
public static bool operator >(Pair<T1, T2> p1, Pair<T1, T2> p2)
=> p1.CompareTo(p2) == 1;
public static bool operator >=(Pair<T1, T2> p1, Pair<T1, T2> p2)
=> p1.CompareTo(p2) != -1;
public static bool operator <(Pair<T1, T2> p1, Pair<T1, T2> p2)
=> p1.CompareTo(p2) == -1;
public static bool operator <=(Pair<T1, T2> p1, Pair<T1, T2> p2)
=> p1.CompareTo(p2) != 1;
}
public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
public T3 v3 { get; set; }
public Pair() : base() { v3 = Input.Next<T3>(); }
public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
{ this.v3 = v3; }
public int CompareTo(Pair<T1, T2, T3> p)
{
var c = base.CompareTo(p);
if (c == 0)
c = Comparer<T3>.Default.Compare(v3, p.v3);
return c;
}
public override string ToString()
=> $"{base.ToString()} {v3.ToString()}";
}
Submission Info
Submission Time |
|
Task |
A - チーム分け |
User |
hibatibati |
Language |
C# (Mono 4.6.2.0) |
Score |
100 |
Code Size |
5801 Byte |
Status |
AC |
Exec Time |
20 ms |
Memory |
11092 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample-01.txt |
All |
sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, sample-01.txt |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
AC |
19 ms |
9044 KB |
01-02.txt |
AC |
20 ms |
11092 KB |
01-03.txt |
AC |
19 ms |
9044 KB |
01-04.txt |
AC |
20 ms |
11092 KB |
01-05.txt |
AC |
20 ms |
11092 KB |
01-06.txt |
AC |
20 ms |
11092 KB |
01-07.txt |
AC |
19 ms |
9044 KB |
01-08.txt |
AC |
20 ms |
11092 KB |
01-09.txt |
AC |
19 ms |
9044 KB |
01-10.txt |
AC |
20 ms |
11092 KB |
01-11.txt |
AC |
19 ms |
9044 KB |
01-12.txt |
AC |
20 ms |
11092 KB |
01-13.txt |
AC |
19 ms |
9044 KB |
01-14.txt |
AC |
19 ms |
9044 KB |
01-15.txt |
AC |
19 ms |
9044 KB |
01-16.txt |
AC |
20 ms |
11092 KB |
01-17.txt |
AC |
20 ms |
11092 KB |
01-18.txt |
AC |
20 ms |
9044 KB |
01-19.txt |
AC |
20 ms |
11092 KB |
01-20.txt |
AC |
20 ms |
9044 KB |
sample-01.txt |
AC |
19 ms |
9044 KB |