Submission #1485905

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#define PB push_back
#define MP make_pair
#define sz(v) (in((v).size()))
#define forn(i,n) for(in i=0;i<(n);++i)
#define forv(i,v) forn(i,sz(v))
#define fors(i,s) for(auto i=(s).begin();i!=(s).end();++i)
#define all(v) (v).begin(),(v).end()
using namespace std;
typedef long long in;
typedef vector<in> VI;
typedef vector<VI> VVI;
int main(){
  ios::sync_with_stdio(0);
  cin.tie(0);
  in n,h,w;
  cin>>h>>w>>n;
  VVI sol(h,VI(w));
  in nxtc=0;
  in rmc=0;
  forn(i,h){
    forn(j,w){
      if(rmc==0){
	++nxtc;
	cin>>rmc;
      }
      --rmc;
      sol[i][j]=nxtc;
    }
    if(i%2==1){
      reverse(all(sol[i]));
    }
    forn(j,w)
      cout<<sol[i][j]<<" ";
    cout<<"\n";
  }
  return 0;
}

Submission Info

Judge Result