Submission

Score: 80

User: Phat12

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2025-08-24 15:50:19

#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define rizz ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define int long long
const int MOD = 1e9+7;
const int diri[] = {0,0,-1,1};
const int dirj[] = {1,-1,0,0};
using namespace std;
template<class T>
using minheap = priority_queue<T,vector<T>,greater<T>>;
using pii = pair<int,int>;
char arr[300][300];
int32_t main(){
    rizz;
    int n;
    cin >> n;
    int curr=0;
    int mxx=0,mxy=0;
    while (n--){
        int a;
        cin >> a;
        mxy=max(mxy,a);
        for (int i=0;i<a;i++){
            arr[i][curr+i]='\\';
        }
        for (int i=a;i<2*a;i++){
            arr[2*a-i-1][curr+i]='/';
        }
        curr+=2*a;
    }
    for (int i=0;i<mxy;i++){
        for (int j=0;j<curr;j++) {
            cout << (arr[i][j]==0 ? ' ' : arr[i][j]);
        }
        cout << '\n';
    } 
    return 0;
}