#include "Anna.h"
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
//const int oo = 1e18 + 7, mod = 1e9 + 7;
int ret[100005];
void Anna(int n, vector<char> S){
int need = 0, occ = 0, pos = -1;
for(int i = n - 1; i >= 0; i--){
if(S[i] == 'Z' && !occ){
occ = 1;
pos = i;
ret[i] = 1;
}
else if(S[i] == 'X' && occ && (!i || S[i - 1] != 'X')){
ret[i] = 1;
}
}
//for(int i = 0; i < n; i++) Send(ret[i]);
// Step 1: encode the position of 'Z'
if(pos == -1) return;
for(int i = 0; i < 19; i++){
if(pos & (1LL << i)) Send(1);
else Send(0);
}
Send(pos >= 2 && S[pos - 1] == 'X' && S[pos - 2] != 'X');
for(int i = pos - 2; i >= 0; i -= 10){
if(i <= 9){
for(int j = i; j >= 0; j--){
if(S[j] == 'X' && (!j || S[j - 1] != 'X')) Send(1);
else Send(0);
}
}
else{
int tol = 0;
for(int j = 0; j < 5; j++){
int temp1 = i - 2 * j, temp2 = i - 2 * j - 1;
if(S[temp1] == 'X' && S[temp1 - 1] != 'X') tol = (tol * 3 + 1);
else if(S[temp2] == 'X' && S[temp2 - 1] != 'X') tol = (tol * 3 + 2);
else tol = (tol + 3);
}
for(int j = 0; j < 8; j++){
if(tol & (1LL << j)) Send(1);
else Send(0);
}
}
}
}
/*
void process(){
}
signed main(){
ios_base::sync_with_stdio(0);
process();
}*/
#include<bits/stdc++.h>
#include "Bruno.h"
using namespace std;
//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
//const int N = 1e5 + 5;
//const int oo = 1e18 + 7, mod = 1e9 + 7;
int a[100005];
void decode(vector<int> B){
if(!B.size()) return;
int pos = 0;
for(int i = 0; i < 19; i++){
if(B[i] == 1) pos += (1LL << i);
}
if(pos <= 1) return;
//cout << pos << "\n";
//return;
a[pos] = 1;
if(B[19]) a[pos - 1] = 1;
int itr = 20;
for(int i = pos - 2; i >= 0; i -= 10){
if(i >= 10){
int tol = 0;
for(int j = itr; j < itr + 8; j++){
if(B[j]) tol += (1LL << (j - itr));
}
for(int j = 4; j >= 0; j--){
int temp1 = i - 2 * j, temp2 = i - 2 * j - 1;
if(tol % 3 == 1) a[temp1] = 1;
if(tol % 3 == 2) a[temp2] = 1;
tol /= 3;
}
itr += 8;
}
else{
int tol = 0;
for(int j = i; j >= 0; j--){
a[j] = B[itr];
itr++;
}
}
}
}
void Bruno(int N, int L, vector<int> B){
//cout << B.size() << "\n";
for(int i = 0; i < N; i++) Remove(i);
decode(B);
return;
//cout << N << " " << L << "\n";
vector<int> not_rev;
int pos = -1;
for(int i = N - 1; i >= 0; i--){
if(a[i]){
pos = i;
break;
}
}
if(pos == -1){
for(int i = 0; i < N; i++) Remove(i);
return;
}
int lst = pos;
for(int i = pos - 1; i >= 0; i--){
if(!i || a[i]){
for(int j = i + 1; j < lst; j++) Remove(j);
Remove(i);
lst = i;
}
//Remove(i);
}
for(int i = pos; i < N; i++) Remove(i);
}
/*
void process(){
}
signed main(){
ios_base::sync_with_stdio(0);
process();
}*/
Compilation message
Anna.cpp: In function 'void Anna(int, std::vector<char>)':
Anna.cpp:22:6: warning: unused variable 'need' [-Wunused-variable]
22 | int need = 0, occ = 0, pos = -1;
| ^~~~
Bruno.cpp: In function 'void decode(std::vector<int>)':
Bruno.cpp:50:8: warning: unused variable 'tol' [-Wunused-variable]
50 | int tol = 0;
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
488 KB |
Wrong Answer [6] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
67 ms |
8324 KB |
Wrong Answer [6] |
| 2 |
Halted |
0 ms |
0 KB |
- |
