結果

問題 No.1538 引きこもりさんは引き算が得意。
ユーザー KumaTachiRenKumaTachiRen
提出日時 2022-10-18 22:23:54
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 184 ms / 2,000 ms
コード長 7,618 bytes
コンパイル時間 14,723 ms
コンパイル使用メモリ 144,004 KB
実行使用メモリ 173,008 KB
最終ジャッジ日時 2023-09-11 14:26:06
合計ジャッジ時間 13,352 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
24,284 KB
testcase_01 AC 46 ms
24,524 KB
testcase_02 AC 46 ms
24,528 KB
testcase_03 AC 43 ms
24,284 KB
testcase_04 AC 46 ms
24,280 KB
testcase_05 AC 45 ms
24,284 KB
testcase_06 AC 45 ms
24,524 KB
testcase_07 AC 44 ms
24,432 KB
testcase_08 AC 46 ms
24,384 KB
testcase_09 AC 46 ms
24,348 KB
testcase_10 AC 44 ms
24,276 KB
testcase_11 AC 42 ms
26,220 KB
testcase_12 AC 45 ms
24,340 KB
testcase_13 AC 44 ms
24,252 KB
testcase_14 AC 46 ms
24,204 KB
testcase_15 AC 46 ms
24,504 KB
testcase_16 AC 46 ms
26,460 KB
testcase_17 AC 46 ms
26,460 KB
testcase_18 AC 42 ms
24,024 KB
testcase_19 AC 43 ms
26,096 KB
testcase_20 AC 42 ms
24,152 KB
testcase_21 AC 45 ms
24,344 KB
testcase_22 AC 45 ms
24,424 KB
testcase_23 AC 45 ms
24,468 KB
testcase_24 AC 45 ms
24,488 KB
testcase_25 AC 45 ms
24,348 KB
testcase_26 AC 46 ms
26,308 KB
testcase_27 AC 45 ms
24,352 KB
testcase_28 AC 46 ms
26,328 KB
testcase_29 AC 45 ms
24,244 KB
testcase_30 AC 46 ms
24,380 KB
testcase_31 AC 44 ms
24,420 KB
testcase_32 AC 46 ms
24,440 KB
testcase_33 AC 41 ms
24,272 KB
testcase_34 AC 45 ms
24,528 KB
testcase_35 AC 45 ms
24,516 KB
testcase_36 AC 42 ms
26,084 KB
testcase_37 AC 95 ms
29,320 KB
testcase_38 AC 98 ms
29,316 KB
testcase_39 AC 98 ms
31,212 KB
testcase_40 AC 100 ms
29,472 KB
testcase_41 AC 101 ms
31,300 KB
testcase_42 AC 100 ms
31,472 KB
testcase_43 AC 42 ms
24,068 KB
testcase_44 AC 96 ms
29,368 KB
testcase_45 AC 100 ms
29,500 KB
testcase_46 AC 74 ms
31,044 KB
testcase_47 AC 83 ms
31,608 KB
testcase_48 AC 179 ms
39,964 KB
testcase_49 AC 99 ms
31,356 KB
testcase_50 AC 43 ms
24,032 KB
testcase_51 AC 178 ms
40,108 KB
testcase_52 AC 180 ms
39,704 KB
testcase_53 AC 184 ms
39,976 KB
testcase_54 AC 181 ms
40,096 KB
testcase_55 AC 175 ms
39,960 KB
testcase_56 AC 181 ms
173,008 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  Determining projects to restore...
  Restored /home/judge/data/code/main.csproj (in 154 ms).
.NET 向け Microsoft (R) Build Engine バージョン 17.0.0-preview-21470-01+cb055d28f
Copyright (C) Microsoft Corporation.All rights reserved.

  プレビュー版の .NET を使用しています。https://aka.ms/dotnet-core-preview をご覧ください
  main -> /home/judge/data/code/bin/Release/net6.0/main.dll
  main -> /home/judge/data/code/bin/Release/net6.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;

using N = System.Int64;

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

public class Solver
{
    public void Solve()
    {
        int n = ri;
        long k = rl;
        var a = new long[n];
        for (int i = 0; i < n; i++) a[i] = rl;

        if (a.Contains(k))
        {
            Yn(true);
            return;
        }

        var pow3 = new int[n / 2 + 5];
        pow3[0] = 1;
        for (int i = 0; i < pow3.Length - 1; i++) pow3[i + 1] = pow3[i] * 3;
        var s00 = new SortedSet<long>();
        var s01 = new SortedSet<long>();
        var s10 = new SortedSet<long>();
        var s11 = new SortedSet<long>();
        for (int l = 0; l < pow3[n / 2]; l++)
        {
            int t = l;
            long x = 0;
            var cnt = new int[3];
            for (int i = 0; i < n / 2; i++)
            {
                switch (t % 3)
                {
                    case 0: x -= a[i]; break;
                    case 2: x += a[i]; break;
                }
                cnt[t % 3]++;
                t /= 3;
            }
            s00.Add(x);
            if (cnt[2] > 0) s01.Add(x);
            if (cnt[0] > 0) s10.Add(x);
            if (cnt[0] > 0 && cnt[2] > 0) s11.Add(x);
        }
        bool ans = false;
        for (int l = 0; l < pow3[n - n / 2]; l++)
        {
            int t = l;
            long x = 0;
            var cnt = new int[3];
            for (int i = n / 2; i < n; i++)
            {
                switch (t % 3)
                {
                    case 0: x -= a[i]; break;
                    case 2: x += a[i]; break;
                }
                cnt[t % 3]++;
                t /= 3;
            }
            if (cnt[0] == 0 && cnt[2] == 0) ans |= s11.Contains(k - x);
            if (cnt[0] == 0 && cnt[2] > 0) ans |= s10.Contains(k - x);
            if (cnt[0] > 0 && cnt[2] == 0) ans |= s01.Contains(k - x);
            if (cnt[0] > 0 && cnt[2] > 0) ans |= s00.Contains(k - x);
        }
        Yn(ans);
    }




    const long inf = (long)1 << 60;
    int ri { get { return (int)sc.Integer(); } }
    long rl { get { return sc.Integer(); } }
    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 WriteMax(params long[] x) => Console.Write(x.Max());
    void WriteMin(params long[] x) => Console.Write(x.Min());
    void Write<T>(T t) { Console.WriteLine(t.ToString()); }
    void WriteFlush<T>(T t) { Console.WriteLine(t.ToString()); Console.Out.Flush(); }
    void WriteError<T>(T 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(long x)
    {
        x = x - ((x >> 1) & 0x5555555555555555);
        x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333);
        x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f;
        x = x + (x >> 8);
        x = x + (x >> 16);
        x = x + (x >> 32);
        return (int)(x & 0x0000007f);
    }
    public static int Ctz(long x)
    {
        if (x == 0) return -1;
        return Popcount((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 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 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, S>(in T[] list, S val, Func<T, S, int> comp)
    {
        if (list.Length == 0) return -1;
        int l = 0, r = list.Length;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(list[x], val) < 0) l = x + 1;
            else r = x;
        }
        return l;
    }
    public static int LowerBound<T, S>(in List<T> list, S val, Func<T, S, int> comp)
    {
        if (list.Count == 0) return -1;
        int l = 0, r = list.Count;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(list[x], val) < 0) l = x + 1;
            else r = x;
        }
        return l;
    }
    public static int UpperBound<T, S>(in List<T> list, S val, Func<T, S, int> comp)
    {
        if (list.Count == 0) return 0;
        if (comp(list.Last(), val) < 0) return list.Count;
        int l = 0, r = list.Count;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(list[x], val) <= 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 double Double() { return double.Parse(Scan()); }
}
0