Submission #387603

#TimeUsernameProblemLanguageResultExecution timeMemory
3876038e7Football (info1cup20_football)C++14
50 / 100
36 ms372 KiB
//Challenge: Accepted #include <iostream> #include <algorithm> #include <vector> #include <utility> #define ll long long #define maxn 100005 #define pii pair<int, int> #define ff first #define ss second #define io ios_base::sync_with_stdio(0);cin.tie(0); using namespace std; //#include <bits/extc++.h> //using namespace __gnu_pbds; //template<class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //find by order, order of key int main() { io int t; cin >> t; while (t--) { int n, k; cin >> n >> k; ll sum = 0, ma = 0; for (int i = 0;i < n;i++) { int x; cin >> x; sum += x; ma = max(ma, (ll)x); } ll lb = sum & (-sum); if (lb <= k && lb <= ma) { cout << 1; } else { cout << 0; } } } /* 3 3 1 3 1 1 5 2 2 1 1 1 1 1 2 3 */
#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...