Submission

Score: 100

User: Zailagend1

Problemset: หินงอก

Language: cpp

Time: 0.003 second

Submitted On: 2026-06-24 23:43:42

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<int> vc;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vc> vvc;
typedef vector<vs> vvs;
typedef vector<vll> vvll;
typedef vector<pii> vpii;

typedef unordered_map<int, int> umii;
typedef unordered_map<string, int> umsi;
typedef unordered_map<char, int> umci;
typedef unordered_map<ll, ll> umll;
typedef unordered_set<int> usi;

#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define sz(v) (int)(v).size()
#define il(n) int i = 0; i < (n); i++
#define jl(n) int j = 0; j < (n); j++
#define kl(n) int k = 0; k < (n); k++

const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;

template<typename T> void _dbg(T t) { cerr << t; }
template<typename T, typename... Args> void _dbg(T t, Args... args) { cerr << t << ", "; _dbg(args...); }
#ifdef LOCAL
#define debug(...) do { cerr << "[" << #__VA_ARGS__ << "] = ["; _dbg(__VA_ARGS__); cerr << "]" << endl; } while(0)
#else
#define debug(...)
#endif
int offset = 0;
void spike(int num);
vvs graph;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;

    vi a(n);
    for (int i = 0; i < n; i++) {cin >> a[i];}
    graph.assign(*std::max_element(a.begin(),a.end()),vs(2 * (accumulate(a.begin(),a.end(),0))," "));
    for(int i = 0;i<n;i++){spike(a[i]);}
   
   
    for(int i = 0;i<*std::max_element(a.begin(),a.end());i++){
      for(int j = 0;j<2 * (accumulate(a.begin(),a.end(),0));j++){
        cout << graph[i][j];
      }
      cout << '\n';
    }
 
    
    return 0;
}
void spike(int num){
  int gap = (((num-1)*2)+1);
  int j = 0;
  j += offset;
  for(int i = 0;i<num;i++){
      graph[i][j] = "\\";
      graph[i][j+gap] = "/";
      gap-=2;
      j++;
    }
  offset += 2*num;
}