提出 #74169448

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
const ll mod = 998244353;

// #include <atcoder/all>
// using mint = atcoder::modint998244353;
// using namespace atcoder;

int main() {
    int n, k;
    cin >> n >> k;

    vector<int> a(n);
    for (int i=0; i<n; i++) cin >> a[i];
    
    ll take = 0, skip = 0;
    for (int i=0; i<n; i++) {
      if (take+a[i]<=k) take += a[i];
      else skip += a[i];
    }
    
    if (take==skip) cout << "Draw" << endl;
    else if (take<skip) cout << "Aoki" << endl;
    else cout << "Takahashi" << endl;
    
    return 0;
}

提出情報

提出日時
問題 B - 宝石の分配
ユーザ aonyx64
言語 C++23 (GCC 15.2.0)
得点 0
コード長 667 Byte
結果 WA
実行時間 54 ms
メモリ 4264 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 0 / 266
結果
AC × 3
AC × 47
WA × 27
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 1 ms 3632 KiB
in02.txt AC 1 ms 3596 KiB
in03.txt WA 1 ms 3724 KiB
in04.txt AC 1 ms 3568 KiB
in05.txt AC 1 ms 3620 KiB
in06.txt AC 1 ms 3616 KiB
in07.txt AC 18 ms 4104 KiB
in08.txt AC 54 ms 4052 KiB
in09.txt WA 2 ms 4052 KiB
in10.txt AC 1 ms 3552 KiB
in11.txt WA 2 ms 4216 KiB
in12.txt WA 2 ms 4092 KiB
in13.txt AC 50 ms 4212 KiB
in14.txt AC 50 ms 4212 KiB
in15.txt AC 18 ms 4176 KiB
in16.txt WA 2 ms 4056 KiB
in17.txt AC 1 ms 3568 KiB
in18.txt AC 1 ms 3620 KiB
in19.txt WA 2 ms 4052 KiB
in20.txt WA 2 ms 4212 KiB
in21.txt AC 2 ms 4212 KiB
in22.txt WA 2 ms 4216 KiB
in23.txt WA 2 ms 4264 KiB
in24.txt WA 2 ms 4052 KiB
in25.txt AC 35 ms 4052 KiB
in26.txt WA 1 ms 3612 KiB
in27.txt AC 1 ms 3724 KiB
in28.txt AC 1 ms 3552 KiB
in29.txt AC 1 ms 3556 KiB
in30.txt AC 1 ms 3632 KiB
in31.txt AC 1 ms 3552 KiB
in32.txt AC 1 ms 3716 KiB
in33.txt AC 1 ms 3596 KiB
in34.txt AC 1 ms 3568 KiB
in35.txt WA 2 ms 4016 KiB
in36.txt WA 2 ms 4216 KiB
in37.txt WA 1 ms 3716 KiB
in38.txt WA 1 ms 3612 KiB
in39.txt AC 1 ms 3560 KiB
in40.txt AC 1 ms 3556 KiB
in41.txt AC 1 ms 3620 KiB
in42.txt AC 1 ms 3456 KiB
in43.txt AC 54 ms 3976 KiB
in44.txt AC 54 ms 4264 KiB
in45.txt WA 1 ms 3724 KiB
in46.txt WA 2 ms 4092 KiB
in47.txt WA 2 ms 4180 KiB
in48.txt WA 2 ms 4052 KiB
in49.txt WA 2 ms 4052 KiB
in50.txt AC 1 ms 3548 KiB
in51.txt AC 1 ms 3556 KiB
in52.txt WA 1 ms 3548 KiB
in53.txt WA 2 ms 4092 KiB
in54.txt AC 1 ms 3584 KiB
in55.txt AC 1 ms 3552 KiB
in56.txt WA 2 ms 4052 KiB
in57.txt AC 18 ms 4052 KiB
in58.txt WA 2 ms 4092 KiB
in59.txt WA 1 ms 3548 KiB
in60.txt WA 1 ms 3628 KiB
in61.txt AC 1 ms 3620 KiB
in62.txt AC 1 ms 3548 KiB
in63.txt AC 1 ms 3632 KiB
in64.txt AC 1 ms 3628 KiB
in65.txt AC 1 ms 3716 KiB
in66.txt AC 1 ms 3724 KiB
in67.txt AC 1 ms 3568 KiB
in68.txt AC 1 ms 3568 KiB
in69.txt AC 1 ms 3556 KiB
in70.txt WA 2 ms 4100 KiB
in71.txt AC 2 ms 4052 KiB
sample01.txt AC 1 ms 3556 KiB
sample02.txt AC 1 ms 3788 KiB
sample03.txt AC 1 ms 3724 KiB