# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
793924 | ymm | IOI Fever (JOI21_fever) | C++17 | 5050 ms | 46488 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 Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
//typedef std::pair<int,int> pii;
using namespace std;
#define int ll
const int N = 100'010;
map<int,vector<int>> wa, as, sd, dw;
int X[N], Y[N];
int dis[N];
int n;
enum dir { W, A, S, D};
map<int,vector<int>> *dvec[4][2] = {
{&dw, &wa},
{&as, &wa},
{&as, &sd},
{&dw, &sd},
};
pair<int,dir> colide(int i, int j, dir d)
{
int x = X[j] - X[i];
int y = Y[j] - Y[i];
assert(abs(x) == abs(y));
switch (d) {
case W: return {y, x > 0? A: D};
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... |