#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
void solve(){
int N;
cin >> N;
string s;
cin >> s;
int mn=201,mx=-1;
int cur =102;
vector<vector<char>> G(2*100+4,vector<char>(N,'.'));
int pos = 0;
for(int i=0;i<N;i++){
if(s[i]=='+'){
if(pos==2)
cur++;
G[cur][i]='/';
mx = max(mx,cur);
mn = min(mn,cur);
pos = 2;
}
else if(s[i]=='-'){
if(pos==0)
cur--;
G[cur][i]='\\';
mx = max(mx,cur);
mn = min(mn,cur);
pos = 0;
}
else{
if(pos==2){
cur++;
pos=0;
}
G[cur][i]='_';
mx = max(mx,cur);
mn = min(mn,cur);
//pos = 1;
}
}
for(int i=mx;i>=mn;i--){
for(int j=0;j<N;j++){
cout << G[i][j];
}
cout << endl;
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--){
solve();
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |