제출 #1203292

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1203292		Tymond	Ancient Machine (JOI21_ancient_machine)	C++20	0 / 100	12 ms	1984 KiB

Anna

#include <bits/stdc++.h>
#include "Anna.h"
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct pair_hash{
  size_t operator()(const pair<int,int>&x)const{
    return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
  }
};

//wyślij informacje
void encode(vi x){
    vll fib(51, 1LL);
    fib[1] = 2LL;
    for(int i = 2; i < 51; i++){
        fib[i] = fib[i - 1] + fib[i - 2];
    }

    for(int i = 0; i < sz(x); i += 50){
        ll a = 0;
        for(int j = 0; j < 50; j++){
            if(x[i + j]){
                a += fib[50 - j - 1];
            }
        }

        for(int j = 0; j < 35; j++){
            if((1LL << j) & a){
                Send(1);
            }else{
                Send(0);
            }
        }
    }
}

void Anna(int n, vector<char> S) {
    int x = -1;
    for(int i = 0; i < n; i++){
        if(S[i] == 'X'){
            x = i;
            break;
        }
    }

    vi R(n, 0);
    if(x != -1){
        R[x] = 1;
        for(int i = x + 2; i < n; i++){
            if(S[i] == 'Z'){
                R[i] = 1;
            }
            if(R[i - 1]){
                R[i - 1] = 0;
            }
        }
    }

    while(n % 50 != 0){
        n++;
        R.pb(0);
    }

    encode(R);
}

Bruno

#include <bits/stdc++.h>
#include "Bruno.h"
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct pair_hash{
  size_t operator()(const pair<int,int>&x)const{
    return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
  }
};

vi decode(vi x){
    vi res = {};
    vll fib(51, 1LL);
    fib[1] = 2LL;
    for(int i = 2; i <= 50; i++){
        fib[i] = fib[i - 1] + fib[i - 2];
    }
    for(int i = 0; i < sz(x); i += 50){
        ll a = 0LL;
        for(int j = 0; j < 35; j++){
            if(x[i * 35 + j]){
                a += (1 << j);
            }
        }

        for(int j = 0; j < 50; j++){
            if(a >= fib[50 - j - 1]){
                a -= fib[50 - j - 1];
                res.pb(1);
            }else{
                res.pb(0);
            }
        }
    }
    return res;
}

void Bruno(int n, int L, vi A) {
    vi R = decode(A);
    
    int x = -1;
    for(int i = 0; i < n; i++){
        if(R[i]){
            x = i;
            break;
        }else{
            Remove(i);
        }
    }

    if(x == -1){
        return;
    }
    int l = x;
    for(int j = x + 1; j < n; j++){
        if(R[j]){
            for(int y = j - 1; y > l; y--){
                Remove(y);
            }
            Remove(j);
            l = j;
        }
    }
    Remove(x);
    for(int i = l + 1; i < n; i++){
        Remove(i);
    }
}

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