# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
661077 | lunchbox1 | Chess Rush (CEOI20_chessrush) | C++17 | 300 ms | 8268 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.
// 100p
#include <array>
#include <iostream>
#include <cmath>
using namespace std;
const int N = 1000, P = 1e9 + 7;
int solve(int m, int j1, int i2, int j2) {
int d = i2 / (m - 1);
if ((d % 2 == 0 && i2 % (m - 1) > abs(j1 - j2)) || (d % 2 == 1 && i2 % (m - 1) > abs(m - 1 - j1 - j2)))
d++;
return d + 1;
}
int m;
struct mat {
array<array<int, N>, N> f;
void identity() {
for (int i = 0; i < m; i++) {
fill(f[i].begin(), f[i].end(), 0);
f[i][i] = 1;
}
}
void square() {
static array<array<int, N>, N> g;
for (int i = 0; i < m; i++)
fill(g[i].begin(), g[i].end(), 0);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |