#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 2> a2;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
ll f[301][301][301], n, m, tp, i, j, len;
vector <char> ans;
string s[301];
vector <char> bst[301][301];
bool mk[301][301][301], mkr[301][301][301];
vector <array <int, 3> > gr, v[2];
bool low(vector <char> &a, vector <char> &b)
{
for (int i = 0; i < sz(a); i++)
{
if (a[i] == b[i]) continue;
return a[i] == '(';
}
return 0;
}
queue <array <int, 3> > qr;
void solve(int i, int j, int b, int len)
{
if (mk[i][j][b]) return;
mk[i][j][b] = 1;
if (i == n - 1) return;
if (s[i][j] == '(') {b--; len--; }
if (s[i][j] == ')') {b++; len--; }
for (int a = -1; a <= 1; a++)
{
int nb = b, nlen = len, jr = j + a;
if (jr < 0 || jr == m || s[i + 1][jr] == '*') continue;
if (nb == -1) continue;
if (f[i + 1][jr][nb] == nlen) solve(i + 1, jr, nb, nlen);
}
}
void put(int il, int jl, int b, int i, int j)
{
if (s[i][j] == '*') return;
int nb = b;
if (s[i][j] == '(') nb++;
if (s[i][j] == ')') nb--;
if (mk[i][j][nb] && f[il][jl][b] + (s[i][j] != '.' ? 1 : 0) == f[i][j][nb] && !mkr[i][j][nb])
{
mkr[i][j][nb] = 1;
qr.push({i, j, nb});
}
}
int main()
{
//freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> s[i];
int sx, sy;
for (int i = 0; i < m; i++)
if (s[n - 1][i] == 'M') {sx = n - 1; sy = i; break;}
memset(f, -1, sizeof(f));
f[sx][sy][0] = 0;
ll I = -1, J, K = -1;
for (int i = n - 1; i > 0; i--)
for (int j = 0; j < m; j++)
for (int st = 0; st <= n - i - 1; st++)
{
if (f[i][j][st] == -1 || s[i][j] == '*') continue;
for (int a = -1; a <= 1; a++)
if (a + j >= 0 && a + j < m && (st != 0 || s[i - 1][j + a] != ')'))
{
ll nw = f[i][j][st], nk = st;
if (s[i - 1][j + a] == '(') {nw++; nk++;}
if (s[i - 1][j + a] == ')') {nw++; nk--;}
if (f[i - 1][j + a][nk] == -1 || f[i - 1][j + a][nk] < nw) f[i - 1][j + a][nk] = nw;
}
}
for (int i = 0; i < 301; i++)
for (int j = 0; j < 301; j++)
if (K < f[i][j][0]) {I = i; J = j; K = f[i][j][0];}
for (int i = 0; i < 301; i++)
for (int j = 0; j < 301; j++)
if (f[i][j][0] == K) solve(i, j, 0, K);
cout << K << endl;
gr.pb({sx, sy, 0});
for (int len = 0; len < K; len++)
{
v[0].clear();
v[1].clear();
for (auto pos : gr)
{
int i = pos[0], j = pos[1], b = pos[2];
for (int a = -1; a <= 1; a++)
{
int jr = j + a;
if (jr < 0 || jr == m) continue;
put(i, j, b, i - 1, jr);
}
}
while (sz(qr))
{
auto pos = qr.front(); qr.pop();
int i = pos[0], j = pos[1], b = pos[2];
if (s[i][j] == '(')
{
v[0].pb({i, j, b});
continue;
}
if (s[i][j] == ')')
{
v[1].pb({i, j, b});
continue;
}
for (int a = -1; a <= 1; a++)
{
int jr = j + a;
if (jr < 0 || jr == m) continue;
put(i, j, b, i - 1, jr);
}
}
if (sz(v[0]))
{
cout << '(';
gr = v[0];
}
else
{
cout << ')';
gr = v[1];
}
}
}
Compilation message
retro.cpp: In function 'int main()':
retro.cpp:117:8: warning: variable 'I' set but not used [-Wunused-but-set-variable]
ll I = -1, J, K = -1;
^
retro.cpp:117:16: warning: variable 'J' set but not used [-Wunused-but-set-variable]
ll I = -1, J, K = -1;
^
retro.cpp:115:18: warning: 'sx' may be used uninitialized in this function [-Wmaybe-uninitialized]
f[sx][sy][0] = 0;
~~~~~~~~~~~~~^~~
retro.cpp:115:18: warning: 'sy' may be used uninitialized in this function [-Wmaybe-uninitialized]
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
99 ms |
216056 KB |
Output is correct |
| 2 |
Correct |
104 ms |
216056 KB |
Output is correct |
| 3 |
Correct |
102 ms |
216056 KB |
Output is correct |
| 4 |
Correct |
103 ms |
216056 KB |
Output is correct |
| 5 |
Correct |
109 ms |
216036 KB |
Output is correct |
| 6 |
Correct |
111 ms |
216824 KB |
Output is correct |
| 7 |
Correct |
107 ms |
217080 KB |
Output is correct |
| 8 |
Correct |
102 ms |
217208 KB |
Output is correct |
| 9 |
Correct |
112 ms |
217084 KB |
Output is correct |
| 10 |
Correct |
115 ms |
217080 KB |
Output is correct |
| 11 |
Correct |
162 ms |
220664 KB |
Output is correct |
| 12 |
Correct |
153 ms |
219000 KB |
Output is correct |
| 13 |
Correct |
130 ms |
220808 KB |
Output is correct |
| 14 |
Correct |
127 ms |
219000 KB |
Output is correct |
| 15 |
Correct |
176 ms |
221432 KB |
Output is correct |
| 16 |
Correct |
160 ms |
219896 KB |
Output is correct |
| 17 |
Correct |
159 ms |
221048 KB |
Output is correct |
| 18 |
Correct |
152 ms |
219000 KB |
Output is correct |
| 19 |
Correct |
170 ms |
218872 KB |
Output is correct |
| 20 |
Correct |
166 ms |
221292 KB |
Output is correct |
