# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332536 | 2020-12-02T19:58:24 Z | souvenir_vayne | Crtanje (COCI20_crtanje) | C++14 | 1 ms | 384 KB |
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <chrono> #define pb push_back #define INF 0x3f3f3f3f //#define LINF 0x3f3f3f3f3f3f3f3f //#define endl '\n' #define ll long long #define f first #define fin cin #define fout cout #define s second #define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0) #define debug(x) cout << "DEBUG " << x << endl #define debug2(x, y) cout << "DEBUG " << x << " " << y << endl #define debug3(x, y, z) cout << "DEBUG " << x << " " << y << " " << z<< endl #define debug4(x, y, z, o) cout << "DEBUG " << x << " " << y << " " << z<< " " << o << endl #define all(x) x.begin(), x.end() #define left vadia #define lb lower_bound #define right puta using namespace std; using namespace __gnu_pbds; void setIO(string s) { ios_base::sync_with_stdio(0); cin.tie(0); freopen((s+".in").c_str(),"r",stdin); freopen((s+".out").c_str(),"w",stdout); } typedef pair<ll, ll> pii; typedef vector<vector<char>> mat; typedef pair<int, string> pis; const ll mod = 1e9+7; typedef vector<int> vi; typedef pair<int, pair<int, int>> piii; char m[105][105]; int32_t main() { int n; cin >> n; string v; cin >> v; int ans = 99, big = 99; for(int i = 0; i < 100; i++) { int x = i, mx = i, deu = true; for(int j = 1; j < n; j++) { if(v[j] == '+' && v[j-1] == '+') x--; else if(v[j] == '-' && v[j-1] == '-') x++; else if(v[j] == '=' && v[j-1] == '+') x--; //else if(v[j] == '=' && v[j-1] == '-') x++; mx = max(x, mx); if(x < 0) {deu = false; break;} } if(deu) {ans = i; big = mx; break;} } memset(m, '.', sizeof m); for(int i = 0; i < n; i++) { if(i && v[i] == '+' && v[i-1] == '+') ans--; if(i && v[i] == '-' && v[i-1] == '-') ans++; else if(i && v[i] == '=' && v[i-1] == '+') ans--; // else if(i && v[i] == '=' && v[i-1] == '-') ans++; m[ans][i] = (v[i] == '+' ? '/' : (v[i] == '-' ? '\\' : '_')); } for(int i = 0; i <= big; cout << endl, i++) for(int j = 0; j < n; j++) cout << m[i][j]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Incorrect | 1 ms | 376 KB | Output isn't correct |
4 | Incorrect | 1 ms | 364 KB | Output isn't correct |
5 | Correct | 1 ms | 364 KB | Output is correct |