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

提出ソース

結果

問題	No.854 公平なりんご分配
ユーザー	claw88
提出日時	2019-07-26 22:20:10
言語	C#(csc) (csc 3.9.0)
結果	WA
実行時間	-
コード長	6,850 bytes
コンパイル時間	1,033 ms
コンパイル使用メモリ	112,672 KB
実行使用メモリ	272,264 KB
最終ジャッジ日時	2024-07-02 07:42:28
合計ジャッジ時間	15,096 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	29 ms 24,172 KB
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	AC	29 ms 24,036 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	WA	-
testcase_50	WA	-
testcase_51	WA	-
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	WA	-
testcase_63	WA	-
testcase_64	WA	-
testcase_65	WA	-
testcase_66	WA	-
testcase_67	WA	-
testcase_68	WA	-
testcase_69	WA	-
testcase_70	WA	-
testcase_71	WA	-
testcase_72	WA	-
testcase_73	WA	-
testcase_74	WA	-
testcase_75	WA	-
testcase_76	WA	-
testcase_77	WA	-
testcase_78	WA	-
testcase_79	WA	-
testcase_80	WA	-
testcase_81	WA	-
testcase_82	AC	434 ms 267,916 KB
testcase_83	AC	427 ms 272,160 KB
testcase_84	AC	426 ms 272,264 KB
testcase_85	AC	419 ms 270,316 KB
testcase_86	AC	401 ms 269,532 KB
testcase_87	AC	441 ms 268,044 KB
testcase_88	AC	436 ms 269,964 KB
testcase_89	AC	430 ms 270,088 KB
testcase_90	AC	427 ms 270,092 KB
testcase_91	AC	427 ms 272,144 KB
testcase_92	WA	-
testcase_93	WA	-

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

コンパイルメッセージ

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.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        eratos(2000);
        var M = new Dictionary<int, int>();
        int W = 0;
        foreach (var item in prime)
        {
            M[item] = W++;
        }

        int N = cin.nextint;
        var A = cin.scanint;

        var iszero = new List<int>();
        for (int i = 0; i < N; i++)
        {
            if (A[i] == 0)
            {
                iszero.Add(i + 1);
            }
        }


        var cumsum = new long[N + 1, W];
        for (int i = 0; i < N; i++)
        {
            for (int j = 0; j < W; j++)
            {
                cumsum[i + 1, j] = cumsum[i, j];
            }
            int Z = A[i];
            for (int j = 2; j * j <= Z; j++)
            {
                int cnt = 0;
                while (Z % j == 0)
                {
                    Z /= j;
                    cnt++;
                }
                if (cnt > 0)
                {
                    cumsum[i + 1, M[j]] += cnt;
                }              
            }
            if (Z > 1)
            {
                cumsum[i + 1, M[Z]]++;
            }
        }


        int Q = cin.nextint;
        for (int i = 0; i < Q; i++)
        {
            int P = cin.nextint;
            int L = cin.nextint;
            int R = cin.nextint;
            int idxzero = iszero.lower_bound(L);
            if (idxzero <= R)
            {
                WriteLine("Yes");
                continue;
            }

            int Z = P;
            bool flag = true;

            for (int j = 2; j * j <= Z; j++)
            {
                int cnt = 0;
                while (Z % j == 0)
                {
                    Z /= j;
                    cnt++;
                }
                if (cnt > 0)
                {
                    if (j > 2000)
                    {
                        flag = false;
                        break;
                    }
                    int id = M[j];
                    long have = cumsum[R, id] - cumsum[L - 1, id];
                    if (have < cnt)
                    {
                        flag = false;
                        break;
                    }
                }
            }
            if (Z > 1)
            {
                if (Z > 2000)
                {
                    flag = false;
                }
                else
                {
                    cumsum[i + 1, M[Z]]++;
                    int id = M[Z];
                    long have = cumsum[R, id] - cumsum[L - 1, id];
                    if (have < 1)
                    {
                        flag = false;
                    }
                }
            }
            if (flag)
            {
                WriteLine("Yes");
            }
            else
            {
                WriteLine("NO");
            }
        }


    }

    List<int> prime;
    bool[] is_prime;
    void eratos(int n)
    {
        prime = new List<int>();
        is_prime = new bool[n + 1];
        for (int i = 0; i <= n; i++) is_prime[i] = true;
        is_prime[0] = is_prime[1] = false;
        for (int i = 0; i <= n; i++)
        {
            if (is_prime[i])
            {
                prime.Add(i);
                for (int j = 2 * i; j <= n; j += i) is_prime[j] = false;
            }
        }
    }
    int[] P;
    void phi(int n)
    {
        P = new int[n + 1];
        for (int i = 0; i <= n; i++) P[i] = i;
        for (int i = 2; i <= n; i++)
        {
            if (is_prime[i])
            {
                P[i] -= P[i] / i;
                for (int j = 2 * i; j <= n; j += i) P[j] -= P[j] / i;
            }
        }
    }
}

static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード