oj.uz

Submission #222462

# Submission time Handle Problem Language Result Execution time Memory
222462 2020-04-13T07:52:19 Z ryansee Football (info1cup20_football) C++14
100 / 100
 51 ms 1504 KB 
#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return (rng() % (y+1-x)) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

typedef long long ll; 
typedef long double ld;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
typedef pair<ll,ll>pi; typedef pair<ll,pi>spi; typedef pair<pi,pi>dpi;

#define LLINF ((long long)1e18)
#define INF int(1e9+1e6)
#define MAXN (300006)
ll t;
int main(){
	FAST
	cin>>t;
	while(t--){
		ll n,k;cin>>n>>k;
		vector<ll>A(n);
		FOR(i,0,n-1)cin>>A[i];
		ll sum=accumulate(all(A),0ll);
		while(sum%2==0&&k>1){
			k/=2;
			FOR(i,0,n-1)sum-=A[i]-A[i]/2, A[i]/=2;
		}
		if(k==1) {
			cout<<((sum&1)?"1":"0");
		}else{
			cout<<"1";
		}
	}
}

Subtask #1
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1248 KB Output is correct
2 Correct 18 ms 1504 KB Output is correct
3 Correct 18 ms 1504 KB Output is correct
4 Correct 18 ms 1504 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 384 KB Output is correct
2 Correct 13 ms 640 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 384 KB Output is correct
2 Correct 30 ms 488 KB Output is correct
3 Correct 29 ms 384 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 512 KB Output is correct
2 Correct 46 ms 384 KB Output is correct
3 Correct 48 ms 512 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1248 KB Output is correct
2 Correct 18 ms 1504 KB Output is correct
3 Correct 20 ms 1504 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1248 KB Output is correct
2 Correct 24 ms 1504 KB Output is correct
3 Correct 21 ms 1504 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1248 KB Output is correct
2 Correct 20 ms 1504 KB Output is correct