NKTABLE - NKTable

Tác giả: RR

Ngôn ngữ: C++

#include <sstream>
#include <iomanip>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <deque>
#include <complex>

#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define FORN(i,a,b) for(int i=(a),_b=(b);i<_b;i++)
#define DOWN(i,a,b) for(int i=a,_b=(b);i>=_b;i--)
#define SET(a,v) memset(a,v,sizeof(a))
#define sqr(x) ((x)*(x))
#define ll long long
#define F first
#define S second
#define PB push_back
#define MP make_pair

#define DEBUG(x) cout << #x << " = "; cout << x << endl;
#define PR(a,n) cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl;
#define PR0(a,n) cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl;
using namespace std;

//Buffer reading
int INP,AM,REACHEOF;
#define BUFSIZE (1<<12)
char BUF[BUFSIZE+1], *inp=BUF;
#define GETCHAR(INP) { \
    if(!*inp) { \
        if (REACHEOF) return 0;\
        memset(BUF,0,sizeof BUF);\
        int inpzzz = fread(BUF,1,BUFSIZE,stdin);\
        if (inpzzz != BUFSIZE) REACHEOF = true;\
        inp=BUF; \
    } \
    INP=*inp++; \
}
#define DIG(a) (((a)>='0')&&((a)<='9'))
#define GN(j) { \
    AM=0;\
    GETCHAR(INP); while(!DIG(INP) && INP!='-') GETCHAR(INP);\
    if (INP=='-') {AM=1;GETCHAR(INP);} \
    j=INP-'0'; GETCHAR(INP); \
    while(DIG(INP)){j=10*j+(INP-'0');GETCHAR(INP);} \
    if (AM) j=-j;\
}
//End of buffer reading

const long double PI = acos((long double) -1.0);
typedef pair<int,int> P;

const int di[] = {0,1};
const int dj[] = {1,0};

int m, n, a[511][511];
P tr[511][511];
queue< P > cur, next[2];
deque< queue<P> > v;

bool inside(int u, int v) {
    return (u > 0) && (u <= m) && (v > 0) && (v <= n);
}

void clear(queue< P > &q) {
    while (!q.empty()) q.pop();
}

void trace(int m, int n) {
    if (m == 1 && n == 1) {
        printf("%d", a[1][1]);
        return ;
    }
    trace(tr[m][n].F, tr[m][n].S);
    printf("%d", a[m][n]);
}

int main() {
    scanf("%d%d", &m, &n);
    FOR(i,1,m) FOR(j,1,n) scanf("%d", &a[i][j]);

    clear(cur); cur.push(MP(1,1));
    v.push_back(cur);

    while (!v.empty()) {
        cur = v.front();
        clear(next[0]); clear(next[1]);
        while (!cur.empty()) {
            P u = cur.front(); cur.pop();
            REP(dir,2) {
                P v = MP(u.F + di[dir], u.S + dj[dir]);
                if (inside(v.F, v.S) && a[v.F][v.S] < 2 && tr[v.F][v.S] == MP(0,0)) {
                    tr[v.F][v.S] = u;
                    next[a[v.F][v.S]].push(v);
                }
            }
        }
        if (!next[1].empty()) v.push_back(next[1]);
        if (!next[0].empty()) v.push_back(next[0]);
        v.pop_front();
    }
    trace(m, n);
    puts("");
    return 0;
}

Download