# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
908519 | Sandarach151 | Crtanje (COCI20_crtanje) | C++17 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
string s;
cin >> s;
int cur = 0;
int minn = 0;
int maxx = 0;
for(int i=0; i<n; i++){
if(s[i]=='+'){
cur++;
maxx = max(maxx, cur);
}
else if(s[i]=='-'){
cur--;
minn = min(minn, cur);
}
}
char arr[maxx-minn+1][n];
for(int i=0; i<maxx-minn+1; i++){
for(int j=0; j<n; j++){
arr[i][j]='.';
}
}
cur = 0;
for(int i=0; i<n; i++){
if(s[i]=='+'){
cur++;
arr[cur-minn-1][i]='/';
}
else if(s[i]=='-'){
cur--;
arr[cur-minn][i]='\\';
}
else{
arr[cur-minn][i]='_';
}
}
if(maxx!=minn){
for(int i=maxx-minn-1; i>=0; i--){
for(int j=0; j<n; j++){
cout << arr[i][j];
}
cout << '\n';
}
}
else{
for(int i=maxx-minn; i>=0; i--){
for(int j=0; j<n; j++){
cout << arr[i][j];
}
cout << '\n';
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |