#include <bits/stdc++.h>
#include "Annalib.h"
using namespace std;
int mark[151];
void Anna(int n, long long x, int k, int p[] )
{
for(int i=0; i<k; i++) mark[p[i]-1] = 1;
long long cnt = 0;
for(int i=0; i<n-1; i++)
{
if(!mark[i] && !mark[i+1] && cnt < 60)
{
if(x & (1LL<<cnt)) Set(i, 1), Set(i+1, 1);
else Set(i, 1), Set(i+1, 0);
cnt++;
i++;
}
else if(i == n-2) Set(i, 0), Set(i+1, 0);
else Set(i, 0);
}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long Bruno(int n, int a[] )
{
long long x = 0;
int cnt = 0;
for(int i=0; i<n-1; i++)
{
if(a[i] == 1)
{
if(a[i+1]) x |= (1LL<<cnt);
cnt++;
i++;
}
}
return x;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
860 KB |
Wrong Answer [4] |
2 |
Incorrect |
40 ms |
3064 KB |
Output isn't correct - L* = 0 |
3 |
Incorrect |
4 ms |
988 KB |
Wrong Answer [4] |
4 |
Incorrect |
4 ms |
760 KB |
Wrong Answer [4] |
5 |
Incorrect |
39 ms |
3056 KB |
Output isn't correct - L* = 0 |
6 |
Incorrect |
4 ms |
760 KB |
Wrong Answer [4] |
7 |
Incorrect |
4 ms |
888 KB |
Wrong Answer [4] |
8 |
Incorrect |
4 ms |
864 KB |
Wrong Answer [4] |
9 |
Incorrect |
39 ms |
3312 KB |
Output isn't correct - L* = 0 |
10 |
Incorrect |
4 ms |
768 KB |
Wrong Answer [4] |
11 |
Incorrect |
39 ms |
3056 KB |
Output isn't correct - L* = 0 |
12 |
Incorrect |
4 ms |
780 KB |
Wrong Answer [4] |
13 |
Incorrect |
4 ms |
684 KB |
Wrong Answer [4] |
14 |
Incorrect |
4 ms |
916 KB |
Wrong Answer [4] |
15 |
Incorrect |
4 ms |
760 KB |
Wrong Answer [4] |
16 |
Incorrect |
39 ms |
3056 KB |
Output isn't correct - L* = 0 |
17 |
Incorrect |
4 ms |
760 KB |
Wrong Answer [4] |
18 |
Incorrect |
4 ms |
772 KB |
Wrong Answer [4] |
19 |
Incorrect |
4 ms |
772 KB |
Wrong Answer [4] |
20 |
Incorrect |
40 ms |
3056 KB |
Output isn't correct - L* = 0 |
21 |
Incorrect |
4 ms |
860 KB |
Wrong Answer [4] |
22 |
Incorrect |
40 ms |
3056 KB |
Output isn't correct - L* = 0 |
23 |
Incorrect |
40 ms |
3056 KB |
Output isn't correct - L* = 0 |
24 |
Incorrect |
4 ms |
760 KB |
Wrong Answer [4] |
25 |
Incorrect |
40 ms |
3056 KB |
Output isn't correct - L* = 0 |
26 |
Incorrect |
40 ms |
3056 KB |
Output isn't correct - L* = 0 |
27 |
Incorrect |
4 ms |
888 KB |
Wrong Answer [4] |
28 |
Incorrect |
4 ms |
860 KB |
Wrong Answer [4] |
29 |
Incorrect |
4 ms |
760 KB |
Wrong Answer [4] |
30 |
Incorrect |
4 ms |
772 KB |
Wrong Answer [4] |
31 |
Incorrect |
40 ms |
3056 KB |
Output isn't correct - L* = 0 |
32 |
Incorrect |
4 ms |
760 KB |
Wrong Answer [4] |
33 |
Incorrect |
4 ms |
892 KB |
Wrong Answer [4] |
34 |
Incorrect |
39 ms |
3056 KB |
Output isn't correct - L* = 0 |
35 |
Incorrect |
39 ms |
3056 KB |
Output isn't correct - L* = 0 |
36 |
Incorrect |
39 ms |
3056 KB |
Output isn't correct - L* = 0 |
37 |
Incorrect |
4 ms |
888 KB |
Wrong Answer [4] |
38 |
Incorrect |
39 ms |
3056 KB |
Output isn't correct - L* = 0 |
39 |
Incorrect |
39 ms |
2944 KB |
Output isn't correct - L* = 0 |
40 |
Incorrect |
39 ms |
3000 KB |
Output isn't correct - L* = 0 |