結果

問題 No.1233 割り切れない気持ち
ユーザー ひばちひばち
提出日時 2020-09-19 01:08:26
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 111 ms / 3,153 ms
コード長 6,386 bytes
コンパイル時間 3,926 ms
コンパイル使用メモリ 113,792 KB
実行使用メモリ 39,936 KB
最終ジャッジ日時 2024-06-22 23:03:11
合計ジャッジ時間 8,517 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
21,504 KB
testcase_01 AC 29 ms
21,632 KB
testcase_02 AC 32 ms
21,376 KB
testcase_03 AC 37 ms
21,760 KB
testcase_04 AC 36 ms
21,888 KB
testcase_05 AC 31 ms
21,632 KB
testcase_06 AC 32 ms
21,632 KB
testcase_07 AC 55 ms
25,728 KB
testcase_08 AC 67 ms
28,672 KB
testcase_09 AC 97 ms
38,144 KB
testcase_10 AC 103 ms
38,784 KB
testcase_11 AC 53 ms
25,472 KB
testcase_12 AC 108 ms
39,552 KB
testcase_13 AC 107 ms
39,552 KB
testcase_14 AC 110 ms
39,936 KB
testcase_15 AC 111 ms
39,680 KB
testcase_16 AC 109 ms
39,808 KB
testcase_17 AC 82 ms
36,224 KB
testcase_18 AC 104 ms
39,552 KB
testcase_19 AC 96 ms
39,936 KB
testcase_20 AC 82 ms
36,224 KB
testcase_21 AC 86 ms
37,504 KB
testcase_22 AC 86 ms
37,760 KB
testcase_23 AC 86 ms
37,632 KB
testcase_24 AC 85 ms
37,632 KB
testcase_25 AC 86 ms
37,760 KB
testcase_26 AC 86 ms
37,632 KB
testcase_27 AC 89 ms
38,656 KB
testcase_28 AC 88 ms
38,528 KB
testcase_29 AC 91 ms
38,400 KB
testcase_30 AC 88 ms
38,272 KB
testcase_31 AC 88 ms
38,528 KB
testcase_32 AC 87 ms
38,400 KB
testcase_33 AC 88 ms
38,528 KB
testcase_34 AC 88 ms
38,272 KB
testcase_35 AC 87 ms
38,528 KB
testcase_36 AC 91 ms
38,656 KB
testcase_37 AC 30 ms
21,760 KB
testcase_38 AC 82 ms
36,096 KB
testcase_39 AC 96 ms
37,888 KB
testcase_40 AC 94 ms
38,016 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.Threading;
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 SC = Scanner;

public partial class Solver
{
    public void Solve()
    {
        var N = sc.Int;
        var A = sc.ArrInt;
        var res = N * A.Aggregate(0L, (a, b) => a + b);
        var calc = Create(201010, () => -1L);
        var ct = new int[401010];
        for (int i = 0; i < N; i++)
        {
            ct[A[i]]++;
        }
        for (int k = 0; k < 400100; k++)
            ct[k + 1] += ct[k];
        for (int i = 0; i < N; i++)
        {
            if (calc[A[i]] != -1) { res -= calc[A[i]]; continue; }
            var now = 0;
            calc[A[i]] = 0;
            for (int j = A[i]; ; j += A[i])
            {
                calc[A[i]] += (long)(ct[j - 1] - now) * (j - A[i]);
                now = ct[j - 1];
                if (j >= 201010) break;
            }
            res -= calc[A[i]];
        }
        Console.WriteLine(res);
    }
}

#region Template
public partial class Solver
{
    public SC sc = new SC();
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var sol = new Solver();
        int testcase = 1;
        //testcase = sol.sc.Int;
        //var th = new Thread(sol.Solve, 1 << 26);th.Start();th.Join();
        while (testcase-- > 0)
            sol.Solve();
        Console.Out.Flush();
    }
}
public static class Template
{
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { 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) < 0) { 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 void Out<T>(this IList<T> A, out T a) => a = A[0];
    public static void Out<T>(this IList<T> A, out T a, out T b) { a = A[0]; b = A[1]; }
    public static void Out<T>(this IList<T> A, out T a, out T b, out T c) { A.Out(out a, out b); c = A[2]; }
    public static void Out<T>(this IList<T> A, out T a, out T b, out T c, out T d) { A.Out(out a, out b, out c); d = A[3]; }
    public static string Concat<T>(this IEnumerable<T> A, string sp) => string.Join(sp, A);
    public static char ToChar(this int s, char begin = '0') => (char)(s + begin);
    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 string ToStr<T>(this T[][] A) => A.Select(a => a.Concat(" ")).Concat("\n");
    public static int ArgMax<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 void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2, out v3, out v4, out v5, out v6); v7 = Next<T7>(); }
    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); }
}

#endregion
0