#include "registers.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
tcT> using PR = pair<T,T>;
// pairs
#define mp make_pair
#define f first
#define s second
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front
#define rtn return
#define lb lower_bound
#define ub upper_bound
tcT> int lwb(V<T>& a, const T& b) { return int(lb(all(a),b)-bg(a)); }
// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
// bitwise ops
// also see https://gcc.gnu.org/onlinedocs/gcc/Other-Builtins.html
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { // assert(x >= 0); // make C++11 compatible until USACO updates ...
return x == 0 ? 0 : 31-__builtin_clz(x); } // floor(log2(x))
constexpr int p2(int x) { return 1<<x; }
constexpr int msk2(int x) { return p2(x)-1; }
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
tcT> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; }
tcTU> T fstTrue(T lo, T hi, U f) {
hi ++; assert(lo <= hi); // assuming f is increasing
while (lo < hi) { // find first index such that f is true
T mid = lo+(hi-lo)/2;
f(mid) ? hi = mid : lo = mid+1;
}
return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
lo --; assert(lo <= hi); // assuming f is decreasing
while (lo < hi) { // find first index such that f is true
T mid = lo+(hi-lo+1)/2;
f(mid) ? lo = mid : hi = mid-1;
}
return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
auto it = t.find(u); assert(it != end(t));
t.erase(it); } // element that doesn't exist from (multi)set
#define tcTUU tcT, class ...U
inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void> struct is_iterable : false_type {};
tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
decltype(end(declval<T>()))
>
> : true_type {};
tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
//////////// is_readable
tcT, class = void> struct is_readable : false_type {};
tcT> struct is_readable<T,
typename std::enable_if_t<
is_same_v<decltype(cin >> declval<T&>()), istream&>
>
> : true_type {};
tcT> constexpr bool is_readable_v = is_readable<T>::value;
//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void> struct is_printable : false_type {};
tcT> struct is_printable<T,
typename std::enable_if_t<
is_same_v<decltype(cout << declval<T>()), ostream&>
>
> : true_type {};
tcT> constexpr bool is_printable_v = is_printable<T>::value;
}
inline namespace Input {
tcT> constexpr bool needs_input_v = !is_readable_v<T> && is_iterable_v<T>;
tcTUU> void re(T& t, U&... u);
tcTU> void re(pair<T,U>& p); // pairs
// re: read
tcT> typename enable_if<is_readable_v<T>,void>::type re(T& x) { cin >> x; } // default
tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; } // complex
tcT> typename enable_if<needs_input_v<T>,void>::type re(T& i); // ex. vectors, arrays
tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
tcT> typename enable_if<needs_input_v<T>,void>::type re(T& i) {
each(x,i) re(x); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); } // read multiple
// rv: resize and read vectors
void rv(size_t) {}
tcTUU> void rv(size_t N, V<T>& t, U&... u);
template<class...U> void rv(size_t, size_t N2, U&... u);
tcTUU> void rv(size_t N, V<T>& t, U&... u) {
t.rsz(N); re(t);
rv(N,u...); }
template<class...U> void rv(size_t, size_t N2, U&... u) {
rv(N2,u...); }
// dumb shortcuts to read in ints
void decrement() {} // subtract one from each
tcTUU> void decrement(T& t, U&... u) { --t; decrement(u...); }
#define ints(...) int __VA_ARGS__; re(__VA_ARGS__);
#define int1(...) ints(__VA_ARGS__); decrement(__VA_ARGS__);
}
inline namespace ToString {
tcT> constexpr bool needs_output_v = !is_printable_v<T> && is_iterable_v<T>;
// ts: string representation to print
tcT> typename enable_if<is_printable_v<T>,str>::type ts(T v) {
stringstream ss; ss << fixed << setprecision(15) << v;
return ss.str(); } // default
tcT> str bit_vec(T t) { // bit vector to string
str res = "{"; F0R(i,sz(t)) res += ts(t[i]);
res += "}"; return res; }
str ts(V<bool> v) { return bit_vec(v); }
template<size_t SZ> str ts(bitset<SZ> b) { return bit_vec(b); } // bit vector
tcTU> str ts(pair<T,U> p); // pairs
tcT> typename enable_if<needs_output_v<T>,str>::type ts(T v); // vectors, arrays
tcTU> str ts(pair<T,U> p) { return "("+ts(p.f)+", "+ts(p.s)+")"; }
tcT> typename enable_if<is_iterable_v<T>,str>::type ts_sep(T v, str sep) {
// convert container to string w/ separator sep
bool fst = 1; str res = "";
for (const auto& x: v) {
if (!fst) res += sep;
fst = 0; res += ts(x);
}
return res;
}
tcT> typename enable_if<needs_output_v<T>,str>::type ts(T v) {
return "{"+ts_sep(v,", ")+"}"; }
// for nested DS
template<int, class T> typename enable_if<!needs_output_v<T>,vs>::type
ts_lev(const T& v) { return {ts(v)}; }
template<int lev, class T> typename enable_if<needs_output_v<T>,vs>::type
ts_lev(const T& v) {
if (lev == 0 || !sz(v)) return {ts(v)};
vs res;
for (const auto& t: v) {
if (sz(res)) res.bk += ",";
vs tmp = ts_lev<lev-1>(t);
res.ins(end(res),all(tmp));
}
F0R(i,sz(res)) {
str bef = " "; if (i == 0) bef = "{";
res[i] = bef+res[i];
}
res.bk += "}";
return res;
}
}
inline namespace Output {
template<class T> void pr_sep(ostream& os, str, const T& t) { os << ts(t); }
template<class T, class... U> void pr_sep(ostream& os, str sep, const T& t, const U&... u) {
pr_sep(os,sep,t); os << sep; pr_sep(os,sep,u...); }
// print w/ no spaces
template<class ...T> void pr(const T&... t) { pr_sep(cout,"",t...); }
// print w/ spaces, end with newline
void ps() { cout << "\n"; }
template<class ...T> void ps(const T&... t) { pr_sep(cout," ",t...); ps(); }
// debug to cerr
template<class ...T> void dbg_out(const T&... t) {
pr_sep(cerr," | ",t...); cerr << endl; }
void loc_info(int line, str names) {
cerr << "Line(" << line << ") -> [" << names << "]: "; }
template<int lev, class T> void dbgl_out(const T& t) {
cerr << "\n\n" << ts_sep(ts_lev<lev>(t),"\n") << "\n" << endl; }
#ifdef LOCAL
#define dbg(...) loc_info(__LINE__,#__VA_ARGS__), dbg_out(__VA_ARGS__)
#define dbgl(lev,x) loc_info(__LINE__,#x), dbgl_out<lev>(x)
#else // don't actually submit with this
#define dbg(...) 0
#define dbgl(lev,x) 0
#endif
}
inline namespace FileIO {
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void setIO(str s = "") {
cin.tie(0)->sync_with_stdio(0); // unsync C / C++ I/O streams
// cin.exceptions(cin.failbit);
// throws exception when do smth illegal
// ex. try to read letter into int
if (sz(s)) setIn(s+".in"), setOut(s+".out"); // for old USACO
}
}
// queue<int> avail;
// vb active;
// void del(int x) {
// assert(active[x]);
// active[x] = 0;
// avail.push(x);
// }
// int op_left() {
// }
void init_bits(int t, vi bits) {
vb v(2000);
for (int i: bits) v[i] = 1;
append_store(t, v);
}
void op_move(int t, int x) {
append_move(t,x);
}
void op_left(int t, int x, int s) {
append_left(t,x,s);
}
void op_and(int t, int x, int y) {
append_and(t,x,y);
}
void op_or(int t, int x, int y) {
append_or(t,x,y);
}
void op_xor(int t, int x, int y) {
append_xor(t,x,y);
}
void op_add(int t, int x, int y) {
append_add(t,x,y);
}
void op_not(int t, int x) {
append_not(t,x);
}
void op_right(int t, int x, int s) {
append_right(t,x,s);
}
vi num_bits(int x) {
vi ans;
F0R(i,x) ans.pb(i);
return ans;
}
void construct_instructions(int s, int n, int k, int q) {
int p = 1;
if (s == 0) {
while (p < n) p *= 2;
{
vi rel;
FOR(i,n,p) F0R(j,k) rel.pb(i*k+j);
init_bits(1,rel);
op_or(0,0,1);
n = p;
}
int tot = n*k;
vi all_bits; F0R(i,tot) all_bits.pb(i);
init_bits(20,all_bits);
init_bits(21,{0}); // one bit
for (int len = k; len < tot; len *= 2) {
vi a,b;
F0R(i,tot) {
if (i%(2*len) < len) a.pb(i);
else b.pb(i);
}
init_bits(1,a); // lower mask
// init_bits(2,b); // higher mask
op_and(3,1,0); // lower bits
op_right(4,0,len);
// op_and(4,4,1);
// op_and(4,2,0); op_right(4,4,len); // higher bits
op_not(5,4); op_and(5,5,1); // complement(higher bits)
op_add(6,3,5); // lower bits + complement(higher bits)
// len, 3*len
vi rel; for (int i = len; i < tot; i += 2*len) rel.pb(i);
init_bits(7,rel);
op_and(6,6,7);
op_right(7,6,len); // shifted right len
op_not(7,7); // subtract
op_add(6,6,7);
op_add(6,6,21); // add one
// 6: take from higher side
op_xor(7,6,20); // take from lower side
op_and(3,3,7);
op_and(4,4,6);
op_or(0,3,4);
}
} else {
p = n;
if (p&1) ++p;
{
vi rel;
FOR(i,n,p) F0R(j,k) rel.pb(i*k+j);
init_bits(1,rel);
op_or(0,0,1);
n = p;
}
int tot = n*k;
vi all_bits; F0R(i,tot) all_bits.pb(i);
init_bits(20,all_bits);
init_bits(21,{0}); // one bit
init_bits(40,num_bits(k));
append_print(0);
F0R(it,150) {
auto tran = [&]() {
int len = k;
vi a,b;
F0R(i,tot) {
if (i%(2*len) < len) a.pb(i);
else b.pb(i);
}
init_bits(1,a); // lower mask
// init_bits(2,b); // higher mask
op_and(3,1,0); // lower bits
op_right(4,0,len);
op_and(4,4,1);
// op_and(4,2,0); op_right(4,4,len); // higher bits
op_not(5,4); op_and(5,5,1); // complement(higher bits)
op_add(6,3,5); // lower bits + complement(higher bits)
// len, 3*len
vi rel; for (int i = len; i < tot; i += 2*len) rel.pb(i);
init_bits(7,rel);
op_and(6,6,7);
op_right(7,6,len); // shifted right len
op_not(7,7); // subtract
op_add(6,6,7);
op_add(6,6,21); // add one
// 6: take from higher side
op_xor(7,6,20); // 7: take from lower side
op_and(12,3,7); // lower mask
op_and(13,4,6); // higher mask
op_or(0,12,13);
// append_print(3);
// append_print(4);
// append_print(12);
// append_print(13);
op_and(8,3,6);
op_and(9,4,7);
op_or(8,8,9);
op_left(8,8,len);
op_or(0,0,8);
// append_print(8);
};
// cerr << it << endl;
if (it%2 == 0) {
tran();
} else {
assert(n == p);
op_move(50,0);
// append_print(50);
op_and(50,50,40);
op_right(0,0,k);
{
vi rel;
F0R(j,k) rel.pb((n-1)*k+j);
// assert(n == 3);
init_bits(80,rel);
op_or(0,0,80);
// append_print(80);
// append_print(0);
}
append_print(0);
tran();
append_print(0);
op_left(0,0,k);
op_and(0,0,20);
op_or(0,0,50);
}
append_print(0);
append_print(10);
}
}
// for(;n>1;n/=2) { // 7
// init_bits(3,num_bits(n/2*k));
// op_move(1,0); op_and(1,1,3); // 1: lower bits
// op_right(2,0,n/2*k); // 2: higher bits
// op_xor(3,1,2); // 3: xor difference
// auto make_sing = [&]() {
// // fix 3
// const int TEMP = 11;
// for (int i = 1; i < k; i *= 2) { // propagate to lower
// vi matter;
// F0R(j,n/2*k) if (j%k >= i) matter.pb(j);
// init_bits(10,matter);
// op_and(TEMP,3,10);
// op_right(TEMP,TEMP,i);
// op_or(3,3,TEMP);
// }
// vi matter;
// F0R(j,n/2*k) if (j%k != 0) matter.pb(j);
// init_bits(10,matter);
// op_and(TEMP,3,10);
// op_right(TEMP,TEMP,1);
// op_xor(3,3,TEMP);
// };
// make_sing(); // give some positions
// op_and(4,1,3); // 4: values of lower bits at positions given by 3
// auto fill_mask = [&]() {
// const int TEMP = 11;
// for (int i = 1; i < k; i *= 2) {
// vi matter;
// F0R(j,n/2*k) if (j%k >= i) matter.pb(j);
// init_bits(10,matter);
// op_and(TEMP,4,10);
// op_right(TEMP,TEMP,i);
// op_or(4,4,TEMP);
// }
// for (int i = 1; i < k; i *= 2) {
// vi matter;
// F0R(j,n/2*k) if (j%k < k-i) matter.pb(j);
// init_bits(10,matter);
// op_and(TEMP,4,10);
// op_left(TEMP,TEMP,i);
// op_or(4,4,TEMP);
// }
// };
// append_print(4);
// fill_mask(); // fix 4
// append_print(4);
// // 1 -> get from higher, 0 -> get from lower
// op_and(2,2,4);
// op_not(4,4);
// op_and(1,1,4);
// op_or(0,1,2);
// }
}
Compilation message
registers.cpp: In function 'void FileIO::setIn(str)':
registers.cpp:246:30: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
246 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
registers.cpp: In function 'void FileIO::setOut(str)':
registers.cpp:247:30: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
247 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
2 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
332 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
1444 KB |
Output is correct |
| 2 |
Correct |
7 ms |
1388 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
1444 KB |
Output is correct |
| 2 |
Correct |
7 ms |
1388 KB |
Output is correct |
| 3 |
Correct |
13 ms |
1408 KB |
Output is correct |
| 4 |
Correct |
8 ms |
1440 KB |
Output is correct |
| 5 |
Correct |
8 ms |
1448 KB |
Output is correct |
| 6 |
Correct |
8 ms |
1480 KB |
Output is correct |
| 7 |
Correct |
8 ms |
1448 KB |
Output is correct |
