Submission #854439

# Submission time Handle Problem Language Result Execution time Memory
854439 2023-09-27T16:27:09 Z vjudge1 Crtanje (COCI20_crtanje) C++17
50 / 50
1 ms 348 KB
#pragma GCC optimize("unroll-loops,Ofast,O3")
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define spc << " " <<
#define endl "\n"
#define all(x) x.begin(), x.end()
#define ll long long
#define int long long
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define st first
#define nd second
#define inf 1000000009
#define MOD 1000000007
#define lim 200005
using namespace std;








void solve(){
    int n; cin >> n;
    string s; cin >> s;
    int mini=0, maxi=0, cur=0;
    for(int i=0; i<n-1; i++){
        char c=s[i];
        if(s[i]=='+' && s[i+1]!='-') cur--;
        if(s[i]=='-' && s[i+1]=='-') cur++;
        if(s[i]=='=' && s[i+1]=='-')cur++;
        mini = max(-cur, mini);
        maxi = max(cur, maxi);
    }
    cerr << mini spc maxi << endl;
    char arr[mini+maxi+1][n];
    for(int i=0; i<mini+maxi+1; i++) for(int j=0; j<n; j++) arr[i][j]='.';
    cur=mini;
    for(int i=0; i<n; i++){
        if(s[i]=='='){
            arr[cur][i]='_';
            if(i!=n-1 && s[i+1]=='-')cur++;
        }
        else if(s[i]=='+'){
            arr[cur][i]='/';
            if(i!=n-1 && s[i+1]!='-')cur--;
        }
        else{
            arr[cur][i]='\\';
            if(i!=n-1 && s[i+1]=='-')cur++;
        }
    }
    for(int i=0; i<mini+maxi+1; i++){
        for(int j=0; j<n; j++) cout << arr[i][j];
        cout << endl;
    }
}



signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    #ifdef Local
    freopen("in","r",stdin);
    freopen("out","w",stdout);
    #endif

    ll t=1;
    //cin >> t;
    while(t--) solve();
}

Compilation message

crtanje.cpp: In function 'void solve()':
crtanje.cpp:32:14: warning: unused variable 'c' [-Wunused-variable]
   32 |         char c=s[i];
      |              ^
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct