結果

問題 No.854 公平なりんご分配
ユーザー claw88claw88
提出日時 2019-07-26 22:34:49
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,420 ms / 3,153 ms
コード長 7,063 bytes
コンパイル時間 2,646 ms
コンパイル使用メモリ 106,836 KB
実行使用メモリ 270,596 KB
最終ジャッジ日時 2023-09-15 02:29:21
合計ジャッジ時間 22,503 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 64 ms
22,820 KB
testcase_01 AC 64 ms
20,720 KB
testcase_02 AC 66 ms
20,824 KB
testcase_03 AC 64 ms
22,836 KB
testcase_04 AC 64 ms
18,728 KB
testcase_05 AC 64 ms
20,860 KB
testcase_06 AC 64 ms
20,716 KB
testcase_07 AC 64 ms
20,796 KB
testcase_08 AC 64 ms
22,916 KB
testcase_09 AC 63 ms
20,760 KB
testcase_10 AC 64 ms
20,736 KB
testcase_11 AC 63 ms
22,800 KB
testcase_12 AC 63 ms
18,744 KB
testcase_13 AC 64 ms
22,824 KB
testcase_14 AC 63 ms
20,868 KB
testcase_15 AC 64 ms
20,664 KB
testcase_16 AC 64 ms
20,828 KB
testcase_17 AC 65 ms
22,900 KB
testcase_18 AC 65 ms
20,888 KB
testcase_19 AC 64 ms
22,828 KB
testcase_20 AC 64 ms
22,840 KB
testcase_21 AC 65 ms
20,968 KB
testcase_22 AC 74 ms
20,888 KB
testcase_23 AC 75 ms
21,800 KB
testcase_24 AC 78 ms
22,588 KB
testcase_25 AC 74 ms
21,380 KB
testcase_26 AC 76 ms
24,756 KB
testcase_27 AC 75 ms
24,776 KB
testcase_28 AC 75 ms
20,944 KB
testcase_29 AC 72 ms
23,036 KB
testcase_30 AC 74 ms
23,408 KB
testcase_31 AC 77 ms
24,412 KB
testcase_32 AC 141 ms
71,368 KB
testcase_33 AC 122 ms
51,740 KB
testcase_34 AC 178 ms
92,768 KB
testcase_35 AC 152 ms
77,736 KB
testcase_36 AC 101 ms
25,712 KB
testcase_37 AC 132 ms
70,240 KB
testcase_38 AC 119 ms
59,072 KB
testcase_39 AC 211 ms
100,276 KB
testcase_40 AC 123 ms
45,896 KB
testcase_41 AC 142 ms
66,704 KB
testcase_42 AC 169 ms
93,444 KB
testcase_43 AC 168 ms
71,488 KB
testcase_44 AC 185 ms
87,208 KB
testcase_45 AC 142 ms
37,060 KB
testcase_46 AC 200 ms
88,372 KB
testcase_47 AC 127 ms
59,348 KB
testcase_48 AC 166 ms
90,536 KB
testcase_49 AC 165 ms
92,024 KB
testcase_50 AC 130 ms
67,920 KB
testcase_51 AC 203 ms
93,788 KB
testcase_52 AC 154 ms
53,860 KB
testcase_53 AC 124 ms
50,788 KB
testcase_54 AC 156 ms
59,224 KB
testcase_55 AC 119 ms
48,788 KB
testcase_56 AC 111 ms
52,280 KB
testcase_57 AC 119 ms
46,508 KB
testcase_58 AC 136 ms
36,380 KB
testcase_59 AC 102 ms
43,356 KB
testcase_60 AC 130 ms
48,888 KB
testcase_61 AC 96 ms
26,704 KB
testcase_62 AC 134 ms
47,200 KB
testcase_63 AC 129 ms
44,304 KB
testcase_64 AC 91 ms
28,436 KB
testcase_65 AC 154 ms
82,992 KB
testcase_66 AC 113 ms
37,648 KB
testcase_67 AC 151 ms
63,836 KB
testcase_68 AC 135 ms
41,128 KB
testcase_69 AC 161 ms
95,208 KB
testcase_70 AC 108 ms
43,988 KB
testcase_71 AC 113 ms
48,224 KB
testcase_72 AC 112 ms
28,120 KB
testcase_73 AC 138 ms
71,016 KB
testcase_74 AC 179 ms
86,744 KB
testcase_75 AC 124 ms
48,424 KB
testcase_76 AC 159 ms
73,452 KB
testcase_77 AC 177 ms
95,140 KB
testcase_78 AC 147 ms
45,084 KB
testcase_79 AC 160 ms
67,224 KB
testcase_80 AC 158 ms
67,460 KB
testcase_81 AC 145 ms
66,700 KB
testcase_82 AC 475 ms
270,556 KB
testcase_83 AC 531 ms
268,664 KB
testcase_84 AC 1,420 ms
270,460 KB
testcase_85 AC 501 ms
268,812 KB
testcase_86 AC 449 ms
269,704 KB
testcase_87 AC 475 ms
268,612 KB
testcase_88 AC 477 ms
268,592 KB
testcase_89 AC 481 ms
270,596 KB
testcase_90 AC 480 ms
268,484 KB
testcase_91 AC 480 ms
270,532 KB
testcase_92 AC 533 ms
268,452 KB
testcase_93 AC 536 ms
268,536 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;
        //int N = 100000;
        //var A = new int[N];
        //for (int i = 0; i < N; i++)
        //{
        //    A[i] = i % (2001);
        //}

        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 (!M.ContainsKey(j))
                    {
                        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 (!M.ContainsKey(Z))
                {
                    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