Submission #935576

#	Time	Username	Problem	Language	Result	Execution time	Memory
935576		steveonalex	Ancient Machine (JOI21_ancient_machine)	C++17	0 / 100	31 ms	11656 KiB

Anna

#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] = dp[1] = 1;
    for(int i = 2; i<64; ++i) dp[i] = dp[i-1] + dp[i-2];
    cerr << dp[63] << "\n";
}

}


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<45; ++j) {
            Send(s % 2);
            s /= 2;
        }
    }
}

// int main(void){
//     return 0;
// }

Bruno

#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] = dp[1] = 1;
	for(int i = 2; i<64; ++i) dp[i] = dp[i-1] + dp[i-2];
	cerr << dp[63] << "\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){
    	ll s = 0;
    	for(int j = 44; 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);
    	}
    }

    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, 16, {0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0});

//     Ligma::prepare();

//     return 0;
// }

Compilation message (stderr)

Anna.cpp: In function 'void Anna(int, std::vector<char>)':
Anna.cpp:86:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for(int i = 0; i<ans.size(); i += 64){
      |                    ~^~~~~~~~~~~
Anna.cpp:64:28: warning: typedef 'ull' locally defined but not used [-Wunused-local-typedefs]
   64 | typedef unsigned long long ull;
      |                            ^~~

Bruno.cpp: In function 'void Bruno(int, int, std::vector<int>)':
Bruno.cpp:70:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     for(int i = 0; i<A.size(); ++i){
      |                    ~^~~~~~~~~
Bruno.cpp:83:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for(int i = 1; i<pos.size(); ++i){
      |                    ~^~~~~~~~~~~
Bruno.cpp:66:28: warning: typedef 'ull' locally defined but not used [-Wunused-local-typedefs]
   66 | typedef unsigned long long ull;
      |                            ^~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 95