oj.uz

답안 #1060458

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060458 2024-08-15T15:02:12 Z GrindMachine Broken Device (JOI17_broken_device) C++17
100 / 100
 31 ms 2880 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) 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://ivaniscoding.wordpress.com/2018/08/25/communication-3-broken-device/
https://oj.uz/submission/284732

*/

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

#include "Annalib.h"

static vector<int> here[15];
static vector<int> final_here[15];

static void go(int i, int take_mask){
    if(!final_here[1].empty()) return;

    if(i > 6){
        bool ok = true;

        rep(blocked,3){
            bool z = false, o = false;
            bool zz = false, zo = false;

            rep1(mask,7){
                if(mask&(1<<blocked)) conts;
                if(count(all(here[1]),mask)){
                    z = true;
                }
                if(count(all(here[2]),mask)){
                    o = true;
                }
                if(count(all(here[3]),mask)){
                    zz = true;
                }
                if(count(all(here[4]),mask)){
                    zo = true;
                }
            }

            if(zz and zo){
                z = true;
            }

            if(!z or !o){
                ok = false;
            }
        }

        if(ok){
            rep1(j,6){
                final_here[j] = here[j];
            }
        }

        return;
    }

    if(i != 2){
        rep(mask,8){
            if(take_mask&(1<<mask)) conts;
            here[i].pb(mask);
            go(i+1,take_mask|(1<<mask));
            here[i].pop_back();
        }   
    }
    else{
        rep(mask1,8){
            rep(mask2,8){
                if(take_mask&(1<<mask1)) conts;
                if(take_mask&(1<<mask2)) conts;
                here[i].pb(mask1);
                here[i].pb(mask2);
                go(i+1,take_mask|(1<<mask1)|(1<<mask2));
                here[i].pop_back();
                here[i].pop_back();
            }
        }
    }
}

const int B = 60;

void Anna( int n, long long X, int k, int a[] ){
    vector<bool> blocked(n);
    rep(i,k) blocked[a[i]] = 1;

    vector<int> send;
    rev(bit,B-1,0){
        if(X&(1ll<<bit)){
            send.pb(1);
        }
        else{
            send.pb(0);
        }
    }
    send.pb(0);

    go(1,1);
    rep1(j,6) here[j] = final_here[j];

    int ptr = 0;
    vector<int> s(n);

    auto f = [&](int i, int mask){
        int b = 0;
        rev(j,i+2,i){
            int x = 0;
            if(mask&(1<<b)) x = 1;
            s[j] = x;
            b++;
        }
    };

    for(int i = 0; i < n and ptr < B; i += 3){
        int block_cnt = 0;
        for(int j = i; j < i+3; ++j){
            block_cnt += blocked[j];
        }

        if(block_cnt >= 2) conts;

        if(block_cnt == 1){
            int x = send[ptr];
            int y = x<<1|send[ptr+1];
            y += 3;

            vector<pii> v;
            if(x == 1){
                v.pb({here[2][0],1});
                v.pb({here[2][1],1});
            }
            else{
                v.pb({here[1][0],1});
                v.pb({here[y][0],2});
            }

            for(auto [mask,add] : v){
                bool ok = true;
                int b = 0;
                rev(j,i+2,i){
                    if(mask&(1<<b)){
                        if(blocked[j]){
                            ok = false;
                        }
                    }
                    b++;
                }

                if(ok){
                    f(i,mask);
                    ptr += add;
                    break;
                }
            }
        }
        else{
            int val = send[ptr]<<1|send[ptr+1];
            ptr += 2;
            val += 3;
            f(i,here[val][0]);
        }
    }

    assert(ptr >= B);

    rep(i,n){
        Set(i,s[i]);
    }
}

#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) 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://ivaniscoding.wordpress.com/2018/08/25/communication-3-broken-device/
https://oj.uz/submission/284732

*/

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

#include "Brunolib.h"

static vector<int> here[15];
static vector<int> final_here[15];

static void go(int i, int take_mask){
    if(!final_here[1].empty()) return;

    if(i > 6){
        bool ok = true;

        rep(blocked,3){
            bool z = false, o = false;
            bool zz = false, zo = false;

            rep1(mask,7){
                if(mask&(1<<blocked)) conts;
                if(count(all(here[1]),mask)){
                    z = true;
                }
                if(count(all(here[2]),mask)){
                    o = true;
                }
                if(count(all(here[3]),mask)){
                    zz = true;
                }
                if(count(all(here[4]),mask)){
                    zo = true;
                }
            }

            if(zz and zo){
                z = true;
            }

            if(!z or !o){
                ok = false;
            }
        }

        if(ok){
            rep1(j,6){
                final_here[j] = here[j];
            }
        }

        return;
    }

    if(i != 2){
        rep(mask,8){
            if(take_mask&(1<<mask)) conts;
            here[i].pb(mask);
            go(i+1,take_mask|(1<<mask));
            here[i].pop_back();
        }   
    }
    else{
        rep(mask1,8){
            rep(mask2,8){
                if(take_mask&(1<<mask1)) conts;
                if(take_mask&(1<<mask2)) conts;
                here[i].pb(mask1);
                here[i].pb(mask2);
                go(i+1,take_mask|(1<<mask1)|(1<<mask2));
                here[i].pop_back();
                here[i].pop_back();
            }
        }
    }
}

const int B = 60;

long long Bruno( int n, int a[] ){
    go(1,1);
    rep1(j,6) here[j] = final_here[j];

    vector<int> bits[8];
    rep1(i,6){
        int x = 0;
        if(i <= 2){
            x = i-1;
            trav(j,here[i]){
                bits[j].pb(x);
            }
        }
        else{
            x = i-3;
            trav(j,here[i]){
                bits[j].pb((x&2)>0);
                bits[j].pb(x&1);
            }
        }
    }

    vector<int> b;

    for(int i = 0; i < n; i += 3){
        int mask = 0;
        for(int j = i; j < i+3; ++j){
            mask = mask<<1|a[j];
        }

        trav(bit,bits[mask]){
            b.pb(bit);
        }
    }

    ll ans = 0;
    rep(i,B){
        ans = ans<<1|b[i];
    }    

    return ans;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 2776 KB Output is correct - L* = 40
2 Correct 22 ms 2720 KB Output is correct - L* = 40
3 Correct 22 ms 2772 KB Output is correct - L* = 40
4 Correct 24 ms 2772 KB Output is correct - L* = 40
5 Correct 31 ms 2768 KB Output is correct - L* = 40
6 Correct 23 ms 2776 KB Output is correct - L* = 40
7 Correct 24 ms 2776 KB Output is correct - L* = 40
8 Correct 25 ms 2796 KB Output is correct - L* = 40
9 Correct 22 ms 2752 KB Output is correct - L* = 40
10 Correct 26 ms 2588 KB Output is correct - L* = 40
11 Correct 26 ms 2688 KB Output is correct - L* = 40
12 Correct 23 ms 2772 KB Output is correct - L* = 40
13 Correct 26 ms 2772 KB Output is correct - L* = 40
14 Correct 26 ms 2748 KB Output is correct - L* = 40
15 Correct 23 ms 2772 KB Output is correct - L* = 40
16 Correct 24 ms 2768 KB Output is correct - L* = 40
17 Correct 25 ms 2768 KB Output is correct - L* = 40
18 Correct 26 ms 2744 KB Output is correct - L* = 40
19 Correct 22 ms 2776 KB Output is correct - L* = 40
20 Correct 23 ms 2776 KB Output is correct - L* = 40
21 Correct 22 ms 2808 KB Output is correct - L* = 40
22 Correct 22 ms 2860 KB Output is correct - L* = 40
23 Correct 23 ms 2844 KB Output is correct - L* = 40
24 Correct 25 ms 2772 KB Output is correct - L* = 40
25 Correct 23 ms 2836 KB Output is correct - L* = 40
26 Correct 24 ms 2768 KB Output is correct - L* = 40
27 Correct 24 ms 2804 KB Output is correct - L* = 40
28 Correct 27 ms 2836 KB Output is correct - L* = 40
29 Correct 22 ms 2748 KB Output is correct - L* = 40
30 Correct 30 ms 2808 KB Output is correct - L* = 40
31 Correct 22 ms 2748 KB Output is correct - L* = 40
32 Correct 22 ms 2784 KB Output is correct - L* = 40
33 Correct 23 ms 2764 KB Output is correct - L* = 40
34 Correct 24 ms 2748 KB Output is correct - L* = 40
35 Correct 23 ms 2780 KB Output is correct - L* = 40
36 Correct 23 ms 2752 KB Output is correct - L* = 40
37 Correct 22 ms 2880 KB Output is correct - L* = 40
38 Correct 23 ms 2772 KB Output is correct - L* = 40
39 Correct 22 ms 2768 KB Output is correct - L* = 40
40 Correct 22 ms 2752 KB Output is correct - L* = 40