#include "gift.h" #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; #define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> #define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update> #define pii pair <int, int> #define tiii tuple <int, int, int> #define tiiii tuple <int, int, int, int> #define emb emplace_back #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define iShowSpeed cin.tie(NULL)->sync_with_stdio(false) #define matrix vector <vector <int>> #define mat(n, m) vector <vector <int>> (n, vector <int> (m)); const int mod = 1e9 + 7; const int inf = 1e9; const matrix II = {{1, 0}, {0, 1}}; const int N = 5e5 + 5; int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x) { string s = ""; for (int i = 0; i < r; i++) if (a[i] == b[i]) return 0; for (int i = 0; i < r; i++) { if (i % 2) s += "R"; else s += "B"; } craft(s); return 1; } /* sub 1: x[i] = 1 just output all "R" sub 2: x[i] = 2 if (a[i] = b[i]) : return 0; else return alternating sequence sub 3: 1 <= n,r <= 18 sub 4: 1 <= n,r <= 2000 sub 5: full sol */