#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 207;
int n, m;
string s;
char a[N][N];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> s;
memset(a, '.', sizeof(a));
int cur = 100, x = 100, y = 100;
for(int i = 0; i < n; i++)
if (s[i] == '+'){
a[cur][i] = '/';
cur--;
x = min(x, cur);
} else if (s[i] == '-'){
cur++;
a[cur][i] = '\\';
y = max(y, cur);
} else {
a[cur][i] = '_';
x = min(x, cur - 1);
}
for(int i = x + 1; i <= y; i++){
for(int j = 0; j < n; j++)
cout << a[i][j];
cout << '\n';
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
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 |