oj.uz

Submission #900624

# Submission time Handle Problem Language Result Execution time Memory
900624 2024-01-08T17:11:55 Z GrindMachine Ancient Machine (JOI21_ancient_machine) C++17
0 / 100
 37 ms 9872 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/88748?#comment-773760
edi

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
const int B = 90;

#include "Anna.h"

void Anna(int n, std::vector<char> A) {
    vector<ll> dp(105);
    dp[0] = dp[1] = 1;
    for(int i = 2; i <= 100; ++i){
        dp[i] = dp[i-1]+dp[i-2];
    }

    ll fib_bits = 63;

    vector<ll> a(n);
    rep(i,n) a[i] = A[i]-'X';

    ll firstx = -1;
    vector<ll> b(n);

    rep(i,n){
        if(a[i] != 0){
            if(firstx == -1){
                b[i] = 0;
                conts;
            }
        }

        if(a[i] == 0){
            b[i] = 0;
            if(firstx == -1){
                firstx = i;
            }
        }
        else if(a[i] == 1){
            b[i] = 0;
        }
        else{
            if(a[i-1] != 2){
                b[i] = 1;
            }
            else{
                b[i] = 0;
            }
        }
    }

    if(firstx == -1){
        firstx = n;
    }

    rep(i,n-1){
        assert(!(b[i]&b[i+1]));
    }

    rep(bit,17){
        if(firstx&(1<<bit)){
            Send(1);
        }
        else{
            Send(0);
        }
    }

    rep(block,ceil2(n-1,B)){
        ll ord = 0;
        ll ptr = B;
        for(int i = block*B; i < (block+1)*B; ++i){
            ll x = 0;
            if(i < n) x = b[i];
            if(x){
                ord += dp[ptr];
            }
            ptr--;
        }

        rep(bit,fib_bits){
            if(ord&(1ll<<bit)){
                Send(1);
            }
            else{
                Send(0);
            }
        }
    }
}

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/88748?#comment-773760
edi

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
const int B = 90;

#include "Bruno.h"

void Bruno(int n, int m, std::vector<int> A) {
    vector<ll> dp(105);
    dp[0] = dp[1] = 1;
    for(int i = 2; i <= 100; ++i){
        dp[i] = dp[i-1]+dp[i-2];
    }

    ll fib_bits = 63;

    auto get = [&](ll s, ll cnt){
        ll val = 0;
        ll bit = 0;

        for(int i = s; i < s+cnt; ++i){
            if(A[i]){
                val |= (1ll<<bit);
            }
            bit++;
        }

        return val;
    };

    ll firstx = get(0,17);
    ll read_ptr = 17;

    if(firstx == n){
        rep(i,n){
            Remove(i);
        }
        return;
    }

    rep(i,firstx){
        Remove(i);
    }

    vector<ll> a(n);

    rep(block,ceil2(n-1,B)){
        ll val = get(read_ptr,fib_bits);
        read_ptr += fib_bits;
        ll ptr = B;

        for(int i = block*B; i < (block+1)*B and i < n; ++i){
            if(val >= dp[ptr]){
                a[i] = 1;
                val -= dp[ptr];
            }
            ptr--;
        }
    }

    vector<ll> curr;
    curr.pb(firstx);

    for(int i = firstx+1; i < n; ++i){
        curr.pb(i);

        if(a[i] == 1){
            curr.pop_back();
            while(sz(curr) > 1){
                Remove(curr.back());
                curr.pop_back();
            }
            Remove(i);
        }
    }

    while(!curr.empty()){
        Remove(curr.back());
        curr.pop_back();
    }
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 780 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 95.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 9872 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -