Submission #560543

#	Time	Username	Problem	Language	Result	Execution time	Memory
560543		slime	Football (info1cup20_football)	C++14	100 / 100	59 ms	5252 KiB

football

#include "bits/stdc++.h"
using namespace std;
#define int long long
#ifdef ONLINE_JUDGE
const int MAXN = 2e5 + 10;
#endif
#ifndef ONLINE_JUDGE
const int MAXN = 1029;
#endif
const int MOD = 1e9 + 7;
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { int x; cin >> x; return (ll)x; }
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
void precomp() { for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD); }
int fastlog(int x) {
  return (x == 0 ? -1 : 32 - __builtin_clz(x) - 1);
}
void gay(int i) { cout << "Case #" << i << ": "; }
int csb(int l, int r, int k) { // count number of [l, r] such that i & 2^k > 0
  if(l > r) return 0;
  if(l == 0) {
    int s = r / (1ll << (k+1)); // number of complete cycles
    int t = r % (1ll << (k+1));
    int ans = s * (1ll << k);
    ans += (t >= (1ll << k) ? t - (1ll << k) + 1 : 0);
    return ans;
  }
  else return csb(0, r, k) - csb(0, l - 1, k);
}
void recur(vector<int> a, int k) {
  int n = a.size();
  int s = 0;
  for(int x: a) s += x;
  if(s & 1) {
    cout << "1"; return;
  }
  if(k == 1) {
    cout << "0"; return;
  }
  k >>= 1;
  for(int i=0; i<a.size(); i++) a[i] >>= 1;
  recur(a, k);
}
void solve(int tc) {
  int n, k; cin >> n >> k;
  vector<int> a(n);
  for(int i=0; i<n; i++) {
    cin >> a[i];
  }
  recur(a, k);
}
int32_t main() {
  precomp();
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; cin >> t;
  for(int i=1; i<=t; i++) solve(i);
} 
// I don't know geometry.

Compilation message (stderr)

football.cpp: In function 'void recur(std::vector<long long int>, long long int)':
football.cpp:58:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for(int i=0; i<a.size(); i++) a[i] >>= 1;
      |                ~^~~~~~~~~
football.cpp:48:7: warning: unused variable 'n' [-Wunused-variable]
   48 |   int n = a.size();
      |       ^

• Subtask 1: 26 / 26
• Subtask 2: 8 / 8
• Subtask 3: 11 / 11
• Subtask 4: 8 / 8
• Subtask 5: 16 / 16
• Subtask 6: 16 / 16
• Subtask 7: 7 / 7
• Subtask 8: 8 / 8