# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
410356 | jhwest2 | IOI Fever (JOI21_fever) | C++14 | 10 ms | 11724 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 <bits/stdc++.h>
#define va first
#define vb second
using namespace std;
typedef long long lint;
typedef pair<int, int> pint;
typedef pair<int, pint> pip;
const int M = 1e5 + 10;
const int Dx[8] = { 2, 1, 0, -1, -2, -1, 0, 1 };
const int Dy[8] = { 0, 1, 2, 1, 0, -1, -2, -1 };
int n, ans, X[M], Y[M], Dir[M], Dist[M][4], Chk[M];
vector<int> V[8][3];
vector<pint> G[M][4];
int dist(int a, int b) {
return abs(X[a] - X[b]) + abs(Y[a] - Y[b]);
}
int get_x(int a, int axis) {
return X[a] * Dx[axis] + Y[a] * Dy[axis];
}
void solve() {
// 0 = Right, 2 = Up, 4 = Left, 6 = Down;
// 1 = Right-Up, 3 = Left-Up, 5 = Left-Down, 7 = Right-Down
for (int i = 2; i <= n; i++) {
if (Y[i] >= X[i] && Y[i] <= -X[i]) Dir[i] = 0;
if (Y[i] < X[i] && Y[i] <= -X[i]) Dir[i] = 2;
if (Y[i] < X[i] && Y[i] > -X[i]) Dir[i] = 4;
if (Y[i] >= X[i] && Y[i] > -X[i]) Dir[i] = 6;
Compilation message (stderr)
# | 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... |