Submission #807305

#TimeUsernameProblemLanguageResultExecution timeMemory
807305Tunglam07Crtanje (COCI20_crtanje)C++17
0 / 50
2 ms760 KiB
#include<bits/stdc++.h> using namespace std; int main() { string s; map<int, int> mp[101]; long long n, pos = 0, maxx = 0, minn = 0; cin >> n >> s; for(int i = 0; i < n; i++) { if(s[i] == '+') { mp[i + 1][pos] = 2; ++pos; } else if(s[i] == '-') { --pos; mp[i + 1][pos] = 1; } else if(s[i] == '=') { mp[i + 1][pos] = 3; } maxx = max(pos, maxx); minn = min(pos, minn); } bool ck = 0; for(int j = 1; j <= n; ++j) { if(mp[j][maxx]) { ck = 1; } } if(!ck) { maxx--; } for(int i = maxx - 1; i >= minn; i--) { for(int j = 1; j <= n; ++j) { if(!mp[j][i]) { cout << "."; } else if(mp[j][i] == 1) { cout << char(92); } else if(mp[j][i] == 2) { cout << "/"; } else { cout << "_"; } } cout << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...