#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
void solve(){
int n;
cin>>n;
string s;
cin>>s;
int cnt = 0;
int mx = 0;
int mn = 0;
for(auto i : s){
if(i == '+') cnt ++;
if(i == '-') cnt --;
mx = max(mx,cnt);
mn = min(mn,cnt);
}
mn = abs(mn);
vector<string> ans(mx+mn,string(n,'.'));
int st = mx-1;
for(int i=0;i<n;i++){
if(s[i] == '+') ans[st][i] = '/' , st --;
else if(s[i] == '-') st ++ , ans[st][i] = '\\';
else ans[st][i] = '_';
}
for(auto i : ans) cout<<i<<endl;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
5 |
Correct |
0 ms |
348 KB |
Output is correct |