結果

問題 No.854 公平なりんご分配
ユーザー claw88claw88
提出日時 2019-07-26 22:27:42
言語 C#(csc)
(csc 3.9.0)
結果
RE  
実行時間 -
コード長 6,894 bytes
コンパイル時間 3,825 ms
コンパイル使用メモリ 117,352 KB
実行使用メモリ 274,548 KB
最終ジャッジ日時 2024-07-02 07:52:27
合計ジャッジ時間 21,917 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
24,000 KB
testcase_01 AC 30 ms
22,072 KB
testcase_02 RE -
testcase_03 RE -
testcase_04 RE -
testcase_05 AC 30 ms
24,492 KB
testcase_06 AC 30 ms
24,004 KB
testcase_07 AC 30 ms
26,040 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 30 ms
26,044 KB
testcase_12 AC 31 ms
24,288 KB
testcase_13 AC 31 ms
24,200 KB
testcase_14 RE -
testcase_15 AC 30 ms
23,928 KB
testcase_16 AC 31 ms
24,084 KB
testcase_17 AC 31 ms
24,336 KB
testcase_18 AC 31 ms
24,244 KB
testcase_19 AC 31 ms
26,060 KB
testcase_20 AC 31 ms
24,260 KB
testcase_21 AC 31 ms
24,132 KB
testcase_22 RE -
testcase_23 AC 38 ms
25,132 KB
testcase_24 WA -
testcase_25 AC 37 ms
24,516 KB
testcase_26 AC 40 ms
27,952 KB
testcase_27 AC 40 ms
28,072 KB
testcase_28 RE -
testcase_29 AC 36 ms
24,324 KB
testcase_30 AC 38 ms
26,624 KB
testcase_31 WA -
testcase_32 AC 103 ms
74,568 KB
testcase_33 WA -
testcase_34 WA -
testcase_35 AC 130 ms
82,820 KB
testcase_36 RE -
testcase_37 AC 101 ms
71,308 KB
testcase_38 AC 86 ms
64,508 KB
testcase_39 WA -
testcase_40 RE -
testcase_41 AC 128 ms
71,952 KB
testcase_42 AC 155 ms
96,944 KB
testcase_43 RE -
testcase_44 WA -
testcase_45 RE -
testcase_46 RE -
testcase_47 AC 109 ms
60,580 KB
testcase_48 WA -
testcase_49 AC 139 ms
94,928 KB
testcase_50 AC 95 ms
73,024 KB
testcase_51 RE -
testcase_52 RE -
testcase_53 RE -
testcase_54 RE -
testcase_55 AC 89 ms
52,048 KB
testcase_56 AC 81 ms
55,516 KB
testcase_57 RE -
testcase_58 RE -
testcase_59 AC 74 ms
42,508 KB
testcase_60 RE -
testcase_61 RE -
testcase_62 RE -
testcase_63 RE -
testcase_64 RE -
testcase_65 AC 123 ms
86,156 KB
testcase_66 RE -
testcase_67 RE -
testcase_68 RE -
testcase_69 AC 121 ms
98,296 KB
testcase_70 AC 83 ms
45,056 KB
testcase_71 AC 91 ms
49,176 KB
testcase_72 RE -
testcase_73 AC 113 ms
74,016 KB
testcase_74 AC 190 ms
88,132 KB
testcase_75 RE -
testcase_76 RE -
testcase_77 AC 173 ms
96,708 KB
testcase_78 RE -
testcase_79 RE -
testcase_80 RE -
testcase_81 AC 142 ms
70,068 KB
testcase_82 AC 657 ms
274,192 KB
testcase_83 AC 703 ms
273,944 KB
testcase_84 AC 1,525 ms
272,020 KB
testcase_85 AC 672 ms
274,548 KB
testcase_86 AC 625 ms
273,376 KB
testcase_87 AC 643 ms
274,064 KB
testcase_88 AC 652 ms
274,200 KB
testcase_89 AC 641 ms
274,192 KB
testcase_90 AC 647 ms
272,164 KB
testcase_91 AC 648 ms
272,292 KB
testcase_92 AC 721 ms
272,016 KB
testcase_93 AC 715 ms
274,328 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

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 < iszero.Count && iszero[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 (flag && 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);
}
0