Submission

Score: 100

User: erng

Problemset: หินงอก

Language: cpp

Time: 0.003 second

Submitted On: 2025-09-26 21:48:45

#include <bits/stdc++.h>
using namespace std;

int rock[25], n, mx, nx, c;
vector<vector<int>> v;

int main()
{
    cin>>n;
    for (int i=0; i<n; i++)
    {
        cin>>rock[i];
        nx=nx+rock[i]*2;
        if (rock[i]>mx)
        {
            mx=rock[i];
        }
    }
    v.resize(mx);
    for (int i=0; i<mx; i++) v[i].resize(nx);
    for (int i=0; i<n; i++)
    {
        for (int j=0; j<rock[i]; j++)
        {
            v[j][c]=1;
            c++;
        }
        for (int j=rock[i]-1; j>=0; j--)
        {
            v[j][c]=2;
            c++;
        }
    }
    for (int i=0; i<mx; i++)
    {
        for (int j=0; j<nx; j++)
        {
            if (v[i][j]==1) cout<<"\\";
            else if (v[i][j]==2) cout<<"/";
            else cout<<" ";
        }
        cout<<"\n";
    }
}