結果
問題 | No.3100 始業式 |
ユーザー | KumaTachiRen |
提出日時 | 2023-03-31 22:03:00 |
言語 | C# (.NET 8.0.203) |
結果 |
WA
|
実行時間 | - |
コード長 | 8,734 bytes |
コンパイル時間 | 7,962 ms |
コンパイル使用メモリ | 166,256 KB |
実行使用メモリ | 187,860 KB |
最終ジャッジ日時 | 2024-09-23 00:44:26 |
合計ジャッジ時間 | 8,338 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (101 ms)。 MSBuild のバージョン 17.9.6+a4ecab324 (.NET) main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
using System; using System.Collections; using System.Collections.Generic; using System.Diagnostics; using System.Diagnostics.Contracts; using System.IO; using System.Linq; using System.Numerics; using System.Runtime.CompilerServices; using System.Runtime.InteropServices; using System.Text; using static Functions; static class Program { static public void Main(string[] args) { Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); new Solver(); Console.Out.Flush(); } } public class Solver { public Solver() { Solve(); } void Solve() { int cnt = 0; int t = ri; for (int i = 0; i < t; i++) { int n = ri; for (int j = 0; j < n; j++) cnt += ri; } WriteJoin("\n", Enumerable.Repeat(cnt, t)); } const long INF = 1L << 60; int ri { get { return (int)sc.Integer(); } } long rl { get { return sc.Integer(); } } ulong rul { get { return sc.UInteger(); } } double rd { get { return sc.Double(); } } string rs { get { return sc.Scan(); } } string rline { get { return sc.Line(); } } public StreamScanner sc = new StreamScanner(Console.OpenStandardInput()); [MethodImpl(MethodImplOptions.AggressiveInlining)] T[] RepArray<T>(T t, int count) => Enumerable.Repeat(t, count).ToArray(); [MethodImpl(MethodImplOptions.AggressiveInlining)] void WriteJoin<T>(string s, IEnumerable<T> t) => Console.WriteLine(string.Join(s, t)); [MethodImpl(MethodImplOptions.AggressiveInlining)] void WriteMat<T>(T[,] a) { int sz1 = a.GetLength(0); int sz2 = a.GetLength(1); for (int i = 0; i < sz1; i++) { var s = new List<string>(); for (int j = 0; j < sz2; j++) s.Add(a[i, j].ToString()); WriteJoin(" ", s); } } [MethodImpl(MethodImplOptions.AggressiveInlining)] void Write(object t) => Console.WriteLine(t.ToString()); [MethodImpl(MethodImplOptions.AggressiveInlining)] void Write(string str) => Console.WriteLine(str); [MethodImpl(MethodImplOptions.AggressiveInlining)] void Write(string str, object arg1) => Console.WriteLine(str, arg1); [MethodImpl(MethodImplOptions.AggressiveInlining)] void Write(string str, object arg1, object arg2) => Console.WriteLine(str, arg1, arg2); [MethodImpl(MethodImplOptions.AggressiveInlining)] void Write(string str, object arg1, object arg2, object arg3) => Console.WriteLine(str, arg1, arg2, arg3); [MethodImpl(MethodImplOptions.AggressiveInlining)] void Write(string str, params object[] arg) => Console.WriteLine(str, arg); [MethodImpl(MethodImplOptions.AggressiveInlining)] void WriteFlush(object t) { Console.WriteLine(t.ToString()); Console.Out.Flush(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] void WriteError(object t) => Console.Error.WriteLine(t.ToString()); [MethodImpl(MethodImplOptions.AggressiveInlining)] void YN(bool t) => Console.WriteLine(t ? "YES" : "NO"); [MethodImpl(MethodImplOptions.AggressiveInlining)] void Yn(bool t) => Console.WriteLine(t ? "Yes" : "No"); [MethodImpl(MethodImplOptions.AggressiveInlining)] void yn(bool t) => Console.WriteLine(t ? "yes" : "no"); } public static class Functions { public static int Popcount(ulong x) { x = (x & 0x5555555555555555UL) + ((x >> 1) & 0x5555555555555555UL); x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL); x = (x & 0x0f0f0f0f0f0f0f0fUL) + ((x >> 4) & 0x0f0f0f0f0f0f0f0fUL); x = (x & 0x00ff00ff00ff00ffUL) + ((x >> 8) & 0x00ff00ff00ff00ffUL); x = (x & 0x0000ffff0000ffffUL) + ((x >> 16) & 0x0000ffff0000ffffUL); x = (x & 0x00000000ffffffffUL) + ((x >> 32) & 0x00000000ffffffffUL); return (int)x; } public static int Popcount(int x) { x = (x & 0x55555555) + ((x >> 1) & 0x55555555); x = (x & 0x33333333) + ((x >> 2) & 0x33333333); x = (x & 0x0f0f0f0f) + ((x >> 4) & 0x0f0f0f0f); x = (x & 0x00ff00ff) + ((x >> 8) & 0x00ff00ff); x = (x & 0x0000ffff) + ((x >> 16) & 0x0000ffff); return x; } public static int Ctz(long x) { if (x == 0) return -1; return Popcount((ulong)((x & -x) - 1)); } public static int SafeMod(int x, int m) { int r = x % m; return r < 0 ? r + m : r; } public static long SafeMod(long x, long m) { long r = x % m; return r < 0 ? r + m : r; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int Sign(long x) => x == 0 ? 0 : (x < 0 ? -1 : 1); [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int DigitSum(long n, int d = 10) { long s = 0; while (n > 0) { s += n % d; n /= d; } return (int)s; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1; [MethodImpl(MethodImplOptions.AggressiveInlining)] public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b; [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(MethodImplOptions.AggressiveInlining)] public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T Clamp<T>(T x, T l, T r) where T : IComparable<T> => x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r); [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T Clamp<T>(ref T x, T l, T r) where T : IComparable<T> => x = x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r); [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y; } public static int LowerBound<T>(T[] arr, Func<T, int> comp, int l = -1, int r = -1) => LowerBound<T>(arr.AsSpan<T>(), comp, l, r); public static int LowerBound<T>(Span<T> data, Func<T, int> comp, int l = -1, int r = -1) { if (data.Length == 0) return -1; if (l == -1) l = 0; if (r == -1) r = data.Length; while (l < r) { int x = (l + r) / 2; if (comp(data[x]) < 0) l = x + 1; else r = x; } return l; } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } private readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) throw new EndOfStreamException(); if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while (b < 33 || 126 < b); return (char)b; } public string Line() { var sb = new StringBuilder(); for (var b = Char(); b != 10 && !isEof; b = (char)read()) sb.Append(b); return sb.ToString(); } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public long Integer() { long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != '-' && (b < '0' || '9' < b)); if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public ulong UInteger() { ulong ret = 0; byte b = 0; do b = read(); while (b < '0' || '9' < b); for (; true; b = read()) { if (b < '0' || '9' < b) return ret; else ret = ret * 10 + b - '0'; } } public double Double() { return double.Parse(Scan()); } }