Submission

Score: 100

User: ChanakanStudy

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-10 22:17:12

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <queue>
#include <stack>
#include <climits>
#include <map>
#include <numeric>
#include <iomanip>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n , h =0 , w =0;
    cin >> n;
    vector<int> a(n);
    for (auto &x : a) {
        cin >> x;
        h = max(h,x);
        w += 2*x;
    }

    char picture[h][w];
    for(int i = 0 ;i<h;i++) {
        for(int j = 0;j<w;j++) {
            picture[i][j] = ' ';
        }
    }
    int start = 0;
    for(int i = 0;i<a.size();i++) {
        int len = a[i];
        for(int j = 0;j<len;j++) {
            picture[j][start + j] = '\\';
            picture[j][start + 2 * len - 1 - j] = '/';
        }
        start += 2*len;
    }

    for(int i = 0 ;i<h;i++) {
        for(int j = 0;j<w;j++) {
            cout << picture[i][j];
        }
        cout << '\n';
    }
    return 0;
}