#include <bits/stdc++.h>
#include "Annalib.h"
using namespace std;
void Anna( int N, long long X, int K, int P[] )
{
vector<int> bom(N, 1);
for (int k = 0; k < K; k++) bom[P[k]] = 0;
for (int i = 0; i < N-1; i++)
{
if (!bom[i]) {Set(i, 0); continue;}
if (!bom[i+1]) {Set(i, 0); continue;}
Set(i, 1); Set(i+1, (X&1LL)); X >>= 1LL; ++i;
}
if (!bom[N-2] || !bom[N-1]) Set(N-1, 0);
}
#include <bits/stdc++.h>
#include "Brunolib.h"
using namespace std;
long long Bruno( int N, int A[] )
{
long long X = 0;
for (int i = 0; i < N-1; i++)
{
if (!A[i]) continue;
X <<= 1LL; X |= A[i+1]; ++i;
}
return X;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
800 KB |
Wrong Answer [4] |
2 |
Incorrect |
0 ms |
800 KB |
Wrong Answer [4] |
3 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
4 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
5 |
Incorrect |
1 ms |
800 KB |
Wrong Answer [4] |
6 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
7 |
Incorrect |
0 ms |
800 KB |
Wrong Answer [4] |
8 |
Incorrect |
0 ms |
804 KB |
Wrong Answer [4] |
9 |
Incorrect |
0 ms |
800 KB |
Wrong Answer [4] |
10 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
11 |
Incorrect |
0 ms |
800 KB |
Wrong Answer [4] |
12 |
Incorrect |
1 ms |
812 KB |
Wrong Answer [4] |
13 |
Incorrect |
0 ms |
1064 KB |
Wrong Answer [4] |
14 |
Incorrect |
1 ms |
812 KB |
Wrong Answer [4] |
15 |
Incorrect |
0 ms |
796 KB |
Wrong Answer [4] |
16 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
17 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
18 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
19 |
Incorrect |
0 ms |
1064 KB |
Wrong Answer [4] |
20 |
Incorrect |
0 ms |
800 KB |
Wrong Answer [4] |
21 |
Incorrect |
1 ms |
796 KB |
Wrong Answer [4] |
22 |
Incorrect |
0 ms |
800 KB |
Wrong Answer [4] |
23 |
Incorrect |
0 ms |
808 KB |
Wrong Answer [4] |
24 |
Incorrect |
0 ms |
800 KB |
Wrong Answer [4] |
25 |
Incorrect |
1 ms |
796 KB |
Wrong Answer [4] |
26 |
Incorrect |
0 ms |
800 KB |
Wrong Answer [4] |
27 |
Incorrect |
0 ms |
800 KB |
Wrong Answer [4] |
28 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
29 |
Incorrect |
1 ms |
908 KB |
Wrong Answer [4] |
30 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
31 |
Incorrect |
0 ms |
800 KB |
Wrong Answer [4] |
32 |
Incorrect |
0 ms |
800 KB |
Wrong Answer [4] |
33 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
34 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
35 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
36 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
37 |
Incorrect |
0 ms |
812 KB |
Wrong Answer [4] |
38 |
Incorrect |
0 ms |
800 KB |
Wrong Answer [4] |
39 |
Incorrect |
0 ms |
796 KB |
Wrong Answer [4] |
40 |
Incorrect |
1 ms |
796 KB |
Wrong Answer [4] |