Submission #65802029

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std; using ll = long long;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
using pi = pair<int,int>;
using pl = pair<ll,ll>;
const ll mod = 998244353;

signed main(void){
  int h, w, n;
  cin >> h >> w >> n;
  vector<vector<int> > grid(h, vector<int>(w, 0));
  vector<int> a(n);
  for(int i = 0; i < n; i++){
    cin >> a[i];
  }
  
  int x = 0, y = 0;
  for(int i = 0; i < n; i++){
    for(int j = 0; j < a[i]; j++){
      grid[y][x] = i + 1; 
      cerr << grid[y][x] << endl;
      
      x++;
      if(x == w){
        x = 0; y++;
      }
    }
  }
  for(int i = 0; i < h; i++){
    if(i % 2 == 1){
      reverse(all(grid[i]));
    }
  }
  for(int i = 0; i < h; i++){
    for(int j = 0;  j < w; j++){
      cout << grid[i][j] << " ";
    }
    cout << endl;
  }
}

Submission Info

Judge Result