結果

問題 No.1036 Make One With GCD 2
ユーザー ひばちひばち
提出日時 2020-04-25 06:53:28
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,184 ms / 2,000 ms
コード長 7,895 bytes
コンパイル時間 8,025 ms
コンパイル使用メモリ 111,756 KB
実行使用メモリ 88,200 KB
最終ジャッジ日時 2023-10-14 19:43:03
合計ジャッジ時間 36,473 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 644 ms
81,644 KB
testcase_01 AC 606 ms
67,780 KB
testcase_02 AC 609 ms
81,000 KB
testcase_03 AC 208 ms
36,440 KB
testcase_04 AC 312 ms
44,492 KB
testcase_05 AC 66 ms
23,832 KB
testcase_06 AC 65 ms
21,928 KB
testcase_07 AC 282 ms
49,064 KB
testcase_08 AC 244 ms
38,812 KB
testcase_09 AC 826 ms
58,160 KB
testcase_10 AC 772 ms
61,584 KB
testcase_11 AC 853 ms
58,952 KB
testcase_12 AC 781 ms
61,896 KB
testcase_13 AC 1,175 ms
76,604 KB
testcase_14 AC 1,184 ms
81,172 KB
testcase_15 AC 1,116 ms
79,676 KB
testcase_16 AC 1,120 ms
82,208 KB
testcase_17 AC 1,150 ms
83,880 KB
testcase_18 AC 75 ms
22,200 KB
testcase_19 AC 76 ms
22,352 KB
testcase_20 AC 78 ms
24,356 KB
testcase_21 AC 77 ms
24,344 KB
testcase_22 AC 1,102 ms
79,188 KB
testcase_23 AC 829 ms
65,036 KB
testcase_24 AC 1,139 ms
75,132 KB
testcase_25 AC 1,051 ms
76,176 KB
testcase_26 AC 1,089 ms
80,212 KB
testcase_27 AC 66 ms
21,808 KB
testcase_28 AC 66 ms
23,912 KB
testcase_29 AC 65 ms
21,944 KB
testcase_30 AC 66 ms
21,876 KB
testcase_31 AC 73 ms
22,052 KB
testcase_32 AC 74 ms
24,108 KB
testcase_33 AC 66 ms
23,984 KB
testcase_34 AC 74 ms
22,276 KB
testcase_35 AC 66 ms
21,896 KB
testcase_36 AC 66 ms
23,864 KB
testcase_37 AC 66 ms
21,988 KB
testcase_38 AC 589 ms
88,200 KB
testcase_39 AC 652 ms
88,120 KB
testcase_40 AC 832 ms
64,956 KB
testcase_41 AC 1,178 ms
79,812 KB
testcase_42 AC 1,172 ms
86,008 KB
testcase_43 AC 1,053 ms
85,956 KB
testcase_44 AC 1,132 ms
85,984 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 System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        var N = sc.Int;
        var A = sc.ArrLong;
        var s = new AggregationQueue<long>(GCD);
        int idx = 0;
        var res = 0L;
        for (int i = 0; i < N; i++)
        {
            while (idx < N && s.All_Fold() != 1) { s.Push(A[idx++]); }
            if (s.All_Fold() == 1)
                res += N - idx + 1;
            s.Pop();
        }
        WriteLine(res);
        
    }
     #region GCD
    public static int LCM(int num1, int num2)
        => num1 / GCD(num1, num2) * num2;

    public static long LCM(long num1, long num2)
        => num1 / GCD(num1, num2) * num2;

    public static int GCD(int num1, int num2)
        => num1 < num2 ? GCD(num2, num1) :
           num2 > 0 ? GCD(num2, num1 % num2) : num1;

    public static long GCD(long num1, long num2)
        => num1 < num2 ? GCD(num2, num1) :
           num2 > 0 ? GCD(num2, num1 % num2) : num1;
    #endregion
}

class AggregationQueue<T>
{
    private Stack<Node> front, back;
    private Func<T, T, T> f;//Monoid
    private T id;
    public AggregationQueue(Func<T, T, T> f, T id = default(T))
    {
        this.f = f;
        this.id = id;
        front = new Stack<Node>();
        back = new Stack<Node>();
    }
    public int Count => front.Count + back.Count;
    public bool Any() => front.Count > 0 || back.Count > 0;
    public T All_Fold()
    {
        if (!front.Any() && !back.Any()) return id;
        if (!front.Any())
            return back.Peek().sum;
        if (!back.Any())
            return front.Peek().sum;
        return f(front.Peek().sum, back.Peek().sum);
    }
    public void Push(T v)
    {
        if (back.Any())
            back.Push(new Node(v, f(back.Peek().sum, v)));
        else back.Push(new Node(v, v));
    }
    public void Pop()
    {
        if (!front.Any())
        {
            front.Push(new Node(back.Peek().val, back.Pop().val));
            while (back.Any())
            {
                var s = f(back.Peek().val, front.Peek().sum);
                front.Push(new Node(back.Pop().val, s));
            }
        }
        front.Pop();
    }
    private struct Node
    {
        public T val, sum;
        public Node(T v, T s) { val = v; sum = s; }
    }
}
#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == 1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == -1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static int MaxElement<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A){ var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1);return v; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion
0