#1043286 (C#) No.3023 Utility is Max?

• 問題: No.3023 Utility is Max?
• ユーザー: tobisatis
• 提出日時: 2025-02-15 00:26:13
• 言語: C# (.NET 8.0.404)
• 結果: WA
• 実行時間: -
• コード長: 2,775 bytes
• コンパイル時間: 8,560 ms
• コンパイル使用メモリ: 171,644 KB
• 実行使用メモリ: 189,860 KB
• 最終ジャッジ日時: 2025-02-15 00:26:28
• 合計ジャッジ時間: 14,693 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
sample	AC * 2
other	AC * 1 WA * 16

コンパイルメッセージ

  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (117 ミリ秒)。
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
#nullable enable
using System.Numerics;
object? Solve()
{
    var q = Int();
    var ans = new string[q];
    bool S()
    {
        var res = true;
        var budget = Int();
        var az = new long[2];
        var bz = new long[2];
        var xz = new long[2];
        var yz = new long[2];
        for (var i = 0; i < 2; i++)
        {
            long a = Int();
            long b = Int();
            long x = Int();
            long y = Int();
            var cost = a * x + b * y;
            if (cost != budget) res = false;
            az[i] = a;
            bz[i] = b;
            xz[i] = x;
            yz[i] = y;
        }
        if (!res) return false;
        res = false;
        for (var i = 0; i < 2; i++)
        {
            var j = i ^ 1;
            var costif = az[i] * xz[j] + bz[i] * yz[j];
            res |= costif > budget;
        }
        return res;
    }
    for (var i = 0; i < q; i++) ans[i] = S() ? "Yes" : "No";
    Out(ans);
    return null;
}
#region
AtCoderIO _io_;
var _backend_ = new StandardIOBackend();
_io_ = new(){ Backend = _backend_ };
Out(Solve());
_backend_.Flush();
string String() => _io_.Next();
int Int() => int.Parse(String());
void Out(object? x, string? sep = null) => _io_.Out(x, sep ?? Environment.NewLine);
class AtCoderIO
{
    public required StandardIOBackend Backend { get; init; }
    Memory<string> _input = Array.Empty<string>();
    int _iter = 0;
    public string Next()
    {
        while (_iter >= _input.Length) (_input, _iter) = (Backend.ReadLine().Trim().Split(' '), 0);
        return _input.Span[_iter++];
    }
    public void Out(object? x, string separator)
    {
        if (x == null) return;
        if (x is System.Collections.IEnumerable a and not string)
        {
            var objects = a.Cast<object>();
            if (!objects.Any()) return;
            x = string.Join(separator, objects);
        }
        Backend.WriteLine(x);
    }
}
class StandardIOBackend
{
    readonly StreamReader _sr = new(Console.OpenStandardInput());
    readonly StreamWriter _sw = new(Console.OpenStandardOutput()) { AutoFlush = false };
    public string ReadLine() => _sr.ReadLine()!;
    public void WriteLine(object? value) => _sw.WriteLine(value);
    public void Flush() => _sw.Flush();
}
#endregion
static class Extensions
{
    public static T[] Repeat<T>(this int time, Func<T> F) => Enumerable.Range(0, time).Select(_ => F()).ToArray();
    public static (long d, long x, long y) ExtendedGCD(long a, long b)
    {
        var (x0, y0, x1, y1) = (1L, 0L, 0L, 1L);
        while (b != 0)
        {
            var q = a / b;
            (a, b) = (b, a - q * b);
            (x0, y0, x1, y1) = (x1, y1, x0 - q * x1, y0 - q * y1);
        }
        return (a, x0, y0);
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX