제출 #1110582

#제출 시각아이디문제언어결과실행 시간메모리
1110582_callmelucianFootball (info1cup20_football)C++14
0 / 100
20 ms2112 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef pair<ll,ll> pl; typedef pair<int,int> pii; typedef tuple<int,int,int> tt; #define all(a) a.begin(), a.end() #define filter(a) a.erase(unique(all(a)), a.end()) const int mn = 1e5 + 5; int n, k, a[mn]; namespace onePile { bool solve() { return a[1] >= (k & -k); } bool check() { return n == 1; } }; bool solve() { cin >> n >> k; for (int i = 1; i <= n; i++) cin >> a[i]; if (onePile::check()) return onePile::solve(); return 1; } int main() { ios::sync_with_stdio(0); cin.tie(0); int TC; cin >> TC; while (TC--) cout << solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...