# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
445478 |
2021-07-18T08:30:54 Z |
grt |
Crtanje (COCI20_crtanje) |
C++17 |
|
1 ms |
332 KB |
#include <bits/stdc++.h>
#define ST first
#define ND second
#define PB push_back
using namespace std;
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;
const int nax = 110;
int n;
string s;
char t[2 * nax][nax];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> s;
int cur = 0, id = 0;
int mi = 2 * n, mx = - 2 * n;
for(auto c : s) {
if(c == '+') {
t[cur + n][id] = '/';
mi = min(mi, cur + n);
mx = max(mx, cur + n);
cur++;
}
else if(c == '-') {
cur--;
t[cur + n][id] = '\\';
mi = min(mi, cur + n);
mx = max(mx, cur + n);
} else {
t[cur + n][id] = '_';
mi = min(mi, cur + n);
mx = max(mx, cur + n);
}
id++;
}
for(int i = mx; i >= mi; --i) {
for(int j = 0; j < n; ++j) {
if(!t[i][j]) cout << ".";
else cout << t[i][j];
}
cout << "\n";
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |