oj.uz

Submission #532831

# Submission time Handle Problem Language Result Execution time Memory
532831 2022-03-04T03:26:23 Z hhhhaura Football (info1cup20_football) C++14
100 / 100
 38 ms 2192 KB 
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define ceil(a, b) ((a + b - 1) / (b))
#define all(x) x.begin(), x.end()
#define int long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())
using namespace std;
#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)

#ifdef wiwihorz
#define print(a...) cerr<<"Line "<<__LINE__<<":",kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L)==R], ++L;}
void kout() { cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...);} 
#else
#define print(...) 0
#define vprint(...) 0
#endif

signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int t; cin >> t;
	string ans = "";
	while(t--) {
		int n, k, lg;
		cin >> n >> k;
		lg = 32 - __builtin_clz(k);
		vector<int> cnt(lg + 1, 0);
		rep(i, 1, n) {
			int x; cin >> x;
			rep(j, 0, lg) {
				int val = (1ll << j);
				cnt[j] += x / val;
			}
		}
		int yes = 0;
		rep(i, 0, lg) if((1ll << i) <= k){
			if(cnt[i] & 1) {
				yes = 1;
				break;
			}
		}
		ans += (yes ? "1" : "0");
	}
	cout << ans << "\n";
	return 0;
}

Compilation message

football.cpp:5: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    5 | #pragma loop-opt(on)
      | 
football.cpp:21:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   21 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L)==R], ++L;}
      |             ^~~~
football.cpp:21:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   21 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L)==R], ++L;}
      |                     ^~~~

Subtask #1
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 204 KB Output is correct
2 Correct 11 ms 1192 KB Output is correct
3 Correct 12 ms 1228 KB Output is correct
4 Correct 11 ms 1228 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 1 ms 204 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 332 KB Output is correct
2 Correct 7 ms 560 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 564 KB Output is correct
2 Correct 22 ms 1140 KB Output is correct
3 Correct 20 ms 1228 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 636 KB Output is correct
2 Correct 37 ms 2144 KB Output is correct
3 Correct 38 ms 2192 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 312 KB Output is correct
2 Correct 12 ms 1272 KB Output is correct
3 Correct 12 ms 1184 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 316 KB Output is correct
2 Correct 16 ms 1220 KB Output is correct
3 Correct 22 ms 1192 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 320 KB Output is correct
2 Correct 24 ms 1220 KB Output is correct