oj.uz

답안 #900626

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
900626 2024-01-08T17:16:55 Z GrindMachine Ancient Machine (JOI21_ancient_machine) C++17
99 / 100
 51 ms 11104 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{
            b[i] = 1;
            if(b[i-1]){
                b[i-1] = 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--;
        }

        assert(val == 0);
    }

    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
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 792 KB Output is correct
2 Correct 0 ms 796 KB Output is correct
3 Correct 0 ms 796 KB Output is correct
4 Correct 1 ms 784 KB Output is correct
5 Correct 0 ms 792 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 796 KB Output is correct
9 Correct 1 ms 792 KB Output is correct
10 Correct 0 ms 796 KB Output is correct
11 Correct 0 ms 872 KB Output is correct

Subtask #2
94.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 39 ms 9632 KB Partially correct
2 Partially correct 40 ms 10284 KB Partially correct
3 Partially correct 37 ms 10284 KB Partially correct
4 Partially correct 37 ms 9988 KB Partially correct
5 Partially correct 39 ms 10312 KB Partially correct
6 Partially correct 37 ms 10096 KB Partially correct
7 Partially correct 37 ms 10140 KB Partially correct
8 Partially correct 37 ms 10104 KB Partially correct
9 Partially correct 39 ms 10256 KB Partially correct
10 Partially correct 37 ms 10112 KB Partially correct
11 Partially correct 37 ms 10344 KB Partially correct
12 Partially correct 39 ms 10244 KB Partially correct
13 Partially correct 42 ms 11012 KB Partially correct
14 Partially correct 42 ms 10068 KB Partially correct
15 Partially correct 41 ms 10192 KB Partially correct
16 Partially correct 38 ms 10176 KB Partially correct
17 Partially correct 51 ms 11036 KB Partially correct
18 Partially correct 41 ms 9724 KB Partially correct
19 Partially correct 44 ms 9716 KB Partially correct
20 Partially correct 37 ms 10028 KB Partially correct
21 Partially correct 38 ms 10244 KB Partially correct
22 Partially correct 45 ms 10848 KB Partially correct
23 Partially correct 40 ms 10184 KB Partially correct
24 Partially correct 38 ms 10292 KB Partially correct
25 Partially correct 44 ms 9668 KB Partially correct
26 Partially correct 44 ms 11004 KB Partially correct
27 Partially correct 43 ms 10048 KB Partially correct
28 Partially correct 43 ms 11104 KB Partially correct
29 Partially correct 42 ms 9428 KB Partially correct
30 Partially correct 42 ms 10252 KB Partially correct
31 Partially correct 50 ms 9716 KB Partially correct
32 Partially correct 40 ms 10240 KB Partially correct
33 Partially correct 38 ms 10296 KB Partially correct