#include<bits/stdc++.h>
#include "Annalib.h"
using namespace std;
const int MAXN = 160;
bool marc[MAXN];
void Anna(int n, long long x, int k, int p[])
{
for(int i = 0; i < k; i++) marc[p[i]] = true;
int bit = 0;
for(int i = 0; i < n; i++)
{
if(bit > 60 || marc[i] || marc[i + 1]) Set(i, 0);
else
{
Set(i, 1); i++;
Set(i, (int) ((x & (1LL << bit)) > 0)); bit++;
}
}
}
#include<bits/stdc++.h>
#include "Brunolib.h"
using namespace std;
long long Bruno(int n, int a[])
{
long long x = 0;
int bit = 0;
for(int i = 0; i < n; i++)
if(a[i])
{
x += (long long) a[i + 1] << bit;
i++, bit++;
}
return x;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
772 KB |
Wrong Answer [1] |
2 |
Partially correct |
44 ms |
3072 KB |
Output isn't correct - L* = 0 |
3 |
Incorrect |
1 ms |
776 KB |
Wrong Answer [1] |
4 |
Incorrect |
1 ms |
900 KB |
Wrong Answer [1] |
5 |
Partially correct |
44 ms |
3072 KB |
Output isn't correct - L* = 0 |
6 |
Incorrect |
1 ms |
772 KB |
Wrong Answer [1] |
7 |
Incorrect |
0 ms |
772 KB |
Wrong Answer [1] |
8 |
Incorrect |
1 ms |
644 KB |
Wrong Answer [1] |
9 |
Partially correct |
44 ms |
3056 KB |
Output isn't correct - L* = 0 |
10 |
Incorrect |
1 ms |
900 KB |
Wrong Answer [1] |
11 |
Incorrect |
0 ms |
780 KB |
Wrong Answer [1] |
12 |
Incorrect |
1 ms |
772 KB |
Wrong Answer [1] |
13 |
Partially correct |
44 ms |
3072 KB |
Output isn't correct - L* = 0 |
14 |
Incorrect |
1 ms |
780 KB |
Wrong Answer [1] |
15 |
Incorrect |
1 ms |
1020 KB |
Wrong Answer [1] |
16 |
Incorrect |
1 ms |
772 KB |
Wrong Answer [1] |
17 |
Partially correct |
44 ms |
3072 KB |
Output isn't correct - L* = 0 |
18 |
Partially correct |
43 ms |
3072 KB |
Output isn't correct - L* = 0 |
19 |
Partially correct |
46 ms |
3072 KB |
Output isn't correct - L* = 0 |
20 |
Partially correct |
44 ms |
3072 KB |
Output isn't correct - L* = 0 |
21 |
Incorrect |
0 ms |
772 KB |
Wrong Answer [1] |
22 |
Incorrect |
0 ms |
644 KB |
Wrong Answer [1] |
23 |
Partially correct |
44 ms |
3072 KB |
Output isn't correct - L* = 0 |
24 |
Partially correct |
44 ms |
3056 KB |
Output isn't correct - L* = 0 |
25 |
Incorrect |
2 ms |
904 KB |
Wrong Answer [1] |
26 |
Partially correct |
45 ms |
3056 KB |
Output isn't correct - L* = 0 |
27 |
Partially correct |
44 ms |
3072 KB |
Output isn't correct - L* = 0 |
28 |
Incorrect |
0 ms |
904 KB |
Wrong Answer [1] |
29 |
Incorrect |
2 ms |
672 KB |
Wrong Answer [1] |
30 |
Partially correct |
44 ms |
3056 KB |
Output isn't correct - L* = 0 |
31 |
Incorrect |
2 ms |
740 KB |
Wrong Answer [1] |
32 |
Incorrect |
1 ms |
772 KB |
Wrong Answer [1] |
33 |
Incorrect |
1 ms |
1024 KB |
Wrong Answer [1] |
34 |
Incorrect |
1 ms |
784 KB |
Wrong Answer [1] |
35 |
Incorrect |
1 ms |
780 KB |
Wrong Answer [1] |
36 |
Incorrect |
0 ms |
776 KB |
Wrong Answer [1] |
37 |
Partially correct |
44 ms |
3056 KB |
Output isn't correct - L* = 0 |
38 |
Incorrect |
0 ms |
780 KB |
Wrong Answer [1] |
39 |
Incorrect |
1 ms |
644 KB |
Wrong Answer [1] |
40 |
Incorrect |
0 ms |
772 KB |
Wrong Answer [1] |