#958841 (C++23) No.2666 Decreasing Modulo Nim

• 問題: No.2666 Decreasing Modulo Nim
• ユーザー: k1suxu
• 提出日時: 2024-03-08 23:15:40
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 25 ms / 2,000 ms
• コード長: 1,728 bytes
• コンパイル時間: 2,830 ms
• コンパイル使用メモリ: 246,860 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-09-29 20:39:36
• 合計ジャッジ時間: 4,965 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

ファイルパターン	結果
other	AC * 55

ソースコード

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
// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>
template<typename T>
bool chmax(T &a, const T b) {if(a<b) {a=b; return true;} else {return false;}}
template<typename T>
bool chmin(T &a, const T b) {if(a>b) {a=b; return true;} else {return false;}}
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
#define int long long
void solve() {
    int n, m;
    cin >> n >> m;
    vi a(n);
    FOR(n) cin >> a[i];
    int XOR = 0, cnt1 = 0, XOR2 = 0;
    bool flag = false;
    FOR(n) {
        if(a[i] >= m) {
            XOR ^= a[i]/m;
            flag = true;
        }
        cnt1 += a[i]%m;
        XOR2 ^= (a[i]%m)/2;
    }
    if(flag && XOR != 0) {
        cout << "Alice" << endl;
    }else if(cnt1%2 == 1) {
        cout << "Alice" << endl;
    }else if(XOR2 != 0) {
        cout << "Alice" << endl;
    }else {
        cout << "Bob" << endl;
    }
    // 余りの合計が奇数だったら勝てる
    // 
}
signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX