Submission #61010397

---

Source Code Expand

// LUOGU_RID: 195646990
#include <bits/stdc++.h>
using namespace std;
string standard[20][27][110] = {
{{
"...........########...........",
".........############.........",
".......################.......",
"......##################......",
".....####################.....",
"....######################....",
"...########################...",
"...##########....##########...",
"..#########........#########..",
"..########..........########..",
".#########..........#########.",
".########............########.",
".########............########.",
".########............########.",
"########..............########",
"########..............########",
"########..............########",
"########..............########",
"########..............########",
"########..............########",
"########..............########",
"########..............########",
"########..............########",
"########..............########",
"########..............########",
".########............########.",
".########............########.",
".########............########.",
".#########..........#########.",
"..########..........########..",
"..#########........#########..",
"...##########....##########...",
"...########################...",
"....######################....",
".....####################.....",
"......##################......",
".......################.......",
".........############.........",
"...........########...........",
}},
{{
".............####..........",
"...........#######.........",
"........##########.........",
".....#############.........",
"..################.........",
".#################.........",
".#################.........",
".#################.........",
".#################.........",
"..######..########.........",
"..###.....########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
"..........########.........",
".##########################",
"###########################",
"###########################",
"###########################",
"###########################",
".##########################",
}},
{{
".........#########..........",
"......##############........",
"...###################......",
"..#####################.....",
".#######################....",
".#######################....",
".########################...",
".#########......#########...",
".#######.........#########..",
".#######..........########..",
".#######..........########..",
".#######..........########..",
".#######..........########..",
"..######..........########..",
".................#########..",
".................########...",
"................#########...",
"...............##########...",
"..............##########....",
".............###########....",
"............###########.....",
"...........###########......",
"..........###########.......",
".........###########........",
"........###########.........",
".......###########..........",
"......###########.....#####.",
".....###########.....#######",
"....###########......#######",
"...###########.......#######",
"..###########........#######",
".###########.........#######",
"############################",
"############################",
"############################",
"############################",
"############################",
".###########################",
}},
{{
".........##########.........",
".....################.......",
"...####################.....",
"..######################....",
"..#######################...",
"..########################..",
"..########################..",
"..########.......##########.",
"..#######.........#########.",
"..#######..........########.",
"..#######..........########.",
"...######..........########.",
"...................########.",
"...................########.",
"..................########..",
".................#########..",
"..........###############...",
".........###############....",
".........##############.....",
".........###############....",
".........################...",
"..........################..",
".................##########.",
"...................########.",
"...................#########",
"....................########",
"....................########",
"....................########",
"....................########",
"...................#########",
"..###.............##########",
".########........##########.",
".##########################.",
".#########################..",
"##########################..",
".########################...",
".######################.....",
"....#################.......",
".......###########..........",
}},
{{
".................#####........",
"................#######.......",
"...............########.......",
"..............#########.......",
".............##########.......",
"............###########.......",
"............###########.......",
"...........############.......",
"..........#############.......",
".........##############.......",
"........###############.......",
".......################.......",
".......########.#######.......",
"......########..#######.......",
".....########...#######.......",
"....########....#######.......",
"...#########....#######.......",
"...########.....#######.......",
"..########......#######.......",
".########.......#######.......",
"##############################",
"##############################",
"##############################",
"##############################",
"##############################",
"##############################",
"...............########.......",
"...............########.......",
"...............########.......",
"...............########.......",
"...............########.......",
"...............########.......",
".........####################.",
"........#####################.",
"........#####################.",
"........#####################.",
"........#####################.",
".........####################.",
}},
{{
"...######################...",
"...#######################..",
"...#######################..",
"...#######################..",
"...#######################..",
"...######################...",
"...#######..................",
"...#######..................",
"...#######..................",
"...#######..................",
"...#######..................",
"...#######..................",
"..########..########........",
"..####################......",
"..######################....",
"..#######################...",
"..########################..",
"..########################..",
"..#########################.",
"..########.......##########.",
".....##...........#########.",
"...................#########",
"....................########",
"....................########",
"....................########",
"....................########",
"....................########",
"....................########",
"...#...............#########",
"..####............#########.",
".########.......###########.",
".##########################.",
".#########################..",
"#########################...",
".#######################....",
"..#####################.....",
"....#################.......",
"........##########..........",
}},
{{
"....................######...",
"...............###########...",
"............###############..",
"..........#################..",
"........###################..",
".......####################..",
"......####################...",
".....################........",
"....############.............",
"...###########...............",
"...#########.................",
"..#########..................",
"..########...................",
".########....................",
".########....................",
".#######....########.........",
".#######..#############......",
"#########################....",
"##########################...",
"###########################..",
"###########################..",
"############......##########.",
"##########.........#########.",
"#########...........#########",
"########.............########",
"########.............########",
"########.............########",
".#######.............########",
".#######.............########",
".########...........#########",
".#########.........#########.",
"..##########.....###########.",
"...#########################.",
"...########################..",
"....######################...",
".....####################....",
"......##################.....",
"........##############.......",
"...........########..........",
}},
{{
"###########################.",
"############################",
"############################",
"############################",
"############################",
"###########################.",
"#######...........#########.",
"#######...........#########.",
"#######..........#########..",
"#######..........#########..",
"#######..........########...",
"#######.........#########...",
"#######.........########....",
"#######........#########....",
".#####.........#########....",
"...............########.....",
"..............#########.....",
"..............########......",
".............#########......",
".............########.......",
"............#########.......",
"............#########.......",
"............########........",
"...........#########........",
"...........########.........",
"..........#########.........",
"..........########..........",
"..........########..........",
".........########...........",
".........########...........",
"........#########...........",
"........########............",
"........########............",
".......########.............",
".......########.............",
".......#######..............",
".......#######..............",
".........#####..............",
}},
{{
"..........#########.........",
"........#############.......",
"......#################.....",
".....###################....",
"....#####################...",
"...#######################..",
"...#######################..",
"...#########.....#########..",
"..#########.......#########.",
"..########.........########.",
"..########.........########.",
"..########.........########.",
"..########.........########.",
"..########.........########.",
"...########.......########..",
"...#########.....#########..",
"....#####################...",
".....###################....",
"......#################.....",
"......#################.....",
"....#####################...",
"...#######################..",
"..#########......##########.",
".########..........########.",
".########..........#########",
"########............########",
"########............########",
"########............########",
"########............########",
"#########..........#########",
"#########..........#########",
".##########......##########.",
".##########################.",
"..########################..",
"..########################..",
"...######################...",
"....####################....",
"......################......",
".........##########.........",
}},
{{
".........#########..........",
".......#############........",
".....#################......",
"....###################.....",
"...#####################....",
"..#######################...",
".########################...",
".##########......#########..",
".#########........#########.",
"#########..........########.",
"########............#######.",
"########............#######.",
"########............########",
"########............########",
"########............########",
"#########..........#########",
".########.........##########",
".##########......###########",
"..##########################",
"..##########################",
"...#########################",
"....########################",
"......############..########",
"........########....#######.",
"....................#######.",
"...................########.",
"...................########.",
"..................########..",
".................#########..",
"...............##########...",
".............############...",
".........###############....",
"....###################.....",
"...###################......",
"...##################.......",
"...################.........",
"...##############...........",
"...############.............",
"....######..................",
}},
{{
"...............####..",
"..............######.",
"............########.",
"...........##########",
"..........###########",
".........############",
"........############.",
".......###########...",
"......###########....",
".....###########.....",
".....##########......",
"....##########.......",
"....#########........",
"...#########.........",
"...########..........",
"..#########..........",
"..########...........",
".#########...........",
".########............",
".########............",
".########............",
"#########............",
"########.............",
"########.............",
"########.............",
"########.............",
"########.............",
"########.............",
"########.............",
"########.............",
"########.............",
"########.............",
".########............",
".########............",
".########............",
".#########...........",
"..########...........",
"..#########..........",
"..#########..........",
"...#########.........",
"...##########........",
"....#########........",
".....#########.......",
".....##########......",
"......###########....",
".......###########...",
"........###########..",
".........############",
"..........###########",
"...........##########",
"............#########",
".............#######.",
"...............####..",
".................#...",
}},
{{
"..####...............",
".######..............",
"#########............",
"##########...........",
"###########..........",
"############.........",
".############........",
"...###########.......",
"....###########......",
".....##########......",
"......##########.....",
".......##########....",
"........#########....",
".........#########...",
"..........########...",
"..........#########..",
"...........########..",
"...........#########.",
"............########.",
"............########.",
"............########.",
"............#########",
".............########",
".............########",
".............########",
".............########",
".............########",
".............########",
".............########",
".............########",
".............########",
".............########",
"............########.",
"............########.",
"............########.",
"...........#########.",
"...........########..",
"..........#########..",
"..........#########..",
".........#########...",
"........##########...",
".......##########....",
".......#########.....",
".....###########.....",
"....###########......",
"...###########.......",
"..###########........",
"############.........",
"###########..........",
"##########...........",
"#########............",
".#######.............",
"..####...............",
"...#.................",
}},
{{
"...........#####...........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"###########################",
"###########################",
"###########################",
"###########################",
"###########################",
"###########################",
"###########################",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"..........#######..........",
"...........#####...........",
}},
{{
".##########################.",
"############################",
"############################",
"############################",
"############################",
"############################",
".###########################",
}},
{{
"...........####...........",
"..........######..........",
"..........#######.........",
".........########.........",
".........########.........",
"..........#######.........",
"..........######..........",
".#####....######.....####.",
".######...######...#######",
"#########..#####.#########",
"###############.##########",
"##########################",
"##########################",
".########################.",
"......##############......",
".........########.........",
"........###########.......",
".......#############......",
".....########.#######.....",
"....########..########....",
"....########..#########...",
"...########....########...",
"...########....########...",
"....#######.....#######...",
".....#####......######....",
"......###.........##......",
}},
{{
"......................####..",
"......................######",
".....................#######",
".....................#######",
"....................########",
"....................#######.",
"...................########.",
"...................#######..",
"..................########..",
"..................#######...",
".................########...",
".................#######....",
"................########....",
"................########....",
"................#######.....",
"...............########.....",
"...............#######......",
"..............########......",
"..............#######.......",
".............########.......",
".............#######........",
"............########........",
"............#######.........",
"...........########.........",
"...........#######..........",
"..........########..........",
"..........#######...........",
"..........#######...........",
".........########...........",
".........#######............",
"........########............",
"........#######.............",
".......########.............",
".......#######..............",
"......########..............",
"......#######...............",
".....########...............",
".....#######................",
"....########................",
"....#######.................",
"...########.................",
"...########.................",
"...#######..................",
"..########..................",
"..#######...................",
".########...................",
".#######....................",
"########....................",
"#######.....................",
".######.....................",
"..#####.....................",
}}};
// below part by BLX32M_10
#define int long long

int t, w, h; // 65*38
int sz[][27] = {{39}, {38}, {38}, {39}, {38}, {38}, {39}, {38}, {39}, {39}, {54}, {54}, {28}, {7}, {26}, {51}};
char mp[] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '(', ')', '+', '-', '*', '/'};
#define mkp make_pair
string s[70];
int vis[70][9005];
const int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
namespace NoiseReduction
{
inline int BFSBlock(char tp, int x, int y, int g)
{
queue <pair <int, int> > q;
q.push(mkp(x, y));
vis[x][y] = g + 1;
int res = 0;
while (!q.empty())
{
res++;
int x = q.front().first, y = q.front().second;
q.pop();
for (int i = 0; i < 4; i++)
{
int nx = x + dx[i], ny = y + dy[i];
if (nx >= 0 && nx < h && ny >= 0 && ny < w && vis[nx][ny] == g && s[nx][ny] == tp)
q.push(mkp(nx, ny)), vis[nx][ny] = g + 1;
}
if (g == 1)
s[x][y] = (s[x][y] == '.' ? '#' : '.');
}
return res;
}
inline void Brush(int vx, int vy)
{
int sx = (vx == 1 ? 0 : h - 1), ex = (vx == 1 ? h - 1 : 0);
int sy = (vy == 1 ? 0 : w - 1), ey = (vy == 1 ? w - 1 : 0);
#define rep(i, x, y) for (int i = x; (x <= y ? i <= y : i >= y); (x <= y ? i++ : i--))
if (vx != 0)
rep(i, sx, ex)
{
rep(j, sy, ey)
{
if (s[i][j] == '#')
{
int nn = 0;
for (int k = 0; k < 4; k++)
{
int x = i + dx[k], y = j + dy[k];
if (x < 0 || x >= h || y < 0 || y >= w)
nn++;
else
nn += (s[x][y] == '.');
}
if (nn >= 3)
s[i][j] = '.';
}
}
}
else
rep(j, sy, ey)
{
rep(i, sx, ex)
{
if (s[i][j] == '#')
{
int nn = 0;
for (int k = 0; k < 4; k++)
{
int x = i + dx[k], y = j + dy[k];
if (x < 0 || x >= h || y < 0 || y >= w)
nn++;
else
nn += (s[x][y] == '.');
}
if (nn == 3)
s[i][j] = '.';
}
}
}
}
inline void SharpRemove()
{
Brush(0, 1);
Brush(0, -1);
Brush(-1, 0);
Brush(1, 0);
}
signed main()
{
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
if (!vis[i][j])
{
if (BFSBlock(s[i][j], i, j, 0) <= 15)
{
BFSBlock(s[i][j], i, j, 1);
}
}
}
}
SharpRemove();
return 0;
}
}
namespace PreprocessPic
{
// 4 5 6 7 8 10 12 14 18
const int TAN[] = {3, 4, 5, 6, 7, 8, 9,10, 12, 14, 16, 18}, SZ = 12;
signed main()
{
for (int i = 0; i < 16; i++)
{
int cur = 1;
for (int j = 0; j < SZ * 2; j++)
{
for (int x = 0; x < sz[i][0]; x++)
{
standard[i][cur][x] = standard[i][0][x];
standard[i][cur][x].resize(100, '.');
// for (int xx = 0; xx < 50; xx++)
//     standard[i][cur][x] += '.';
}
for (int x = sz[i][0]; x <= 50 + sz[i][0]; x++)
{
standard[i][cur][x].resize(100, '.');
}
sz[i][cur] = sz[i][0] + 50;
if (j < SZ)
{
string ss = "";
for (int x = 1; x < sz[i][cur]; x++)
{
if (x % TAN[j % SZ] == 0)
ss += '.';
standard[i][cur][x] = ss + standard[i][cur][x];
standard[i][cur][x] = standard[i][cur][x].substr(0, standard[i][cur][0].size());
}
int cc = 0;
for (int y = standard[i][cur][0].size() - 1; y >= 0; y--)
{
if (y % TAN[j % SZ] == 0)
cc++;
for (int x = sz[i][cur] - 1; x >= 0; x--)
{
if (x - cc < 0)
standard[i][cur][x][y] = '.';
else
standard[i][cur][x][y] = standard[i][cur][x - cc][y];
}
}
}
else
{
// printf("now:%lld end:%lld\n", j, SZ * 2);
string ss = "";
for (int x = sz[i][cur] - 1; x >= 0; x--)
{
// standard[i][cur][x].resize(100, '.');
if (x % TAN[j % SZ] == 0)
ss += '.';
standard[i][cur][x] = ss + standard[i][cur][x];
standard[i][cur][x] = standard[i][cur][x].substr(0, standard[i][cur][0].size());
}
int cc = 0;
for (int y = 0; y < standard[i][cur][1].size(); y++)
{
if (y % TAN[j % SZ] == 0)
cc++;
// printf("%lld\n", cc);
for (int x = sz[i][cur] - 1; x >= 0; x--)
{
// printf("(%lld, %lld)\n", x, y);
if (x - cc < 0)
standard[i][cur][x][y] = '.';
else
standard[i][cur][x][y] = standard[i][cur][x - cc][y];
}
}
}
int cc = 0;
for (int x = 0; x < sz[i][cur]; x++)
{
if (standard[i][cur][x].find('#') == string :: npos)
cc++;
else
break;
}
for (int x = 0; x < sz[i][cur]; x++)
{
if (x + cc < sz[i][cur])
standard[i][cur][x] = standard[i][cur][x + cc];
else
standard[i][cur][x].clear(), standard[i][cur][x].resize(80, '.');
}
for (int x = 0; x < sz[i][cur]; x++)
{
if (standard[i][cur][x].find('#') == string :: npos)
{
sz[i][cur] = x;
break;
}
}
int lw = 0, lg = 10000;
for (int y = 0; y < standard[i][cur][1].size(); y++)
{
bool b = 1;
for (int x = 0; x < sz[i][cur]; x++)
{
if (standard[i][cur][x][y] == '#')
{
b = 0;
break;
}
}
if (!b)
{
lw = y;
break;
}
}
for (int y = lw + 1; y < standard[i][cur][1].size(); y++)
{
bool b = 1;
for (int x = 0; x < sz[i][cur]; x++)
{
if (standard[i][cur][x][y] == '#')
{
b = 0;
break;
}
}
if (b)
{
lg = y - lw;
break;
}
}
for (int x = 0; x < sz[i][cur]; x++)
standard[i][cur][x] = standard[i][cur][x].substr(lw, lg);
// if (i == 13)
// {
// for (int x = 0; x < sz[i][cur]; x++)
// {
//     cout << standard[i][cur][x] << endl;
// }
// cout << endl;
// }
cur++;
}
}
return 0;
}
}
string res;
namespace Match
{
#define ppp pair <pair <int, int>, pair <int, int> >
inline ppp find(int x, int y)
{
vis[x][y] = 1;
ppp p = make_pair(make_pair(x, y), make_pair(x, y));
for (int d = 0; d < 4; d++)
{
int nx = x + dx[d], ny = y + dy[d];
if (nx >= 0 && ny >= 0 && nx < h && ny < w && !vis[nx][ny] && s[nx][ny] == '#')
{
ppp cur = find(nx, ny);
p.first.first = min(p.first.first, cur.first.first);
p.first.second = min(p.first.second, cur.first.second);
p.second.first = max(p.second.first, cur.second.first);
p.second.second = max(p.second.second, cur.second.second);
}
}
return p;
}
// #define map unordered_map
inline map <char, long double> match(int x1, int y1, int x2, int y2)
{
map <char, long double> res;
for (int i = 0; i < 16; i++)
{
for (int xx = 0; xx < PreprocessPic::SZ * 2; xx++)
{
int h = sz[i][xx], w = standard[i][xx][0].size();
int mc = (x2 - x1 + 1) * (y2 - y1 + 1);
double x = 1.0 * (x2 - x1 + 1) / (y2 - y1 + 1), y = 1.0 * h / w;
double l = min(x, y) / max(x, y);
if (l <= 0.35)
continue;
for (int x = x1; x <= x2; x++)
{
for (int y = y1; y <= y2; y++)
{
if (s[x][y] != standard[i][xx][(int)((x - x1) * 1.0 / (x2 - x1) * h)][(int)((y - y1) * 1.0 / (y2 - y1) * w)])
{
mc--;
}
}
}
res[mp[i]] = max(res[mp[i]], mc * (long double)1.0 / (x2 - x1 + 1) / (y2 - y1 + 1));
}
}
return res;
}
signed main()
{
memset(vis, 0, sizeof vis);
for (int j = 0; j < w; j++)
{
for (int i = 0; i < h; i++)
{
if (s[i][j] == '#' && !vis[i][j])
{
// printf("%ld block:\n", res.size() + 1);
ppp p = find(i, j);
map <char, long double> mp = match(p.first.first, p.first.second, p.second.first, p.second.second);
pair <char, long double> pp = make_pair('?', 0);
for (auto p : mp)
{
if (p.second > pp.second)
{
if (res.size() > 0 && (res[res.size() - 1] < '0' || res[res.size() - 1] > '9') && res[res.size() - 1] != ')' && (p.first == '+' || p.first == '-' || p.first == '*' || p.first == '/' || p.first == ')'))
continue;
if (res.size() > 0 && (res[res.size() - 1] >= '0' && res[res.size() - 1] <= '9') && !(p.first == '+' || p.first == '-' || p.first == '*' || p.first == '/' || p.first == ')'))
continue;
pp = p;
// printf("%c:%.2Lf%%\n", p.first, p.second * 100);
}
}
// printf("RES:%c\n", pp.first);
res.push_back(pp.first);
if (pp.first == '?')
{
while(1);
}
}
}
}
// cout << res << endl;
return 0;
}
}
namespace Print
{
signed main()
{
for (int  i = 0; i < h; i++)
{
cout << s[i] << endl;
}
return 0;
}
}
namespace Calculate
{
string bk;
inline void build() // Strong building postfix notation without dfs.
{
bk.clear();
stack <char> st;
for (char c : res)
{
if (c >= '0' && c <= '9')
bk.push_back(c);
else if (c == '(')
st.push('(');
else if (c == ')')
{
while (!st.empty() && st.top() != '(')
bk.push_back(st.top()), st.pop();
st.pop();
}
else if (c == '*' || c == '/')
{
while (!st.empty() && (st.top() == '*' || st.top() == '/'))
bk.push_back(st.top()), st.pop();
st.push(c);
}
else if (c == '+' || c == '-')
{
while (!st.empty() && st.top() != '(')
bk.push_back(st.top()), st.pop();
st.push(c);
}
}
while (!st.empty())
bk.push_back(st.top()), st.pop();
}
stack <int> st;
inline pair <int, int> gettop()
{
int a = st.top(), b;
st.pop();
b = st.top();
st.pop();
return make_pair(b, a);
}
inline int calc()
{
for (char c : bk)
{
if (c >= '0' && c <= '9')
st.push(c - '0');
else
{
pair <int, int> p = gettop();
if (c == '+')
st.push(p.first + p.second);
if (c == '-')
st.push(p.first - p.second);
if (c == '*')
st.push(p.first * p.second);
if (c == '/')
st.push(p.first / p.second);
}
}
return st.top();
}
}
signed main()
{
// freopen("pic.in", "r", stdin);
// freopen("pic.out", "w", stdout);
PreprocessPic::main();
scanf("%lld %lld %lld", &t, &w, &h);
for (int i = 0; i < h; i++)
{
cin >> s[i];
}
NoiseReduction::main();
// Print::main();
Match::main();
// cout << res << endl;
int c0 = 0, c1 = 0;
for (char c : res)
{
if (c == ')')
c1++;
else if (c == '(')
c0++;
}
if (c1 > c0)
{
int cnt = 0;
for (int i = 0; i < res.size(); i++)
{
if (res[i] == '/')
{
cnt++;
if (cnt == 2)
{
res[i] = '(';
break;
}
}
}
}
Calculate::build();
printf("%lld\n", Calculate::calc());
return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘int PreprocessPic::main()’:
Main.cpp:810:19: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  810 | for (int y = 0; y < standard[i][cur][1].size(); y++)
      |                 ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:849:19: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  849 | for (int y = 0; y < standard[i][cur][1].size(); y++)
      |                 ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:866:24: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  866 | for (int y = lw + 1; y < standard[i][cur][1].size(); y++)
      |                      ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function ‘int main()’:
Main.cpp:1090:19: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
 1090 | for (int i = 0; i < res.size(); i++)
      |                 ~~^~~~~~~~~~~~
Main.cpp:1070:6: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
 1070 | scanf("%lld %lld %lld", &t, &w, &h);
      | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Judge Result