oj.uz

Submission #514696

# Submission time Handle Problem Language Result Execution time Memory
514696 2022-01-18T11:27:08 Z Theo830 Football (info1cup20_football) C++17
100 / 100
 43 ms 1984 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll t;
    cin>>t;
    while(t--){
        ll n,k;
        cin>>n>>k;
        ll sum = 0;
        ll arr[n];
        f(i,0,n){
            cin>>arr[i];
        }
        bool ok = 0;
        ll num = log2(k) + 1;
        f(j,0,num){
            ll sum = 0;
            f(i,0,n){
                sum += arr[i] % (1LL<<(j+1)) >= (1LL<<j);
            }
            ok |= sum % 2;
        }
        cout<<ok;
    }
}

Compilation message

football.cpp: In function 'int main()':
football.cpp:33:12: warning: unused variable 'sum' [-Wunused-variable]
   33 |         ll sum = 0;
      |            ^~~

Subtask #1
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 460 KB Output is correct
2 Correct 13 ms 460 KB Output is correct
3 Correct 13 ms 460 KB Output is correct
4 Correct 10 ms 460 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 312 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 204 KB Output is correct
2 Correct 7 ms 452 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 368 KB Output is correct
2 Correct 33 ms 988 KB Output is correct
3 Correct 26 ms 920 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 328 KB Output is correct
2 Correct 39 ms 1980 KB Output is correct
3 Correct 39 ms 1984 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 588 KB Output is correct
2 Correct 15 ms 1416 KB Output is correct
3 Correct 11 ms 1348 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 464 KB Output is correct
2 Correct 15 ms 1348 KB Output is correct
3 Correct 22 ms 1340 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 464 KB Output is correct
2 Correct 22 ms 1340 KB Output is correct