#include "bits/stdc++.h"
#define endl '\n'
#define fi first
#define se second
constexpr int maxn = 2e5+5;
constexpr int inf = 1e9;
constexpr int mod = 1e9+7;
using namespace std;
using lint = long long;
using pii = pair<int,int>;
int n;
string s;
char g[500][500];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
for(int i = 0; i < 500; i++)
for(int j = 0; j < 500; j++)
g[i][j] = '*';
cin >> n >> s;
int x = 100, y = 99;
int mxx = -inf;
int mnx = inf;
for(int i = 0; i < n; i++) {
if(g[x][y] == '/' && s[i] == '+')
x--;
if(g[x][y] == '/' && s[i] == '=')
x--;
else if(g[x][y] == '\\' && s[i] == '-')
x++;
else if(g[x][y] == '_' && s[i] == '-')
x++;
y++;
mxx = max(mxx, x);
mnx = min(mnx, x);
if(s[i] == '-')
g[x][y] = '\\';
if(s[i] == '+')
g[x][y] = '/';
if(s[i] == '=')
g[x][y] = '_';
}
for(int i = mnx; i <= mxx; i++, cout << endl)
for(int j = 100; j <= 100 + n - 1; j++)
cout << (g[i][j] == '*' ? '.' : g[i][j]);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
460 KB |
Output is correct |
| 2 |
Correct |
1 ms |
460 KB |
Output is correct |
| 3 |
Correct |
1 ms |
460 KB |
Output is correct |
| 4 |
Correct |
1 ms |
460 KB |
Output is correct |
| 5 |
Correct |
1 ms |
460 KB |
Output is correct |
