#362961 (C#(csc)) No.854 公平なりんご分配

提出ソース

結果

問題	No.854 公平なりんご分配
ユーザー	りあん
提出日時	2019-07-26 23:15:48
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	1,305 ms / 3,153 ms
コード長	14,432 bytes
コンパイル時間	1,105 ms
コンパイル使用メモリ	121,924 KB
実行使用メモリ	166,360 KB
最終ジャッジ日時	2024-07-02 09:32:07
合計ジャッジ時間	27,712 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	28 ms 25,392 KB
testcase_01	AC	29 ms 27,264 KB
testcase_02	AC	29 ms 25,092 KB
testcase_03	AC	29 ms 27,256 KB
testcase_04	AC	28 ms 23,220 KB
testcase_05	AC	30 ms 27,172 KB
testcase_06	AC	29 ms 25,348 KB
testcase_07	AC	29 ms 25,228 KB
testcase_08	AC	29 ms 25,348 KB
testcase_09	AC	29 ms 25,520 KB
testcase_10	AC	30 ms 25,092 KB
testcase_11	AC	30 ms 25,352 KB
testcase_12	AC	30 ms 25,096 KB
testcase_13	AC	28 ms 23,600 KB
testcase_14	AC	30 ms 25,128 KB
testcase_15	AC	30 ms 25,480 KB
testcase_16	AC	30 ms 25,480 KB
testcase_17	AC	31 ms 25,092 KB
testcase_18	AC	31 ms 25,260 KB
testcase_19	AC	30 ms 25,140 KB
testcase_20	AC	31 ms 23,220 KB
testcase_21	AC	30 ms 27,392 KB
testcase_22	AC	37 ms 25,612 KB
testcase_23	AC	38 ms 23,608 KB
testcase_24	AC	42 ms 27,656 KB
testcase_25	AC	38 ms 23,440 KB
testcase_26	AC	43 ms 25,732 KB
testcase_27	AC	42 ms 25,592 KB
testcase_28	AC	39 ms 25,476 KB
testcase_29	AC	38 ms 27,656 KB
testcase_30	AC	38 ms 25,836 KB
testcase_31	AC	43 ms 25,820 KB
testcase_32	AC	194 ms 60,284 KB
testcase_33	AC	167 ms 45,548 KB
testcase_34	AC	306 ms 70,904 KB
testcase_35	AC	233 ms 63,040 KB
testcase_36	AC	105 ms 29,140 KB
testcase_37	AC	190 ms 55,120 KB
testcase_38	AC	160 ms 52,132 KB
testcase_39	AC	410 ms 71,388 KB
testcase_40	AC	167 ms 44,956 KB
testcase_41	AC	226 ms 54,924 KB
testcase_42	AC	298 ms 68,140 KB
testcase_43	AC	271 ms 56,120 KB
testcase_44	AC	327 ms 65,124 KB
testcase_45	AC	206 ms 38,548 KB
testcase_46	AC	358 ms 64,744 KB
testcase_47	AC	171 ms 49,896 KB
testcase_48	AC	285 ms 69,416 KB
testcase_49	AC	276 ms 70,292 KB
testcase_50	AC	178 ms 52,800 KB
testcase_51	AC	365 ms 66,196 KB
testcase_52	AC	209 ms 48,264 KB
testcase_53	AC	154 ms 46,332 KB
testcase_54	AC	220 ms 49,492 KB
testcase_55	AC	134 ms 47,868 KB
testcase_56	AC	130 ms 46,216 KB
testcase_57	AC	152 ms 45,484 KB
testcase_58	AC	193 ms 36,940 KB
testcase_59	AC	106 ms 41,468 KB
testcase_60	AC	161 ms 41,256 KB
testcase_61	AC	80 ms 33,984 KB
testcase_62	AC	174 ms 41,328 KB
testcase_63	AC	144 ms 41,856 KB
testcase_64	AC	77 ms 33,332 KB
testcase_65	AC	234 ms 64,920 KB
testcase_66	AC	124 ms 38,088 KB
testcase_67	AC	209 ms 54,060 KB
testcase_68	AC	162 ms 40,668 KB
testcase_69	AC	269 ms 71,212 KB
testcase_70	AC	116 ms 44,064 KB
testcase_71	AC	122 ms 46,408 KB
testcase_72	AC	126 ms 31,548 KB
testcase_73	AC	187 ms 57,308 KB
testcase_74	AC	271 ms 63,508 KB
testcase_75	AC	151 ms 46,660 KB
testcase_76	AC	215 ms 57,900 KB
testcase_77	AC	267 ms 67,364 KB
testcase_78	AC	205 ms 44,036 KB
testcase_79	AC	227 ms 52,808 KB
testcase_80	AC	230 ms 56,412 KB
testcase_81	AC	198 ms 55,056 KB
testcase_82	AC	927 ms 164,204 KB
testcase_83	AC	1,215 ms 164,184 KB
testcase_84	AC	1,218 ms 166,108 KB
testcase_85	AC	1,259 ms 164,132 KB
testcase_86	AC	708 ms 164,128 KB
testcase_87	AC	931 ms 164,132 KB
testcase_88	AC	893 ms 164,216 KB
testcase_89	AC	887 ms 166,052 KB
testcase_90	AC	921 ms 166,332 KB
testcase_91	AC	887 ms 164,348 KB
testcase_92	AC	1,305 ms 166,360 KB
testcase_93	AC	1,278 ms 164,348 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.Collections.Generic;
using System.Linq;
using System.Linq.Expressions;
using System.IO;
using System.Text;
using System.Diagnostics;

using static util;
using P = pair<int, int>;

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();
    const int M = 1000000007;
    const int M2 = 998244353;
    const long LM = 1L << 60;
    const double eps = 1e-11;
    static void Main(string[] args)
    {
        int n = sc.Int;
        var a = sc.IntArr;
        var pr = MyMath.getprimes(2000);
        int m = pr.Count;
        var ims = new int[n + 1][];
        ims[0] = new int[m];
        var zims = new int[n + 1];
        for (int i = 0; i < n; i++)
        {
            ims[i + 1] = ims[i].copy();
            zims[i + 1] = zims[i];
            int p = a[i];
            if (p == 0) {
                ++zims[i + 1];
                continue;
            }
            for (int j = 0; j < m; j++)
            {
                while (p % pr[j] == 0) {
                    p /= pr[j];
                    ++ims[i + 1][j];
                }
            }
        }
        int q = sc.Int;
        for (int i = 0; i < q; i++)
        {
            int p, l, r;
            sc.Multi(out p, out l, out r);
            --l;
            if (zims[r] - zims[l] > 0) {
                Prt("Yes");
                continue;
            }
            for (int j = 0; j < m; j++)
            {
                int c = ims[r][j] - ims[l][j];
                while (p % pr[j] == 0) {
                    p /= pr[j];
                    --c;
                }
                if (c < 0) {
                    p = -1;
                    break;
                }
            }
            if (p != 1) {
                Prt("NO");
            }
            else {
                Prt("Yes");
            }
        }
        sw.Flush();
    }

    static void DBG(string a) => Console.WriteLine(a);
    static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    static void DBG(params object[] a) => DBG(string.Join(" ", a));
    static void Prt(string a) => sw.WriteLine(a);
    static void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    static void Prt(params object[] a) => Prt(string.Join(" ", a));
}
class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
    public static bool operator>(pair<T, U> a, pair<T, U> b) => a.CompareTo(b) > 0;
    public static bool operator<(pair<T, U> a, pair<T, U> b) => a.CompareTo(b) < 0;
    public static bool operator>=(pair<T, U> a, pair<T, U> b) => a.CompareTo(b) >= 0;
    public static bool operator<=(pair<T, U> a, pair<T, U> b) => a.CompareTo(b) <= 0;
}
static class util {
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static T sq<T>(T a) => Operator<T>.Multiply(a, a);
    public static T Max<T>(params T[] a) => a.Max();
    public static T Min<T>(params T[] a) => a.Min();
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    static readonly int[] dd = { 0, 1, 0, -1 };
    static readonly string dstring = "RDLU";
    public static P[] adjacents(this P p) => adjacents(p.v1, p.v2);
    public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static pair<P, char>[] adjacents_with_str(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new pair<P, char>(new P(i + dd[k], j + dd[k ^ 1]), dstring[k])).ToArray();
    public static pair<P, char>[] adjacents_with_str(int i, int j, int h, int w)
        => Enumerable.Range(0, dd.Length).Select(k => new pair<P, char>(new P(i + dd[k], j + dd[k ^ 1]), dstring[k])).Where(p => inside(p.v1.v1, p.v1.v2, h, w)).ToArray();
    public static P[] adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray();
    public static P[] adjacents(int i, int j, int h, int w)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).Where(p => inside(p.v1, p.v2, h, w)).ToArray();
    public static void Assert(bool cond) { if (!cond) throw new Exception(); }
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { 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 Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => sr.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    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(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    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]); }
}

static 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 bool[] segmentSieve(long l, long r) {
        int sqn = (int)Math.Sqrt(r + 9);
        var ps = getprimes(sqn);
        var sieve = new bool[r - l + 1];
        for (long i = l; i <= r; i++) sieve[i - l] = true;
        foreach (long p in ps)
        {
            if (p * p > r) break;
            for (long i = p >= l ? p * p : (l + p - 1) / p * p; i <= r; i += p) sieve[i - l] = false;
        }
        return sieve;
    }
    public static bool[] segmentSieve(long l, long r, List<int> ps) {
        var sieve = new bool[r - l + 1];
        for (long i = l; i <= r; i++) sieve[i - l] = true;
        foreach (long p in ps)
        {
            if (p * p > r) break;
            for (long i = p >= l ? p * p : (l + p - 1) / p * p; i <= r; i += p) sieve[i - l] = false;
        }
        return sieve;
    }
    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 pow(long a, long b, long mod) {
        a %= mod;
        // if (a == 0) return 0;
        if (b == 0) return 1;
        var t = pow(a, b / 2, mod);
        if ((b & 1) == 0) return t * t % mod;
        return t * t % mod * a % mod;
    }
    public static long pow(long a, long b) {
        a %= Mod;
        // 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;
    }

    // 中国剰余定理
    // リターン値を (r, m) とすると解は x ≡ r (mod. m)
    // 解なしの場合は (0, -1) をリターン
    public static pair<long, long> chineserem(IList<long> b, IList<long> m) {
        long r = 0, M = 1;
        for (int i = 0; i < b.Count; ++i) {
            long p, q;
            long d = extgcd(M, m[i], out p, out q); // p is inv of M/d (mod. m[i]/d)
            if ((b[i] - r) % d != 0) return new pair<long, long>(0, -1);
            long tmp = (b[i] - r) / d * p % (m[i]/d);
            r += M * tmp;
            M *= m[i]/d;
        }
        return new pair<long, long>((r % M + M) % M, M);
    }

    public static long lcm(long a, long b) => a / gcd(a, b) * b;

    static long[] facts, invs;
    public static void setfacts(int n) {
        facts = new long[n + 1];
        facts[0] = 1;
        for (int i = 1; i <= n; i++) facts[i] = facts[i - 1] * i % Mod;
        invs = new long[n + 1];
        invs[n] = inv(facts[n]);
        for (int i = n; i > 0 ; i--) invs[i - 1] = invs[i] * i % Mod;
    }
    public static long perm(long n, long r) {
        if (n < 0 || r < 0 || r > n) return 0;
        if (facts != null && facts.Length > n) return facts[n] * invs[n - r] % Mod;
        long numer = 1;
        for (long i = 0; i < r; i++) {
            numer = numer * ((n - i) % Mod) % Mod;
        }
        return numer;
    }
    public static long comb(long n, long r) {
        if (n < 0 || r < 0 || r > n) return 0;
        if (facts != null && facts.Length > n) return facts[n] * invs[r] % Mod * invs[n - r] % Mod;
        if (n - r < r) r = n - r;
        long numer = 1, denom = 1;
        for (long i = 0; i < r; i++) {
            numer = numer * ((n - i) % Mod) % Mod;
            denom = denom * ((i + 1) % Mod) % Mod;
        }
        return numer * inv(denom) % Mod;
    }
    public static long[][] getcombs(int n) {
        var ret = new long[n + 1][];
        for (int i = 0; i <= n; i++) {
            ret[i] = new long[i + 1];
            ret[i][0] = ret[i][i] = 1;
            for (int j = 1; j < i; j++) ret[i][j] = (ret[i - 1][j - 1] + ret[i - 1][j]) % Mod;
        }
        return ret;
    }
    // nC0, nC2, ..., nCn
    public static long[] getcomb(int n) {
        var ret = new long[n + 1];
        ret[0] = 1;
        for (int i = 0; i < n; i++) ret[i + 1] = ret[i] * (n - i) % Mod * inv(i + 1) % Mod;
        return ret;
    }
    public static bool nextPermutation<T>(IList<T> p) where T : struct, IComparable<T> {
        for (int i = p.Count - 2; i >= 0; --i) {
            if (p[i].CompareTo(p[i + 1]) < 0) {
                for (int j = p.Count - 1; ; --j) {
                    if (p[j].CompareTo(p[i]) > 0) {
                        p.swap(i, j);
                        for(++i, j = p.Count - 1; i < j; ++i, --j)
                            p.swap(i, j);

                        return true;
                    }
                }
            }
        }
        return false;
    }
    public static bool nextPermutation<T>(IList<T> p, Comparison<T> compare) where T : struct {
        for (int i = p.Count - 2; i >= 0; --i) {
            if (compare(p[i], p[i + 1]) < 0) {
                for (int j = p.Count - 1; ; --j) {
                    if (compare(p[j], p[i]) > 0) {
                        p.swap(i, j);
                        for (++i, j = p.Count - 1; i < j; ++i, --j)
                            p.swap(i, j);

                        return true;
                    }
                }
            }
        }
        return false;
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード