#include "Annalib.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=210, LOG=60;
bool bad[MAXN];
void Anna(int n, ll x, int k, int P[]){
for (int i=0; i<n; i++) bad[i]=0;
for (int i=0; i<k; i++) bad[P[i]]=1;
for (int i=0; i<n; i+=2){
if (bad[i] || bad[i+1]){
Set(i, 0);
Set(i+1, 0);
}
else{
Set(i, 1);
Set(i+1, x&1ll);
// debug(x)
x>>=1;
}
}
assert(!x || k>15);
return ;
}
#include "Brunolib.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=210, LOG=60;
ll Bruno(int n, int A[]){
int pos=0;
ll res=0;
for (int i=0; i<n; i+=2){
if (!A[i]) continue ;
if (A[i+1]) res|=(1ll<<pos);
pos++;
}
return res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
38 ms |
2316 KB |
Output is partially correct - L* = 15 |
2 |
Partially correct |
40 ms |
2264 KB |
Output is partially correct - L* = 15 |
3 |
Partially correct |
38 ms |
2384 KB |
Output is partially correct - L* = 16 |
4 |
Partially correct |
52 ms |
2248 KB |
Output is partially correct - L* = 15 |
5 |
Partially correct |
45 ms |
2248 KB |
Output is partially correct - L* = 15 |
6 |
Partially correct |
40 ms |
2336 KB |
Output is partially correct - L* = 15 |
7 |
Partially correct |
39 ms |
2248 KB |
Output is partially correct - L* = 15 |
8 |
Partially correct |
40 ms |
2208 KB |
Output is partially correct - L* = 15 |
9 |
Partially correct |
41 ms |
2260 KB |
Output is partially correct - L* = 16 |
10 |
Partially correct |
44 ms |
2220 KB |
Output is partially correct - L* = 16 |
11 |
Partially correct |
38 ms |
2180 KB |
Output is partially correct - L* = 15 |
12 |
Partially correct |
40 ms |
2232 KB |
Output is partially correct - L* = 16 |
13 |
Partially correct |
38 ms |
2276 KB |
Output is partially correct - L* = 15 |
14 |
Partially correct |
38 ms |
2232 KB |
Output is partially correct - L* = 15 |
15 |
Partially correct |
38 ms |
2236 KB |
Output is partially correct - L* = 15 |
16 |
Partially correct |
45 ms |
2228 KB |
Output is partially correct - L* = 15 |
17 |
Partially correct |
38 ms |
2268 KB |
Output is partially correct - L* = 15 |
18 |
Partially correct |
38 ms |
2208 KB |
Output is partially correct - L* = 15 |
19 |
Partially correct |
38 ms |
2208 KB |
Output is partially correct - L* = 16 |
20 |
Partially correct |
39 ms |
2196 KB |
Output is partially correct - L* = 15 |
21 |
Partially correct |
38 ms |
2160 KB |
Output is partially correct - L* = 15 |
22 |
Partially correct |
38 ms |
2312 KB |
Output is partially correct - L* = 15 |
23 |
Partially correct |
38 ms |
2184 KB |
Output is partially correct - L* = 15 |
24 |
Partially correct |
40 ms |
2224 KB |
Output is partially correct - L* = 15 |
25 |
Partially correct |
38 ms |
2292 KB |
Output is partially correct - L* = 15 |
26 |
Partially correct |
39 ms |
2292 KB |
Output is partially correct - L* = 15 |
27 |
Partially correct |
37 ms |
2344 KB |
Output is partially correct - L* = 15 |
28 |
Partially correct |
38 ms |
2472 KB |
Output is partially correct - L* = 15 |
29 |
Partially correct |
38 ms |
2272 KB |
Output is partially correct - L* = 15 |
30 |
Partially correct |
39 ms |
2272 KB |
Output is partially correct - L* = 15 |
31 |
Partially correct |
39 ms |
2288 KB |
Output is partially correct - L* = 15 |
32 |
Partially correct |
48 ms |
2328 KB |
Output is partially correct - L* = 16 |
33 |
Partially correct |
39 ms |
2268 KB |
Output is partially correct - L* = 15 |
34 |
Partially correct |
41 ms |
2280 KB |
Output is partially correct - L* = 15 |
35 |
Partially correct |
38 ms |
2312 KB |
Output is partially correct - L* = 15 |
36 |
Partially correct |
37 ms |
2224 KB |
Output is partially correct - L* = 15 |
37 |
Partially correct |
39 ms |
2256 KB |
Output is partially correct - L* = 16 |
38 |
Partially correct |
38 ms |
2228 KB |
Output is partially correct - L* = 15 |
39 |
Partially correct |
40 ms |
2340 KB |
Output is partially correct - L* = 15 |
40 |
Partially correct |
47 ms |
2268 KB |
Output is partially correct - L* = 15 |