結果
問題 | No.471 直列回転機 |
ユーザー | りあん |
提出日時 | 2016-12-21 06:24:52 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 349 ms / 3,141 ms |
コード長 | 9,510 bytes |
コンパイル時間 | 2,932 ms |
コンパイル使用メモリ | 110,380 KB |
実行使用メモリ | 45,616 KB |
平均クエリ数 | 19588.39 |
最終ジャッジ日時 | 2023-09-02 03:45:36 |
合計ジャッジ時間 | 18,370 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 98 ms
37,480 KB |
testcase_01 | AC | 94 ms
37,904 KB |
testcase_02 | AC | 94 ms
39,948 KB |
testcase_03 | AC | 94 ms
37,392 KB |
testcase_04 | AC | 91 ms
37,232 KB |
testcase_05 | AC | 94 ms
37,200 KB |
testcase_06 | AC | 91 ms
39,268 KB |
testcase_07 | AC | 87 ms
38,040 KB |
testcase_08 | AC | 118 ms
42,168 KB |
testcase_09 | AC | 121 ms
41,852 KB |
testcase_10 | AC | 101 ms
39,296 KB |
testcase_11 | AC | 196 ms
44,472 KB |
testcase_12 | AC | 297 ms
45,616 KB |
testcase_13 | AC | 296 ms
43,584 KB |
testcase_14 | AC | 314 ms
41,588 KB |
testcase_15 | AC | 349 ms
44,112 KB |
testcase_16 | AC | 89 ms
37,792 KB |
testcase_17 | AC | 85 ms
37,548 KB |
testcase_18 | AC | 85 ms
37,660 KB |
testcase_19 | AC | 85 ms
37,456 KB |
testcase_20 | AC | 315 ms
43,812 KB |
testcase_21 | AC | 153 ms
44,152 KB |
testcase_22 | AC | 301 ms
42,916 KB |
testcase_23 | AC | 278 ms
45,588 KB |
testcase_24 | AC | 208 ms
44,404 KB |
testcase_25 | AC | 140 ms
39,732 KB |
testcase_26 | AC | 307 ms
41,104 KB |
testcase_27 | AC | 205 ms
42,512 KB |
testcase_28 | AC | 217 ms
44,796 KB |
testcase_29 | AC | 242 ms
42,964 KB |
testcase_30 | AC | 171 ms
43,984 KB |
testcase_31 | AC | 329 ms
43,428 KB |
testcase_32 | AC | 297 ms
42,956 KB |
testcase_33 | AC | 241 ms
40,588 KB |
testcase_34 | AC | 305 ms
43,652 KB |
testcase_35 | AC | 151 ms
41,832 KB |
testcase_36 | AC | 188 ms
42,028 KB |
testcase_37 | AC | 114 ms
39,292 KB |
testcase_38 | AC | 141 ms
41,868 KB |
testcase_39 | AC | 179 ms
43,740 KB |
testcase_40 | AC | 258 ms
44,728 KB |
testcase_41 | AC | 320 ms
43,784 KB |
testcase_42 | AC | 237 ms
43,092 KB |
testcase_43 | AC | 294 ms
41,000 KB |
testcase_44 | AC | 119 ms
35,316 KB |
testcase_45 | AC | 232 ms
44,576 KB |
testcase_46 | AC | 257 ms
43,136 KB |
testcase_47 | AC | 294 ms
43,764 KB |
testcase_48 | AC | 277 ms
45,380 KB |
testcase_49 | AC | 260 ms
43,456 KB |
testcase_50 | AC | 306 ms
43,592 KB |
testcase_51 | AC | 182 ms
43,756 KB |
testcase_52 | AC | 90 ms
37,592 KB |
testcase_53 | AC | 92 ms
39,416 KB |
testcase_54 | AC | 92 ms
39,636 KB |
testcase_55 | AC | 159 ms
41,572 KB |
testcase_56 | AC | 151 ms
41,308 KB |
testcase_57 | AC | 132 ms
41,504 KB |
testcase_58 | AC | 109 ms
39,740 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections.Generic; using System.Linq; using System.Linq.Expressions; using System.IO; using System.Text; using System.Diagnostics; using Binary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.BinaryExpression>; using Unary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.UnaryExpression>; class Program { static StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; static Scan sc = new Scan(); // static Scan sc = new ScanCHK(); const int M = 1000000007; const double eps = 1e-9; static readonly int[] dd = { 0, 1, 0, -1, 0 }; static void Main() { int m = sc.Int; var p = new int[m][]; for (int i = 0; i < m; i++) { p[i] = sc.IntArr; } DBG("? 0 0"); var o = sc.IntArr; DBG("? 1 0"); var x = sub(sc.IntArr, o); int[] y = { -x[1], x[0] }; Prt("!"); for (int i = 0; i < m; i++) { Prt(add(o, mul(p[i][0], x), mul(p[i][1], y))); } sw.Flush(); } static int[] add(params int[][] a) { var ret = new int[a[0].Length]; for (int i = 0; i < a[0].Length; i++) for (int j = 0; j < a.Length; j++) ret[i] += a[j][i]; return ret; } static int[] sub(int[] a, int[] b) { var ret = new int[a.Length]; for (int i = 0; i < a.Length; i++) ret[i] = a[i] - b[i]; return ret; } static int[] mul(int a, int[] b) { var ret = new int[b.Length]; for (int i = 0; i < b.Length; i++) ret[i] = a * b[i]; return ret; } static void swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; } static T Max<T>(params T[] a) => a.Max(); static T Min<T>(params T[] a) => a.Min(); static void DBG<T>(params T[] a) => Console.WriteLine(string.Join(" ", a)); static void DBG(params object[] a) => Console.WriteLine(string.Join(" ", a)); static void Prt<T>(params T[] a) => sw.WriteLine(string.Join(" ", a)); static void Prt(params object[] a) => sw.WriteLine(string.Join(" ", a)); } static class ex { public static string con<T>(this IEnumerable<T> a) => a.con(" "); public static string con<T>(this IEnumerable<T> a, string s) => string.Join(s, a); public static void swap<T>(this IList<T> a, int i, int j) { var t = a[i]; a[i] = a[j]; a[j] = t; } public static T[] copy<T>(this IList<T> a) { var ret = new T[a.Count]; for (int i = 0; i < a.Count; i++) ret[i] = a[i]; return ret; } } static class Operator<T> { static readonly ParameterExpression x = Expression.Parameter(typeof(T), "x"); static readonly ParameterExpression y = Expression.Parameter(typeof(T), "y"); public static readonly Func<T, T, T> Add = Lambda(Expression.Add); public static readonly Func<T, T, T> Subtract = Lambda(Expression.Subtract); public static readonly Func<T, T, T> Multiply = Lambda(Expression.Multiply); public static readonly Func<T, T, T> Divide = Lambda(Expression.Divide); public static readonly Func<T, T> Plus = Lambda(Expression.UnaryPlus); public static readonly Func<T, T> Negate = Lambda(Expression.Negate); public static Func<T, T, T> Lambda(Binary op) => Expression.Lambda<Func<T, T, T>>(op(x, y), x, y).Compile(); public static Func<T, T> Lambda(Unary op) => Expression.Lambda<Func<T, T>>(op(x), x).Compile(); } class ScanCHK : Scan { public new string Str { get { var s = Console.ReadLine(); if (s != s.Trim()) throw new Exception(); return s; } } } class Scan { public int Int => int.Parse(Str); public long Long => long.Parse(Str); public double Double => double.Parse(Str); public string Str => Console.ReadLine().Trim(); public int[] IntArr => StrArr.Select(int.Parse).ToArray(); public long[] LongArr => StrArr.Select(long.Parse).ToArray(); public double[] DoubleArr => StrArr.Select(double.Parse).ToArray(); public string[] StrArr => Str.Split(); bool eq<T, U>() => typeof(T).Equals(typeof(U)); T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T)); T cv<T>(string s) => eq<T, int>() ? ct<T, int>(int.Parse(s)) : eq<T, long>() ? ct<T, long>(long.Parse(s)) : eq<T, double>() ? ct<T, double>(double.Parse(s)) : eq<T, char>() ? ct<T, char>(s[0]) : ct<T, string>(s); public void Multi<T>(out T a) => a = cv<T>(Str); public void Multi<T, U>(out T a, out U b) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); } public void Multi<T, U, V>(out T a, out U b, out V c) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); } public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); } public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); } } class mymath { public static long Mod = 1000000007; public static bool isprime(long a) { if (a < 2) return false; for (long i = 2; i * i <= a; i++) if (a % i == 0) return false; return true; } public static bool[] sieve(int n) { var p = new bool[n + 1]; for (int i = 2; i <= n; i++) p[i] = true; for (int i = 2; i * i <= n; i++) if (p[i]) for (int j = i * i; j <= n; j += i) p[j] = false; return p; } public static List<int> getprimes(int n) { var prs = new List<int>(); var p = sieve(n); for (int i = 2; i <= n; i++) if (p[i]) prs.Add(i); return prs; } public static long[][] E(int n) { var ret = new long[n][]; for (int i = 0; i < n; i++) { ret[i] = new long[n]; ret[i][i] = 1; } return ret; } public static long[][] pow(long[][] A, long n) { if (n == 0) return E(A.Length); var t = pow(A, n / 2); if ((n & 1) == 0) return mul(t, t); return mul(mul(t, t), A); } public static double dot(double[] x, double[] y) { int n = x.Length; double ret = 0; for (int i = 0; i < n; i++) ret += x[i] * y[i]; return ret; } public static long dot(long[] x, long[] y) { int n = x.Length; long ret = 0; for (int i = 0; i < n; i++) ret = (ret + x[i] * y[i]) % Mod; return ret; } public static T[][] trans<T>(T[][] A) { int n = A[0].Length, m = A.Length; 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[j][i]; } return ret; } public static double[] mul(double[][] A, double[] x) { int n = A.Length; var ret = new double[n]; for (int i = 0; i < n; i++) ret[i] = dot(x, A[i]); return ret; } public static long[] mul(long[][] A, long[] x) { int n = A.Length; var ret = new long[n]; for (int i = 0; i < n; i++) ret[i] = dot(x, A[i]); return ret; } public static long[][] mul(long[][] A, long[][] B) { int n = A.Length; var Bt = trans(B); var ret = new long[n][]; for (int i = 0; i < n; i++) ret[i] = mul(Bt, A[i]); return ret; } public static long[] add(long[] x, long[] y) { int n = x.Length; var ret = new long[n]; for (int i = 0; i < n; i++) ret[i] = (x[i] + y[i]) % Mod; return ret; } public static long[][] add(long[][] A, long[][] B) { int n = A.Length; var ret = new long[n][]; for (int i = 0; i < n; i++) ret[i] = add(A[i], B[i]); return ret; } public static long pow(long a, long b) { if (a >= Mod) return pow(a % Mod, b); if (a == 0) return 0; if (b == 0) return 1; var t = pow(a, b / 2); if ((b & 1) == 0) return t * t % Mod; return t * t % Mod * a % Mod; } public static long inv(long a) => pow(a, Mod - 2); public static long gcd(long a, long b) { while (b > 0) { var t = a % b; a = b; b = t; } return a; } // a x + b y = gcd(a, b) public static long extgcd(long a, long b, out long x, out long y) { long g = a; x = 1; y = 0; if (b > 0) { g = extgcd(b, a % b, out y, out x); y -= a / b * x; } return g; } public static long lcm(long a, long b) => a / gcd(a, b) * b; public static long comb(int n, int r) { if (n < 0 || r < 0 || r > n) return 0; if (n - r < r) r = n - r; if (r == 0) return 1; if (r == 1) return n; int[] numer = new int[r], denom = new int[r]; for (int k = 0; k < r; k++) { numer[k] = n - r + k + 1; denom[k] = k + 1; } for (int p = 2; p <= r; p++) { int piv = denom[p - 1]; if (piv > 1) { int ofst = (n - r) % p; for (int k = p - 1; k < r; k += p) { numer[k - ofst] /= piv; denom[k] /= piv; } } } long ret = 1; for (int k = 0; k < r; k++) if (numer[k] > 1) ret = ret * numer[k] % Mod; return ret; } }