# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
493212 | inksamurai | Crtanje (COCI20_crtanje) | C++17 | 1 ms | 460 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 <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3cSpNGp ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
int main(){
_3cSpNGp;
int n;
cin>>n;
string s;
cin>>s;
int cur=0;
int up=0,lo=0;
rep(i,n){
if(s[i]=='+') cur++;
else if(s[i]=='-') cur--;
up=max(up,cur);
lo=min(lo,cur);
}
int h=up-lo;
vec(vec(char)) a(h,vec(char)(n,'.'));
cur=h-1+lo;
if(cur<0) cur=0;
rep(j,n){
if(s[j]=='+'){
if(j>0 and s[j-1]=='-') cur--;
a[cur][j]='/';
cur--;
}else if(s[j]=='-'){
if(j>0 and s[j-1]=='+') cur++;
a[cur][j]='\\';
cur++;
}else if(s[j]=='='){
// if(j>0 and s[j-1]=='+') cur++;
if(j>0 and s[j-1]=='-') cur--;
a[cur][j]='-';
}
}
rep(i,h){
rep(j,n) cout<<a[i][j];
cout<<"\n";
}
//
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |