# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
533321 | fhvirus | Navigation 2 (JOI21_navigation2) | C++17 | 2000 ms | 2444 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "Anna.h"
#include <cmath>
#include <vector>
#include <iostream>
namespace {
const int kMark = 14;
std::vector<std::vector<int>> flag;
void init(const int& N) {
flag.assign(N, std::vector<int>(N, 0));
}
int get_val(const int& i, const int& j, const int& r, const int& c) {
if (j <= c - 2) return 10;
if (j >= c + 2) return 11;
if (i <= r - 2) return 12;
if (i >= r + 2) return 13;
int di = i - r, dj = j - c;
return (di + 1) * 3 + (dj + 1) + 1;
}
void solve(const int& N, const int& K, const std::vector<int>& R, const std::vector<int>& C) {
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j) {
int k = (i % 3) * 3 + (j % 3);
flag[i][j] = (k < 7 ? get_val(i, j, R[k], C[k]) : (k == 8 ? kMark : 1));
}
}
} // namespace
void Anna(int N, int K, std::vector<int> R, std::vector<int> C) {
init(N);
solve(N, K, R, C);
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j) {
std::cerr << flag[i][j] << " \n"[j + 1 == N];
SetFlag(i, j, flag[i][j]);
}
std::cerr << std::endl;
}
#include "Bruno.h"
#include <vector>
#include <iostream>
namespace {
const int kMark = 14;
int judge(const int& i, const int& j, const int& r, const int& c) {
if (i == r and j == c) return 4;
if (j < c) return 0;
if (j > c) return 1;
if (i < r) return 2;
if (i > r) return 3;
return -1;
}
} // namespace
std::vector<int> Bruno(int K, std::vector<int> value) {
std::cerr << "Bruno:" << std::endl;
int mark_i, mark_j;
for (int i = 0; i < 9; ++i)
if (value[i] == kMark) {
mark_i = i / 3;
mark_j = i % 3;
}
std::cerr << mark_i << ' ' << mark_j << std::endl;
for (int i = 0; i < 3; ++i)
for (int j = 0; j < 3; ++j)
std::cerr << value[i * 3 + j] << " \n"[j == 2];
std::cerr << std::endl;
std::vector<int> res(K);
for (int dk = 0; dk < 9; ++dk) {
int i = (dk / 3 + 2 - mark_i) % 3, j = (dk % 3 + 2 - mark_j) % 3;
int k = i * 3 + j;
if (i * 3 + j >= 7) continue;
std::cerr << dk << ':' << k;
if (value[dk] >= 10) res[k] = value[dk] - 10;
else {
int r = dk / 3 + (1 - (value[dk] - 1) / 3);
int c = dk % 3 + (1 - (value[dk] - 1) % 3);
std::cerr << ' ' << r << ' ' << c;;
res[k] = judge(1, 1, r, c);
}
std::cerr << std::endl;
}
for (int i = 0; i < K; ++i)
std::cerr << res[i] << ' ';
std::cerr << std::endl;
return res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |