結果
問題 | No.669 対決!!! 飲み比べ |
ユーザー |
![]() |
提出日時 | 2018-03-23 23:20:53 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 1,715 bytes |
コンパイル時間 | 1,220 ms |
コンパイル使用メモリ | 117,968 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-25 02:05:06 |
合計ジャッジ時間 | 2,003 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 25 |
ソースコード
# include <iostream># include <algorithm>#include <array># include <cassert>#include <cctype>#include <climits>#include <numeric># include <vector># include <string># include <set># include <map># include <cmath># include <iomanip># include <functional># include <tuple># include <utility># include <stack># include <queue># include <list># include <bitset># include <complex># include <chrono># include <random># include <limits.h># include <unordered_map># include <unordered_set># include <deque># include <cstdio># include <cstring>using namespace std;using LL = long long;using ULL = unsigned long long;constexpr long long MOD = 1000000000 + 7;constexpr long long INF = std::numeric_limits<long long>::max();const double PI = acos(-1);#define fir first#define sec secondtypedef pair<LL, LL> Pll;typedef pair<LL, pair<LL, LL>> Ppll;typedef pair<LL, pair<LL, bitset<100001>>> Pbll;typedef pair<LL, pair<LL, vector<LL>>> Pvll;typedef pair<LL, LL> Vec2;struct Tll { LL first, second, third; };typedef pair<LL, Tll> Ptll;#define rep(i,rept) for(LL i=0;i<rept;i++)#define Mfor(i,mf) for(LL i=mf-1;i>=0;i--)LL h, w, n, m, k, s, t, q, ans,sum, last, cnt, a[10000], d[100000];struct Edge { LL to, cost; };string str;char c[1000][1000];bool f = 0;void YN(bool f) {if (f)cout << "YES" << endl;elsecout << "NO" << endl;}void yn(bool f) {if (f)cout << "Yes" << endl;elsecout << "No" << endl;}vector<Edge>vec[10000];int main() {cin >> n >> m;rep(i, n) {cin >> a[i];a[i] %= (m + 1);if (a[i] != 0)f = 1;sum ^= a[i];}while (sum > 0) {if (sum % 2 == 1)ans++;sum >>= 1;}YN(ans!=0);return 0;}//5 1//10 12 4 27//1,1