Submission #8548704

---

Source Code Expand

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

#define rep(i, n) for(int i = 0; i < (n); ++i)

typedef long long ll;
typedef pair<int, int> P;

const int MAX = 1e5 + 5;
const int INF = 1001001001;
const int MOD = 1e9 + 7;

int main(){
    int H, W, N;
    cin >> H >> W >> N;
    
    vector<int> a(N);
    rep(i, N) cin >> a[i];

    vector<int> v;
    rep(i, N) {
        rep(j, a[i]) {
            v.push_back(i + 1);
        }
    }

    vector<vector<int>> c(H, vector<int>(W));
    rep(i, H) {
        rep(j, W) {
            c[i][j] = v.back();
            v.pop_back();
        }
    }

    rep(i, H) {
        if (i % 2) {
            reverse(c[i].begin(), c[i].end());
        }
    }

    rep(i, H) {
        rep(j, W) cout << c[i][j] << " ";
        cout << endl;
    }
}

Submission Info

Judge Result