Submission #568257

#	Time	Username	Problem	Language	Result	Execution time	Memory
568257		maomao90	Broken Device 2 (JOI22_device2)	C++17	0 / 100	240 ms	10212 KiB

Anna

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "Anna.h"
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

namespace {
    const int LEN = 10;
    ll a;
    vi s, t;
}

int Declare() {
    return 2000;
}

pair<vi, vi> Anna(ll A) {
    s.clear(); t.clear();
    a = A;
    a <<= 1;
    int lg = 63 - __builtin_clzll(a);
    cerr << a << ' ' << lg << '\n';
    REP (i, 0, lg + 1) {
        if (a >> i & 1) {
            REP (z, 0, LEN - 1) {
                s.pb(0);
            }
            s.pb(1);
            t.pb(1);
            REP (z, 0, LEN - 1) {
                t.pb(0);
            }
        } else {
            s.pb(1);
            REP (z, 0, LEN - 1) {
                s.pb(0);
            }
            REP (z, 0, LEN - 1) {
                t.pb(0);
            }
            t.pb(1);
        }
    }
    cerr << bitset<7>(a) << '\n';
    for (int i : s) {
        cerr << i;
    }
    cerr << '\n';
    for (int i : t) {
        cerr << i;
    }
    cerr << '\n';
    return {s, t};
}

Bruno

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "Bruno.h"
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

namespace {
    const int LEN = 10;
}

ll Bruno(vi u) {
    for (int i : u) {
        cerr << i;
    }
    cerr << '\n';
    int lg = u.size() / 2 / LEN - 1;
    cerr << lg << '\n';
    ll ans = 0;
    int p = 0;
    REP (i, 1, lg + 1) {
        int sm = 0;
        REP (j, i * LEN, (i + 1) * LEN) {
            sm += u[j];
        }
        if (sm != 1) {
            p ^= 1;
            ans |= (ll) p << i;
        }
    }
    cerr << bitset<7>(ans) << '\n';
    ans >>= 1;
    cerr << ans << '\n';
    return ans; 
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 3
• Subtask 4: 0 / 12
• Subtask 5: 0 / 15
• Subtask 6: 0 / 60