#include <algorithm> #include <cstdio> using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define INT(x) int x; scanf("%d", &x) enum P { HARVEST, DUMP, }; int n; int a[20][20]; int q[20][20]; int mif, maf; int x[20]; int y[20]; P p[20]; int c[20]; bool d[20]; int want[20]; void move(int i, int vx, int vy) { printf("M %d %d", x[i], y[i]); q[x[i]][y[i]] = -1; x[i] += vx; y[i] += vy; q[x[i]][y[i]] = i; printf(" %d %d\n", x[i], y[i]); } void go(int i) { switch (p[i]) { case HARVEST: { if (a[x[i]][y[i]]) break; if (x[i] < i) { if (q[x[i] + 1][0] == -1) move(i, 1, 0); break; } if (a[x[i]][y[i]]) break; if (d[i]) { if (!y[i]) move(i, 0, 1); break; } if (y[i] < n) move(i, 0, 1); break; } case DUMP: { if (y[i] > 1) { move(i, 0, -1); break; } if (y[i]) { bool wait = 0; REP(j,i+1) if (q[j][0] > i) { wait = 1; break; } if (!wait) move(i, 0, -1); break; } bool wait = 0; REP(j,x[i]) if (q[j][0] > x[i]) { wait = 1; break; } if (!wait && q[x[i] - 1][0] == -1) move(i, -1, 0); else { d[i] = 0; want[i] = c[i] + 1; p[i] = HARVEST; } break; } } } void go() { INT(n1); n = n1; REP(i,n) REP(j,n) scanf("%d", &a[i][j]); REP(i,n) REP(j,n) q[i][j] = -1; printf("n: %d\n", n); int all = 0; REP(i,n) REP(j,n) all += a[i][j]; int dumped = 0; int have = 200; mif = maf = n; while (dumped < all) { FOR(i,mif,maf) go(i); while (have >= 100 && q[0][0] == -1 && maf - mif < n) { printf("R FARMER\n"); have -= 100; int nf = --mif; q[0][0] = nf; x[nf] = 0; y[nf] = 0; p[nf] = HARVEST; c[nf] = 0; d[nf] = 0; want[nf] = 100; go(nf); } FOR(i,mif,maf) { if (!x[i] && !y[i]) { have += c[i]; dumped += c[i]; c[i] = 0; p[i] = HARVEST; want[i] = 100; } else { int g = min(a[x[i]][y[i]], 10); c[i] += g; a[x[i]][y[i]] -= g; if (y[i] == n - 1 && !a[x[i]][y[i]]) { d[i] = 1; p[i] = DUMP; } else if (maf - mif < n && c[i] >= want[i]) p[i] = DUMP; } } printf("=\n"); } printf("===\n"); } int main() { INT(t); INT(k); REP(tt,t) go(); }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 | #include <algorithm> #include <cstdio> using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define INT(x) int x; scanf("%d", &x) enum P { HARVEST, DUMP, }; int n; int a[20][20]; int q[20][20]; int mif, maf; int x[20]; int y[20]; P p[20]; int c[20]; bool d[20]; int want[20]; void move(int i, int vx, int vy) { printf("M %d %d", x[i], y[i]); q[x[i]][y[i]] = -1; x[i] += vx; y[i] += vy; q[x[i]][y[i]] = i; printf(" %d %d\n", x[i], y[i]); } void go(int i) { switch (p[i]) { case HARVEST: { if (a[x[i]][y[i]]) break; if (x[i] < i) { if (q[x[i] + 1][0] == -1) move(i, 1, 0); break; } if (a[x[i]][y[i]]) break; if (d[i]) { if (!y[i]) move(i, 0, 1); break; } if (y[i] < n) move(i, 0, 1); break; } case DUMP: { if (y[i] > 1) { move(i, 0, -1); break; } if (y[i]) { bool wait = 0; REP(j,i+1) if (q[j][0] > i) { wait = 1; break; } if (!wait) move(i, 0, -1); break; } bool wait = 0; REP(j,x[i]) if (q[j][0] > x[i]) { wait = 1; break; } if (!wait && q[x[i] - 1][0] == -1) move(i, -1, 0); else { d[i] = 0; want[i] = c[i] + 1; p[i] = HARVEST; } break; } } } void go() { INT(n1); n = n1; REP(i,n) REP(j,n) scanf("%d", &a[i][j]); REP(i,n) REP(j,n) q[i][j] = -1; printf("n: %d\n", n); int all = 0; REP(i,n) REP(j,n) all += a[i][j]; int dumped = 0; int have = 200; mif = maf = n; while (dumped < all) { FOR(i,mif,maf) go(i); while (have >= 100 && q[0][0] == -1 && maf - mif < n) { printf("R FARMER\n"); have -= 100; int nf = --mif; q[0][0] = nf; x[nf] = 0; y[nf] = 0; p[nf] = HARVEST; c[nf] = 0; d[nf] = 0; want[nf] = 100; go(nf); } FOR(i,mif,maf) { if (!x[i] && !y[i]) { have += c[i]; dumped += c[i]; c[i] = 0; p[i] = HARVEST; want[i] = 100; } else { int g = min(a[x[i]][y[i]], 10); c[i] += g; a[x[i]][y[i]] -= g; if (y[i] == n - 1 && !a[x[i]][y[i]]) { d[i] = 1; p[i] = DUMP; } else if (maf - mif < n && c[i] >= want[i]) p[i] = DUMP; } } printf("=\n"); } printf("===\n"); } int main() { INT(t); INT(k); REP(tt,t) go(); } |