| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1132940 | adaawf | Navigation 2 (JOI21_navigation2) | C++20 | 0 ms | 0 KiB |
#include <iostream>
#include <vector>
#include "Anna.h"
using namespace std;
int a[105][105], b[105][105];
void Anna(int n, int k, vector<int> r, vector<int> c) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int h = (i % 3) * 3 + (j % 3);
b[i][j] = a[i][j] = h;
}
}
int fl = 0;
for (int jj = 0; jj < 3; jj++) {
for (int kk = 0; kk < 3; kk++) {
int flag = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] >= 7) continue;
if (r[a[i][j]] == i && c[a[i][j]] == j) {
flag = 1;
}
}
}
if (flag == 0) {
fl = 1;
break;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
b[i][j] = a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
a[i][j] = b[i][(j + 1) % n];
}
}
}
if (fl == 1) break;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
b[i][j] = a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
a[i][j] = b[(i + 1) % n][j];
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int h = aa[i][j];
if (h == 8) {
SetFlag(i, j, 13);
}
else if (h == 7) SetFlag(i, j, 1);
else {
int x = r[h], y = c[h];
if (abs(x - i) > abs(y - j)) {
if (abs(x - i) == 1) {
if (x < i) SetFlag(i, j, 4);
else SetFlag(i, j, 3);
}
else {
if (x < i) SetFlag(i, j, 12);
else SetFlag(i, j, 11);
}
}
else {
if (abs(x - i) == 1 && abs(y - j) == 1) {
if (x < i && y < j) SetFlag(i, j, 5);
if (x > i && y < j) SetFlag(i, j, 6);
if (x < i && y > j) SetFlag(i, j, 7);
if (x > i && y > j) SetFlag(i, j, 8);
}
else if (abs(y - j) == 1) {
if (y > j) SetFlag(i, j, 1);
else SetFlag(i, j, 2);
}
else {
if (y > j) SetFlag(i, j, 9);
else SetFlag(i, j, 10);
}
}
}
}
}
}
#include <iostream>
#include <vector>
#include "Bruno.h"
using namespace std;
int b[3][3] = {{0, 1, 2}, {3, 4, 5}, {6, 7, 8}}, a[4][4];
int dx[] = {0, 0, 0, 1, -1, -1, 1, -1, 1}, dy[] = {0, 1, -1, 0, 0, -1, -1, 1, 1};
vector<int> Bruno(int k, vector<int> aa) {
vector<int> res(7);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (aa[i * 3 + j] == 13) {
for (int k = 0; k < 3; k++) {
for (int l = 0; l < 3; l++) {
a[k][l] = b[(k + 2 - i) % 3][(l + 2 - j) % 3];
}
}
}
}
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (a[i][j] >= 7) continue;
if (aa[i * 3 + j] > 8) res[a[i][j]] = aa[i * 3 + j] - 9;
else {
int x = i + dx[aa[i * 3 + j]], y = j + dy[aa[i * 3 + j]];
if (x == 1 && y == 1) res[a[i][j]] = 4;
else if (y < 1) res[a[i][j]] = 1;
else if (y > 1) res[a[i][j]] = 0;
else if (x < 1) res[a[i][j]] = 3;
else res[a[i][j]] = 2;
}
}
}
return res;
}