Submission #493224

#TimeUsernameProblemLanguageResultExecution timeMemory
493224inksamuraiCrtanje (COCI20_crtanje)C++17
50 / 50
1 ms332 KiB
#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; const int m=200; vec(vec(char)) a(m,vec(char)(m,'.')); int cur=m/2; rep(j,n){ if(s[j]=='+'){ if(j and s[j-1]=='-') cur--; a[cur][j]='/'; cur--; }else if(s[j]=='-'){ if(j and s[j-1]=='+') cur++; if(j and s[j-1]=='=') cur++; a[cur][j]='\\'; cur++; }else{ if(j and s[j-1]=='-') cur--; a[cur][j]='_'; } } rep(i,m){ bool pok=0; rep(j,n) if(a[i][j]!='.') pok=1; if(not pok) continue; rep(j,n) cout<<a[i][j]; cout<<"\n"; } // return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...