結果

問題 No.2198 Concon Substrings (COuNt-CONstruct Version)
ユーザー KumaTachiRenKumaTachiRen
提出日時 2023-01-20 22:11:18
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 46 ms / 2,000 ms
コード長 8,264 bytes
コンパイル時間 10,910 ms
コンパイル使用メモリ 170,488 KB
実行使用メモリ 185,304 KB
最終ジャッジ日時 2024-06-23 10:09:28
合計ジャッジ時間 20,682 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
23,040 KB
testcase_01 AC 41 ms
23,168 KB
testcase_02 AC 41 ms
23,296 KB
testcase_03 AC 41 ms
23,168 KB
testcase_04 AC 41 ms
23,168 KB
testcase_05 AC 41 ms
23,296 KB
testcase_06 AC 41 ms
23,424 KB
testcase_07 AC 40 ms
23,296 KB
testcase_08 AC 41 ms
23,168 KB
testcase_09 AC 42 ms
23,544 KB
testcase_10 AC 42 ms
23,680 KB
testcase_11 AC 42 ms
23,680 KB
testcase_12 AC 42 ms
23,808 KB
testcase_13 AC 42 ms
23,800 KB
testcase_14 AC 42 ms
23,928 KB
testcase_15 AC 44 ms
26,592 KB
testcase_16 AC 41 ms
23,296 KB
testcase_17 AC 42 ms
23,420 KB
testcase_18 AC 41 ms
23,168 KB
testcase_19 AC 42 ms
23,040 KB
testcase_20 AC 42 ms
23,168 KB
testcase_21 AC 42 ms
23,408 KB
testcase_22 AC 43 ms
23,168 KB
testcase_23 AC 42 ms
23,664 KB
testcase_24 AC 42 ms
23,808 KB
testcase_25 AC 42 ms
23,808 KB
testcase_26 AC 42 ms
23,680 KB
testcase_27 AC 45 ms
24,704 KB
testcase_28 AC 40 ms
23,168 KB
testcase_29 AC 41 ms
23,168 KB
testcase_30 AC 41 ms
23,040 KB
testcase_31 AC 41 ms
23,040 KB
testcase_32 AC 41 ms
23,168 KB
testcase_33 AC 42 ms
23,424 KB
testcase_34 AC 41 ms
23,412 KB
testcase_35 AC 40 ms
23,168 KB
testcase_36 AC 40 ms
23,292 KB
testcase_37 AC 41 ms
23,392 KB
testcase_38 AC 41 ms
23,416 KB
testcase_39 AC 41 ms
23,168 KB
testcase_40 AC 41 ms
23,040 KB
testcase_41 AC 41 ms
23,168 KB
testcase_42 AC 42 ms
25,436 KB
testcase_43 AC 41 ms
23,168 KB
testcase_44 AC 42 ms
23,296 KB
testcase_45 AC 42 ms
23,424 KB
testcase_46 AC 41 ms
23,296 KB
testcase_47 AC 42 ms
23,040 KB
testcase_48 AC 43 ms
23,680 KB
testcase_49 AC 42 ms
23,168 KB
testcase_50 AC 42 ms
23,296 KB
testcase_51 AC 42 ms
23,552 KB
testcase_52 AC 42 ms
23,672 KB
testcase_53 AC 42 ms
23,424 KB
testcase_54 AC 42 ms
23,808 KB
testcase_55 AC 42 ms
23,544 KB
testcase_56 AC 42 ms
23,552 KB
testcase_57 AC 42 ms
23,552 KB
testcase_58 AC 42 ms
23,232 KB
testcase_59 AC 42 ms
23,424 KB
testcase_60 AC 42 ms
23,424 KB
testcase_61 AC 42 ms
23,796 KB
testcase_62 AC 42 ms
23,552 KB
testcase_63 AC 42 ms
23,808 KB
testcase_64 AC 42 ms
23,552 KB
testcase_65 AC 42 ms
23,936 KB
testcase_66 AC 42 ms
23,424 KB
testcase_67 AC 43 ms
23,808 KB
testcase_68 AC 43 ms
23,804 KB
testcase_69 AC 44 ms
23,808 KB
testcase_70 AC 46 ms
24,576 KB
testcase_71 AC 45 ms
24,700 KB
testcase_72 AC 42 ms
23,808 KB
testcase_73 AC 42 ms
23,424 KB
testcase_74 AC 44 ms
23,936 KB
testcase_75 AC 44 ms
23,808 KB
testcase_76 AC 42 ms
23,424 KB
testcase_77 AC 42 ms
23,680 KB
testcase_78 AC 45 ms
24,704 KB
testcase_79 AC 43 ms
23,932 KB
testcase_80 AC 43 ms
23,808 KB
testcase_81 AC 43 ms
23,552 KB
testcase_82 AC 43 ms
23,552 KB
testcase_83 AC 43 ms
23,424 KB
testcase_84 AC 43 ms
23,808 KB
testcase_85 AC 42 ms
23,672 KB
testcase_86 AC 42 ms
23,680 KB
testcase_87 AC 44 ms
24,192 KB
testcase_88 AC 43 ms
23,664 KB
testcase_89 AC 44 ms
23,552 KB
testcase_90 AC 44 ms
24,064 KB
testcase_91 AC 45 ms
24,700 KB
testcase_92 AC 42 ms
23,808 KB
testcase_93 AC 42 ms
23,680 KB
testcase_94 AC 44 ms
23,748 KB
testcase_95 AC 43 ms
23,552 KB
testcase_96 AC 44 ms
23,928 KB
testcase_97 AC 43 ms
23,936 KB
testcase_98 AC 43 ms
23,680 KB
testcase_99 AC 43 ms
23,552 KB
testcase_100 AC 45 ms
24,704 KB
testcase_101 AC 43 ms
23,800 KB
testcase_102 AC 45 ms
24,956 KB
testcase_103 AC 42 ms
23,552 KB
testcase_104 AC 42 ms
23,552 KB
testcase_105 AC 44 ms
24,064 KB
testcase_106 AC 45 ms
24,576 KB
testcase_107 AC 45 ms
185,304 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (98 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff #

using System.Diagnostics;
using System;
using System.Linq;
using System.Numerics;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Text;
using static Functions;



static class Program
{
    static public void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}

public class Solver
{
    public Solver()
    {
        Solve();
    }

    void Solve()
    {
        long m = rl;
        if (m == 0)
        {
            Write("a");
            return;
        }
        if (m == 1)
        {
            Write("con");
            return;
        }
        long n = 0;
        while (n * n * n <= m) n++;
        n--;
        long k = (m - n * n * n) / (n * n);
        var ans = new List<char>();
        for (int i = 0; i < n; i++) ans.Add('c');
        for (int i = 0; i < n; i++) ans.Add('o');
        for (int i = 0; i < n - 2 + k; i++) ans.Add('n');
        long r = m % (n * n);

        long b = n - r / n;
        for (int i = 0; i < b - 1; i++) ans.Add('o');
        long a = r % n;
        for (int i = 0; i < a; i++) ans.Add('c');
        ans.Add('o');
        for (int i = 0; i < n - a; i++) ans.Add('c');
        for (int i = 0; i < n - b; i++) ans.Add('o');
        ans.Add('n');
        WriteJoin("", ans);
    }



    int[] dx = { 1, 0, -1, 0 }, dy = { 0, 1, 0, -1 };
    //int[] dx = { 1, 1, 0, -1, -1, -1, 0, 1 }, dy = { 0, 1, 1, 1, 0, -1, -1, -1 };
    bool Safe(int x, int y, int h, int w) => 0 <= x && x < h && 0 <= y && y < w;
    const long INF = 1L << 60;
    int ri { get { return (int)sc.Integer(); } }
    long rl { get { return sc.Integer(); } }
    ulong rul { get { return sc.UInteger(); } }
    double rd { get { return sc.Double(); } }
    string rs { get { return sc.Scan(); } }
    string rline { get { return sc.Line(); } }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());

    T[] RepArray<T>(T t, int count) => Enumerable.Repeat(t, count).ToArray();
    void WriteJoin<T>(string s, IEnumerable<T> t) { Console.WriteLine(string.Join(s, t)); }
    void WriteMat<T>(T[,] a)
    {
        int sz1 = a.GetLength(0);
        int sz2 = a.GetLength(1);
        for (int i = 0; i < sz1; i++)
        {
            var s = new List<string>();
            for (int j = 0; j < sz2; j++) s.Add(a[i, j].ToString());
            WriteJoin(" ", s);
        }
    }
    void WriteMax(params long[] x) => Console.WriteLine(x.Max());
    void WriteMin(params long[] x) => Console.WriteLine(x.Min());
    void Write(object t) => Console.WriteLine(t.ToString());
    void Write(string str, object arg1) => Console.WriteLine(str, arg1);
    void Write(string str, object arg1, object arg2) => Console.WriteLine(str, arg1, arg2);
    void Write(string str, object arg1, object arg2, object arg3) => Console.WriteLine(str, arg1, arg2, arg3);
    void Write(string str, params object[] arg) => Console.WriteLine(str, arg);
    void WriteFlush(object t) { Console.WriteLine(t.ToString()); Console.Out.Flush(); }
    void WriteError(object t) { Console.Error.WriteLine(t.ToString()); }
    void YN(bool t) { Console.WriteLine(t ? "YES" : "NO"); }
    void Yn(bool t) { Console.WriteLine(t ? "Yes" : "No"); }
    void yn(bool t) { Console.WriteLine(t ? "yes" : "no"); }
}

public static class Functions
{
    public static int Popcount(ulong x)
    {
        x = x - ((x >> 1) & 0x5555555555555555UL);
        x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL);
        x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0fUL;
        x = x + (x >> 8);
        x = x + (x >> 16);
        x = x + (x >> 32);
        return (int)(x & 0x0000007fUL);
    }
    public static int Ctz(long x)
    {
        if (x == 0) return -1;
        return Popcount((ulong)((x & -x) - 1));
    }
    public static int SafeMod(int x, int m)
    {
        int r = x % m;
        return r < 0 ? r + m : r;
    }
    public static long SafeMod(long x, long m)
    {
        long r = x % m;
        return r < 0 ? r + m : r;
    }
    public static int Sign(long x) => x == 0 ? 0 : (x < 0 ? -1 : 1);
    public static int DigitSum(long n, int d = 10) { long s = 0; while (n > 0) { s += n % d; n /= d; } return (int)s; }
    public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1;
    public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b;
    public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b);
    public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b);
    public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; }
    public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; }
    public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; }
    public static T Clamp<T>(T x, T l, T r) where T : IComparable<T> => x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r);
    public static T Clamp<T>(ref T x, T l, T r) where T : IComparable<T> => x = x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r);
    public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; }
    public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y; }
    public static int LowerBound<T>(in T[] arr, Func<T, int> comp, int l = -1, int r = -1)
    {
        if (arr.Length == 0) return -1;
        if (l == -1) l = 0;
        if (r == -1) r = arr.Length;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(arr[x]) < 0) l = x + 1;
            else r = x;
        }
        return l;
    }
    public static int LowerBound<T>(in List<T> list, Func<T, int> comp, int l = -1, int r = -1)
    {
        if (list.Count == 0) return -1;
        if (l == -1) l = 0;
        if (r == -1) r = list.Count;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(list[x]) < 0) l = x + 1;
            else r = x;
        }
        return l;
    }
    public static int UpperBound<T>(in List<T> list, Func<T, int> comp, int l = -1, int r = -1)
    {
        if (list.Count == 0) return 0;
        if (comp(list.Last()) < 0) return list.Count;
        if (l == -1) l = 0;
        if (r == -1) r = list.Count;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(list[x]) <= 0) l = x + 1;
            else r = x;
        }
        return l;
    }
}

