Submission

Score: 0

User: pupu

Problemset: หินงอก

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-04 11:36:07

#include <iostream>
#include <stack>
#include <queue>
using namespace std;
int main(){ios::sync_with_stdio(0);cin.tie(0);
    int n,swp,mac,sum=0,hl=0,idk=0,wtf=0;
    cin>>n;
    vector<int>x(n);
    vector<int>v(n);
    for(int i=0;i<n;i++){
        cin>>x[i];
        v[i]=x[i];
        sum=sum+(x[i]*2);
    }
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            if(x[i]<x[j]){
                swp=x[j];
                x[j]=x[i];
                x[i]=swp;
            }
        }
    }
    mac=x[0];
    vector<vector<char>>drip(mac ,vector<char>(sum,' '));
    for(int i=0;i<n;i++){
        for(int j=0;j<v[i];j++){
            drip[j][j+idk]='\\';
        }
        idk=idk+(v[i]);
        for(int j=v[i]-1;j>=0;j--){
            drip[j][idk+wtf]='/';
            wtf=wtf+1;
        }
        wtf=0;
        idk=idk+(v[i]);
    }
    cout<<"\n";
    for(int i=0;i<mac;i++){
        for(int j=0;j<sum;j++){
            cout<<drip[i][j];
        }
        cout<<"\n";
    }
}