oj.uz

Submission #930402

# Submission time Handle Problem Language Result Execution time Memory
930402 2024-02-19T14:45:41 Z Whisper Crtanje (COCI20_crtanje) C++17
50 / 50
 1 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e2 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }

char a[MAX][MAX];
string s;
int nLen;
void Whisper(){
    cin >> nLen >> s;
    FOR(i, 0, MAX - 1) FOR(j, 0, MAX - 1) a[i][j] = '.';
    int BASE = 100;
    int mn = INF, mx = 0;
    for (int i = 0; i < nLen; ++i){
        if (s[i] == '+'){
            maximize(mx, BASE);
            minimize(mn, BASE);
            a[BASE++][i] = '/';
        }
        else if(s[i] == '-'){
            a[--BASE][i] = '\\';
            maximize(mx, BASE);
            minimize(mn, BASE);
        }
        else{
            a[BASE][i] = '_';
            maximize(mx, BASE);
            minimize(mn, BASE);
        }
    }
    for (int i = mx; i >= mn; --i){
        for (int j = 0; j < nLen; ++j){
            cout << a[i][j];
        }
        cout << '\n';
    }

}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct