結果
| 問題 | No.854 公平なりんご分配 |
| ユーザー |
 claw88
|
| 提出日時 | 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 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 51 WA * 10 RE * 31 |
コンパイルメッセージ
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.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);}