Submission

Score: 100

User: qweqwe

Problemset: หินงอก

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-08 17:35:56

#include <bits/stdc++.h>
#define speed cin.tie(0)->sync_with_stdio(0)
#define ll long long
#define pii pair<int,int>
using namespace std;

int main(){
	int n;cin >> n;
	vector<int> v(n);int sum=0,mx=0;
	for (int i=0;i<n;i++){
		cin >> v[i];sum+=v[i];mx=max(mx,v[i]);
	}
	vector<int> c=v;
	vector<vector<char>> rocks(mx+1,vector<char>(2*sum+1,' '));
	for (int i=0;i<mx;i++){
		int temp=1;
		int idx=0,id=0;
		while (temp<=n){
			//cout << idx << " " << v[id] << "\n";
			for (int j=idx;j<idx+2*c[id];j++){
				if (v[id]){
					if (!i && j==idx) rocks[i][j]='\\';
					else if (!i && j==idx+2*c[id]-1) rocks[i][j]='/';
					else if (i && j && rocks[i-1][j-1]=='\\') rocks[i][j]='\\';
					else if (i && j!=idx+2*c[id]-1 && rocks[i-1][j+1]=='/') rocks[i][j]='/';
				}else rocks[i][j]=' ';
			}idx+=2*c[id];v[id]--;id++;
			temp++;
		}
	}
	for (int i=0;i<mx;i++){
		for (int j=0;j<2*sum;j++){
			cout << rocks[i][j];
		}cout << "\n";
	}
	return 0;
}