public class StreamScanner
{
    public StreamScanner(Stream stream) { str = stream; }
    private readonly Stream str;
    private readonly byte[] buf = new byte[1024];
    private int len, ptr;
    public bool isEof = false;
    public bool IsEndOfStream { get { return isEof; } }
    private byte read()
    {
        if (isEof) throw new EndOfStreamException();
        if (ptr >= len)
        {
            ptr = 0;
            if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; }
        }
        return buf[ptr++];
    }
    public char Char()
    {
        byte b = 0;
        do b = read();
        while (b < 33 || 126 < b);
        return (char)b;
    }
    public string Line()
    {
        var sb = new StringBuilder();
        for (var b = Char(); b != 10 && !isEof; b = (char)read()) sb.Append(b);
        return sb.ToString();
    }
    public string Scan()
    {
        var sb = new StringBuilder();
        for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
        return sb.ToString();
    }
    public long Integer()
    {
        long ret = 0; byte b = 0; var ng = false;
        do b = read();
        while (b != '-' && (b < '0' || '9' < b));
        if (b == '-') { ng = true; b = read(); }
        for (; true; b = read())
        {
            if (b < '0' || '9' < b) return ng ? -ret : ret;
            else ret = ret * 10 + b - '0';
        }
    }
    public ulong UInteger()
    {
        ulong ret = 0; byte b = 0;
        do b = read();
        while (b < '0' || '9' < b);
        for (; true; b = read())
        {
            if (b < '0' || '9' < b) return ret;
            else ret = ret * 10 + b - '0';
        }
    }
    public double Double() { return double.Parse(Scan()); }
}
0