Submission #630134

#TimeUsernameProblemLanguageResultExecution timeMemory
630134Hacv16Crtanje (COCI20_crtanje)C++17
50 / 50
1 ms340 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; const int MAX = 215; const int INF = 0x3f3f3f3f; const int MOD = 1e9 + 7; #define pb push_back #define sz(x) (int) x.size() #define fr first #define sc second #define mp make_pair #define all(x) x.begin(), x.end() #define dbg(x) cerr << #x << ": " << "[ " << x << " ]\n" int n; char t[MAX][MAX]; string s; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> s; memset(t, '.', sizeof(t)); int cur = 100, mn = 1100000, mx = -1100000; for(int i = 0; i < n; i++){ char c = s[i]; if(c == '+'){ mn = min(mn, cur); mx = max(mx, cur); t[cur][i] = '/'; cur--; }else if(c == '-'){ cur++; t[cur][i] = '\\'; mn = min(mn, cur); mx = max(mx, cur); }else{ t[cur][i] = '_'; mn = min(mn, cur); mx = max(mx, cur); } } for(int i = mn; i <= mx; i++){ for(int j = 0; j < n; j++) cout << t[i][j]; cout << '\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...