Submission

Score: 100

User: Buslnwzuz

Problemset: หินงอก

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-13 23:22:24

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

int main(){
    int n;
    cin >> n;
    int size=0;
    int max=0;
    vector<int> back;
    for(int i=0;i<n;i++){
        int k;
        cin >> k;
        back.push_back(k);
        size += k*2;
        if(k>max){
            max = k;
        }
    }
    vector<vector<char>> graph(max,vector<char>(size,' '));

    int crr = 0;
    int roll = 0;
    for(int i=0;i<n;i++){
        for(int j=0;j<back[i];j++){
            graph[roll][crr] = '\\';
            if(roll != back[i]-1) roll++;
            crr++;
        }
        for(int j=0;j<back[i];j++){
            graph[roll][crr] = '/';
            if(roll!=0) roll--;
            crr++;
        }
    }
    for(int i=0;i<max;i++){
        for(int j=0;j<size;j++){
            cout << graph[i][j];
        }
        cout << endl;
    }
    return 0;
}