Main.cpp: In function 'std::string to_string(std::string, int, int)':
Main.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
| ~~~^~~~~~~~~~
Main.cpp: In function 'void solve()':
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
| ^
Main.cpp:100:5: note: in expansion of macro 'REP'
100 | REP(i,n+5) REP(j,2) REP(k,2) REP(l,2) REP(g,2) dp[i][j][k][l][g] = -1ll;
| ^~~
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
| ^
Main.cpp:100:16: note: in expansion of macro 'REP'
100 | REP(i,n+5) REP(j,2) REP(k,2) REP(l,2) REP(g,2) dp[i][j][k][l][g] = -1ll;
| ^~~
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
| ^
Main.cpp:100:25: note: in expansion of macro 'REP'
100 | REP(i,n+5) REP(j,2) REP(k,2) REP(l,2) REP(g,2) dp[i][j][k][l][g] = -1ll;
| ^~~
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'l' [-Wparentheses]
14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
| ^
Main.cpp:100:34: note: in expansion of macro 'REP'
100 | REP(i,n+5) REP(j,2) REP(k,2) REP(l,2) REP(g,2) dp[i][j][k][l][g] = -1ll;
| ^~~
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'g' [-Wparentheses]
14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
| ^
Main.cpp:100:43: note: in expansion of macro 'REP'
100 | REP(i,n+5) REP(j,2) REP(k,2) REP(l,2) REP(g,2) dp[i][j][k][l][g] = -1ll;
| ^~~