#include "Joi.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
void Joi(int n, int m, int A[], int B[], ll X, int T){
vector<int> bin;
for(int i = 0; i < 60; i++){
bin.push_back(X%2);
X/=2;
}
for(int i = 0; i < n; i++) MessageBoard(i, bin[i%60]);
}
#include "Ioi.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
ll Ioi(int n, int m, int A[], int B[], int p, int v, int T){
vector<int> bin(60, -1);
bin[p%60] = v;
int left = 59;
while(p && left){
p--;
bin[p%60] = Move(p);
left--;
}
while(left){
p++;
if(bin[p%60] == -1){
bin[p%60] = Move(p);
left--;
}
else Move(p);
}
ll X = 0;
for(int i = 0; i < 60; i++) if(bin[i]) X+=1LL<<i;
return X;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
796 KB |
Wrong Answer [7] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
11 ms |
2336 KB |
Wrong Answer [7] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
788 KB |
Output is correct |
2 |
Correct |
0 ms |
788 KB |
Output is correct |
3 |
Correct |
0 ms |
800 KB |
Output is correct |
4 |
Correct |
2 ms |
836 KB |
Output is correct |
5 |
Correct |
1 ms |
948 KB |
Output is correct |
6 |
Correct |
2 ms |
832 KB |
Output is correct |
7 |
Correct |
2 ms |
940 KB |
Output is correct |
8 |
Correct |
1 ms |
832 KB |
Output is correct |
9 |
Correct |
6 ms |
1848 KB |
Output is correct |
10 |
Correct |
7 ms |
2096 KB |
Output is correct |
11 |
Correct |
5 ms |
1844 KB |
Output is correct |
12 |
Correct |
0 ms |
796 KB |
Output is correct |
13 |
Correct |
0 ms |
800 KB |
Output is correct |
14 |
Correct |
0 ms |
788 KB |
Output is correct |
15 |
Correct |
0 ms |
800 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
12 ms |
2344 KB |
Wrong Answer [7] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
11 ms |
2336 KB |
Wrong Answer [7] |
2 |
Halted |
0 ms |
0 KB |
- |