#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define sz(a) (int)a.size()
#define ll long long
const int N = 3e5 + 100;
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
char mat[1000][100];
for(int i = 0; i< 1000; i++)
{
for(int j = 0; j < 100; j++)
{
mat[i][j] = '.';
}
}
int st = 500;
int minst = 500, maxst = 500;
int predst = 500;
for(int i = 0; i < n; i++)
{
int u1 = st;
if(s[i] == '+')
{
if(st < predst)
{
st = predst;
}
minst = min(minst, st);
maxst = max(maxst, st);
u1 = st;
mat[st][i] = '/';
st++;
}
else if(s[i] == '-')
{
if(st >= predst)
{
st--;
}
minst = min(minst, st);
maxst = max(maxst, st);
u1 = st;
mat[st][i] = '\\';
st--;
}
else
{
if(st < predst)
{
st = predst;
}
minst = min(minst, st);
maxst = max(maxst, st);
u1 = st;
mat[st][i] = '_';
}
if(i == 0)
{
minst = maxst =u1;
}
predst = u1;
}
for(int j = maxst; j >= minst; j--)
{
for(int i = 0; i < n; i++)
{
cout << mat[j][i];
}
cout << "\n";
}
return 0;
}
| # |
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 |
