# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
473875 | AbdoMo | Crtanje (COCI20_crtanje) | C++17 | 1 ms | 332 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 int long long
#define ll long long
#define pb push_back
const int mod = 1e9+7;
using namespace std;
bool comp(string a,string b)
{
if(a.size()==b.size())
{
return a<b;
}
return a.size()<b.size();
}
void solve(){
int n;
string s;
cin>>n>>s;
int pos=0,neg=0;
for(int i=0;i<n;i++)
{
pos+=s[i]=='+';
neg+=s[i]=='-';
}
char mat[300][n];
int cur=120;
for(int i=0;i<300;i++)
{
for(int j=0;j<n;j++)mat[i][j]='.';
}
for(int i=0;i<n;i++)
{
if(s[i]=='+')
{
mat[cur][i]='/';
cur--;
}
else if(s[i]=='-')
{
cur++;
mat[cur][i]='\\';
}
else
{
mat[cur][i]='_';
}
}
int frstrow=0;
for(int i=0;i<300;i++)
{
bool isthere=0;
for(int j=0;j<n;j++)
{
if(mat[i][j]!='.')
{
isthere=1;
break;
}
}
if(isthere)
{
for(int j=0;j<n;j++)
{
cout<<mat[i][j];
}
cout<<endl;
}
}
}
int32_t main(){
int t=1;
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// cin>>t;
while(t--){solve();}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |