| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 422012 | shenxy | Navigation 2 (JOI21_navigation2) | C++17 | 1045 ms | 820 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 <algorithm>
#include <vector>
using namespace std;
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 flag = (i + j) % 2;
for (int k = 0; k < K; ++k) {
if ((i + j) % 2) {
if ((abs(R[k] - i) + abs(C[k] - j)) % 4 == 2 || (abs(R[k] - i) + abs(C[k] - j)) % 4 == 3) flag = flag * 2 + 1;
else flag = flag * 2;
} else if ((abs(R[k] - i) + abs(C[k] - j)) % 4 == 0 || (abs(R[k] - i) + abs(C[k] - j)) % 4 == 3) flag = flag * 2 + 1;
else flag = flag * 2;
}
SetFlag(i, j, flag + 1);
}
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||