#include <bits/stdc++.h>
#include "Anna.h"
using namespace std;
namespace Nigga{
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T& container, string separator = " ", string finish = "\n"){
for(auto item: container) cout << item << separator;
cout << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
ll dp[64];
void prepare(){
dp[0] = 1; dp[1] = 2;
for(int i = 2; i<64; ++i) {
dp[i] = dp[i-1] + dp[i-2];
// cout << dp[i] << " ";
}
// cout << "\n";
}
}
// void Send(int d){cout << d << " ";}
void Anna(int N, vector<char> S){
typedef long long ll;
typedef unsigned long long ull;
int n = N;
vector<int> a;
for(int i = 0; i<n; ++i) a.push_back(S[i] - 'X');
Nigga::prepare();
vector<bool> ans(n);
int idx = -1;
for(int i = 0; i<n; ++i) if (a[i] == 0){
ans[i] = 1;
idx = i;
break;
}
if (idx != -1){
for(int i = idx + 1; i<n; ++i) if (a[i] == 2 && (i == n - 1 || a[i+1] != 2)){
ans[i] = 1;
}
}
while(ans.size() % 64) ans.push_back(0);
for(int i = 0; i<ans.size(); i += 64){
ll s = 0;
for(int j = 0; j<64; ++j) if (ans[i + j]) s += Nigga::dp[j];
for(int j = 0; j<46; ++j) {
Send(s % 2);
s /= 2;
}
}
}
// int main(void){
// Anna(6, {'X', 'Y', 'Z', 'X', 'Y', 'Z'});
// return 0;
// }
#include <bits/stdc++.h>
#include "Bruno.h"
using namespace std;
namespace Ligma{
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T& container, string separator = " ", string finish = "\n"){
for(auto item: container) cout << item << separator;
cout << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
void Remove(int d){
cout << d << "\n";
}
ll dp[64];
void prepare(){
dp[0] = 1; dp[1] = 2;
for(int i = 2; i<64; ++i) {
dp[i] = dp[i-1] + dp[i-2];
// cout << dp[i] << " ";
}
// cout << "\n";
}
}
// void Remove(int d){cout << "Remove: " << d << "\n";}
void Bruno(int N, int L, vector<int> A){
typedef long long ll;
typedef unsigned long long ull;
Ligma::prepare();
int n = N;
vector<int> pos;
for(int i = 0; i<A.size(); i += 46){
ll s = 0;
for(int j = 45; j>=0; --j) s = s * 2 + A[i+j];
for(int j = 63; j>=0; --j) if (Ligma::dp[j] <= s){
s -= Ligma::dp[j];
pos.push_back(i + j);
}
}
sort(ALL(pos));
if (pos.empty()){
for(int i = 0; i<n; ++i) Remove(i);
return;
}
for(int i = 1; i<pos.size(); ++i){
for(int j = pos[i] - 1; j > pos[i-1]; --j) Remove(j);
Remove(pos[i]);
}
for(int i = 0; i<=pos[0]; ++i) Remove(i);
for(int i = pos.back() + 1; i<n; ++i) Remove(i);
}
// int main(void){
// Bruno(6, 45, {1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0});
// return 0;
// }
Compilation message
Anna.cpp: In function 'void Anna(int, std::vector<char>)':
Anna.cpp:90:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
90 | for(int i = 0; i<ans.size(); i += 64){
| ~^~~~~~~~~~~
Anna.cpp:68:28: warning: typedef 'ull' locally defined but not used [-Wunused-local-typedefs]
68 | typedef unsigned long long ull;
| ^~~
Bruno.cpp: In function 'void Bruno(int, int, std::vector<int>)':
Bruno.cpp:75:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
75 | for(int i = 0; i<A.size(); i += 46){
| ~^~~~~~~~~
Bruno.cpp:89:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
89 | for(int i = 1; i<pos.size(); ++i){
| ~^~~~~~~~~~~
Bruno.cpp:71:28: warning: typedef 'ull' locally defined but not used [-Wunused-local-typedefs]
71 | typedef unsigned long long ull;
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
780 KB |
Output is correct |
| 2 |
Correct |
0 ms |
788 KB |
Output is correct |
| 3 |
Correct |
1 ms |
792 KB |
Output is correct |
| 4 |
Correct |
0 ms |
780 KB |
Output is correct |
| 5 |
Correct |
0 ms |
780 KB |
Output is correct |
| 6 |
Correct |
0 ms |
784 KB |
Output is correct |
| 7 |
Correct |
0 ms |
788 KB |
Output is correct |
| 8 |
Correct |
0 ms |
988 KB |
Output is correct |
| 9 |
Correct |
0 ms |
780 KB |
Output is correct |
| 10 |
Correct |
0 ms |
792 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1040 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
16 ms |
3120 KB |
Wrong Answer [4] |
| 2 |
Halted |
0 ms |
0 KB |
- |
