oj.uz

답안 #438716

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
438716 2021-06-28T14:22:48 Z SorahISA Crtanje (COCI20_crtanje) C++17
50 / 50
 1 ms 332 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
using pii = pair<int, int>;
template <typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)

int32_t main() {
    fastIO();
    
    int n, minV = 0, maxV = -1, nowV = 0;
    string s;
    cin >> n >> s;
    
    for (auto c : s) {
        if (c == '+') maxV = max(maxV, nowV++);
        if (c == '-') minV = min(minV, --nowV);
        if (c == '=') maxV = max(maxV, nowV), minV = min(minV, nowV);
    }
    
    vector<string> mat(maxV - minV + 1, string(n, '.'));
    
    nowV = 0;
    for (int i = 0; i < n; ++i) {
        if (s[i] == '+') mat[nowV++ - minV][i] = '/';
        if (s[i] == '-') mat[--nowV - minV][i] = '\\';
        if (s[i] == '=') mat[nowV   - minV][i] = '_';
    }
    reverse(ALL(mat));
    
    for (auto str : mat) cout << str << "\n";
    
    return 0;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct