結果

問題 No.2247 01 ZigZag
ユーザー KumaTachiRenKumaTachiRen
提出日時 2023-03-17 21:57:40
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 50 ms / 2,000 ms
コード長 10,159 bytes
コンパイル時間 16,171 ms
コンパイル使用メモリ 166,604 KB
実行使用メモリ 190,052 KB
最終ジャッジ日時 2024-09-18 16:09:13
合計ジャッジ時間 15,209 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
23,552 KB
testcase_01 AC 46 ms
28,672 KB
testcase_02 AC 46 ms
28,672 KB
testcase_03 AC 46 ms
25,344 KB
testcase_04 AC 46 ms
28,416 KB
testcase_05 AC 46 ms
26,240 KB
testcase_06 AC 45 ms
25,216 KB
testcase_07 AC 46 ms
28,544 KB
testcase_08 AC 47 ms
26,496 KB
testcase_09 AC 45 ms
25,472 KB
testcase_10 AC 45 ms
28,800 KB
testcase_11 AC 44 ms
25,472 KB
testcase_12 AC 45 ms
25,984 KB
testcase_13 AC 44 ms
25,344 KB
testcase_14 AC 45 ms
28,800 KB
testcase_15 AC 46 ms
26,112 KB
testcase_16 AC 47 ms
26,368 KB
testcase_17 AC 46 ms
26,240 KB
testcase_18 AC 45 ms
28,788 KB
testcase_19 AC 45 ms
28,800 KB
testcase_20 AC 45 ms
28,672 KB
testcase_21 AC 44 ms
24,832 KB
testcase_22 AC 48 ms
26,624 KB
testcase_23 AC 45 ms
25,088 KB
testcase_24 AC 46 ms
28,544 KB
testcase_25 AC 46 ms
26,496 KB
testcase_26 AC 47 ms
26,096 KB
testcase_27 AC 47 ms
26,112 KB
testcase_28 AC 47 ms
26,364 KB
testcase_29 AC 45 ms
25,600 KB
testcase_30 AC 47 ms
26,496 KB
testcase_31 AC 45 ms
28,544 KB
testcase_32 AC 46 ms
26,496 KB
testcase_33 AC 45 ms
25,344 KB
testcase_34 AC 47 ms
26,240 KB
testcase_35 AC 45 ms
25,600 KB
testcase_36 AC 47 ms
25,600 KB
testcase_37 AC 43 ms
24,808 KB
testcase_38 AC 43 ms
24,704 KB
testcase_39 AC 44 ms
24,832 KB
testcase_40 AC 46 ms
28,800 KB
testcase_41 AC 46 ms
26,240 KB
testcase_42 AC 46 ms
26,496 KB
testcase_43 AC 46 ms
28,544 KB
testcase_44 AC 45 ms
28,648 KB
testcase_45 AC 50 ms
27,776 KB
testcase_46 AC 49 ms
28,032 KB
testcase_47 AC 41 ms
23,296 KB
testcase_48 AC 40 ms
23,424 KB
testcase_49 AC 45 ms
28,416 KB
testcase_50 AC 45 ms
28,672 KB
testcase_51 AC 45 ms
190,052 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (97 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;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Diagnostics.Contracts;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
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()
    {
        int n = ri, m = ri, k = ri;
        if ((n == 0 || m == 0) && k > 0)
        {
            Write(-1);
            return;
        }
        if (n > 0 && m > 0 && k == 0)
        {
            Write(-1);
            return;
        }
        if (k > (n == m ? n * 2 - 1 : Math.Min(n, m) * 2))
        {
            Write(-1);
            return;
        }
        var ans = new List<string>();
        if (k == 0)
        {
            for (int i = 0; i < n; i++) ans.Add("0");
            for (int i = 0; i < m; i++) ans.Add("1");
        }
        else if (k % 2 == 0)
        {
            if (n - k / 2 == 0)
            {
                for (int i = 0; i < k / 2; i++) ans.Add("10");
                for (int i = 0; i < m - k / 2; i++) ans.Add("1");
            }
            else
            {
                if (n - k / 2 < 0) { Write(-1); return; }
                if (k / 2 - 1 < 0) { Write(-1); return; }
                if (m - (k / 2 - 1) < 0) { Write(-1); return; }
                for (int i = 0; i < n - k / 2; i++) ans.Add("0");
                for (int i = 0; i < k / 2 - 1; i++) ans.Add("10");
                for (int i = 0; i < m - (k / 2 - 1); i++) ans.Add("1");
                ans.Add("0");
            }
        }
        else
        {
            if (n - k / 2 < 0) { Write(-1); return; }
            if (k / 2 < 0) { Write(-1); return; }
            if (m - k / 2 < 0) { Write(-1); return; }
            for (int i = 0; i < n - k / 2; i++) ans.Add("0");
            for (int i = 0; i < k / 2; i++) ans.Add("10");
            for (int i = 0; i < m - k / 2; i++) ans.Add("1");
        }
        WriteJoin("", ans);
    }

    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());

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    T[] RepArray<T>(T t, int count) => Enumerable.Repeat(t, count).ToArray();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteJoin<T>(string s, IEnumerable<T> t) => Console.WriteLine(string.Join(s, t));
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    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);
        }
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(object t) => Console.WriteLine(t.ToString());
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str) => Console.WriteLine(str);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, object arg1) => Console.WriteLine(str, arg1);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, object arg1, object arg2) => Console.WriteLine(str, arg1, arg2);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, object arg1, object arg2, object arg3) => Console.WriteLine(str, arg1, arg2, arg3);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, params object[] arg) => Console.WriteLine(str, arg);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteFlush(object t)
    { Console.WriteLine(t.ToString()); Console.Out.Flush(); }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteError(object t) => Console.Error.WriteLine(t.ToString());
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void YN(bool t) => Console.WriteLine(t ? "YES" : "NO");
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Yn(bool t) => Console.WriteLine(t ? "Yes" : "No");
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void yn(bool t) => Console.WriteLine(t ? "yes" : "no");
}

public static class Functions
{
    public static int Popcount(ulong x)
    {
        x = (x & 0x5555555555555555UL) + ((x >> 1) & 0x5555555555555555UL);
        x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL);
        x = (x & 0x0f0f0f0f0f0f0f0fUL) + ((x >> 4) & 0x0f0f0f0f0f0f0f0fUL);
        x = (x & 0x00ff00ff00ff00ffUL) + ((x >> 8) & 0x00ff00ff00ff00ffUL);
        x = (x & 0x0000ffff0000ffffUL) + ((x >> 16) & 0x0000ffff0000ffffUL);
        x = (x & 0x00000000ffffffffUL) + ((x >> 32) & 0x00000000ffffffffUL);
        return (int)x;
    }
    public static int Popcount(int x)
    {
        x = (x & 0x55555555) + ((x >> 1) & 0x55555555);
        x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
        x = (x & 0x0f0f0f0f) + ((x >> 4) & 0x0f0f0f0f);
        x = (x & 0x00ff00ff) + ((x >> 8) & 0x00ff00ff);
        x = (x & 0x0000ffff) + ((x >> 16) & 0x0000ffff);
        return x;
    }
    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;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int Sign(long x) => x == 0 ? 0 : (x < 0 ? -1 : 1);
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int DigitSum(long n, int d = 10) { long s = 0; while (n > 0) { s += n % d; n /= d; } return (int)s; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1;
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b;
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b);
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b);
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] 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);
    [MethodImpl(MethodImplOptions.AggressiveInlining)] 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);
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] 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>(T[] arr, Func<T, int> comp, int l = -1, int r = -1) => LowerBound<T>(arr.AsSpan<T>(), comp, l, r);
    public static int LowerBound<T>(Span<T> data, Func<T, int> comp, int l = -1, int r = -1)
    {
        if (data.Length == 0) return -1;
        if (l == -1) l = 0;
        if (r == -1) r = data.Length;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(data[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