#include<bits/stdc++.h>
using namespace std;
long long n, pos = 0, maxx = 0, minx = 0;
string s;
map<int, int> a[101];
int main()
{
cin >> n >> s;
for(int i = 0; i < n; ++i)
{
if(s[i] == '+')
{
a[i + 1][pos] = 2;
++pos;
}
else if(s[i] == '-')
{
--pos;
a[i + 1][pos] = 1;
}
else if(s[i] == '=') a[i + 1][pos] = 3;
maxx = max(pos, maxx);
minx = min(pos, minx);
}
bool check = 0;
for(int j = 1; j <= n; ++j) if(a[j][maxx]) check = 1;
if(!check) --maxx;
for(int i = maxx; i >= minx; --i)
{
for(int j = 1; j <= n; ++j)
{
if(!a[j][i]) cout << ".";
else if(a[j][i] == 1) cout << char(92);
else if(a[j][i] == 2) cout << "/";
else cout << "_";
}
cout << "\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
724 KB |
Output is correct |
2 |
Correct |
1 ms |
468 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
724 KB |
Output is correct |