#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;
void Joi(int N, int M, int A[], int B[], long long X, int T) {
for(int i=0; i<N; i++) MessageBoard(i, (X >> (i%60)) & 1);
}
#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
static int move(int x) {
// printf("dest: %d\n", x);
return Move(x);
}
static long long ret = 0;
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
return 0;
int xx = V;
while(P % 60 || P + 60 > N) xx = move(--P);
for(int i=0; i<60; i++) {
ret |= (xx << i);
if(i+1 < 60) xx = move(++P);
}
return ret;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
844 KB |
Wrong Answer [7] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
23 ms |
2180 KB |
Wrong Answer [7] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
888 KB |
Wrong Answer [7] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
23 ms |
2240 KB |
Wrong Answer [7] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
23 ms |
2112 KB |
Wrong Answer [7] |
2 |
Halted |
0 ms |
0 KB |
- |