# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
473875 | 2021-09-16T11:01:37 Z | AbdoMo | Crtanje (COCI20_crtanje) | C++17 | 1 ms | 332 KB |
#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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
4 | Correct | 1 ms | 332 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |