#include "Anna.h"
#include <vector>
#include <iostream>
#include <assert.h>
using namespace std;
namespace {
inline int ab(int x) {
return x > 0 ? x : -x;
}
int getdir(int dx, int dy) {
int ret = 0;
if (dy > 1) ret = 0;
else if (dy < -1) ret = 1;
else if (dx > 1) ret = 2;
else ret = 3;
ret += 9;
return ret;
}
inline int encode(int dx, int dy) {
return (dx + 1) * 3 + (dy + 1) + 1;
}
bool check(int N, int K, vector<int> R, vector<int> C, int mv, bool set) {
int mx = mv / 3, my = mv % 3;
int ret[N][N];
bool found[10];
for (int i = 0;i < N;i++) {
for (int j = 0;j < N;j++) {
int val = ((i - mx + 3) % 3 * 3 + (j - my + 3) % 3);
if (val > 0 && val <= 7) {
int dx = R[val-1] - i, dy = C[val-1] - j;
if (ab(dx) > 1 || ab(dy) > 1) {
ret[i][j] = getdir(dx, dy);
} else {
ret[i][j] = encode(dx, dy);
if (encode(dx, dy) == 9) return false;
found[encode(dx, dy)] = true;
}
} else if (val == 0) {
ret[i][j] = 13;
} else {
ret[i][j] = 0;
}
}
}
int emp = 0;
for (int i = 1;i < 9;i++) {
if (!found[i]) {
emp = i;
break;
}
}
for (int i = 0;i < N;i++) {
for (int j = 0;j < N;j++) {
if (ret[i][j] == 0) ret[i][j] = emp;
else if (ret[i][j] > emp) {
ret[i][j]--;
}
assert(ret[i][j] > 0);
if (set) {
SetFlag(i, j, ret[i][j]);
}
}
}
return true;
}
} // namespace
void Anna(int N, int K, vector<int> R, vector<int> C) {
for (int i = 0;i < 9;i++) {
if (check(N, K, R, C, i, false)) {
check(N, K, R, C, i, true);
break;
}
}
}
#include "Bruno.h"
#include <vector>
#include <iostream>
using namespace std;
namespace {
int inp[3][3];
int px[9], py[9];
int getans(int dx, int dy) {
int ret = 0;
if (dx == 0 && dy == 0) return 4;
if (dy > 0) ret = 0;
else if (dy < 0) ret = 1;
else if (dx > 0) ret = 2;
else ret = 3;
return ret;
}
} // namespace
vector<int> Bruno(int K, vector<int> value) {
int tx = 0, ty = 0;
for (int i = 0;i < 9;i++) {
if (value[i] == 12) {
tx = i / 3, ty = i % 3;
}
}
for (int i = 0;i < 9;i++) {
int id = (i / 3 - tx + 3) % 3 * 3 + (i % 3 - ty + 3) % 3;
inp[(i / 3 - tx + 3) % 3][(i % 3 - ty + 3) % 3] = value[i];
px[id] = i / 3;
py[id] = i % 3;
}
int emp = inp[2][2];
vector<int> ret;
for (int i = 0;i < 3;i++) {
for (int j = 0;j < 3;j++) {
int num = i * 3 + j;
if (num > 0 && num <= 7) {
if (inp[i][j] >= emp) inp[i][j]++;
if (inp[i][j] >= 9) {
ret.push_back(inp[i][j] - 9);
} else {
int dx = px[num] - 1 + (inp[i][j] - 1) / 3 - 1, dy = py[num] - 1 + (inp[i][j] - 1) % 3 - 1;
ret.push_back(getans(dx, dy));
}
}
}
}
return ret;
}
/*
1
7 7
1 2
1 3
3 2
3 5
4 1
5 3
5 5
4 2
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
2 ms |
492 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
