# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
568275 | maomao90 | Broken Device 2 (JOI22_device2) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// 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 = 90;
ll a;
vi s, t;
}
int Declare() {
return 2000;
}
pair<vi, vi> Anna(ll A) {
s.clear(); t.clear();
a = A;
int lg = 63 - __builtin_clzll(a);
cerr << a << ' ' << lg << '\n';
REP (i, 0, lg + 1) {
REP (z, 0, LEN) {
s.pb((a >> i & 1) && (z == LEN - 1));
t.pb(0);
}
}
cerr << bitset<7>(a) << '\n';
for (int i : s) {
cerr << i;
}
cerr << '\n';
for (int i : t) {
cerr << i;
}
cerr << '\n';
return {s, t};
}