# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
397653 | phathnv | IOI Fever (JOI21_fever) | C++11 | 977 ms | 119364 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>
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;
const int LOGN = 17;
const int INF = 1e9 + 7;
struct Edge{
int v, w;
Edge(int _v, int _w){
v = _v;
w = _w;
}
};
int n, x[N], y[N], curInd, ind[N][4], f[N][2][4], nxt[N][2][4][LOGN], ord[N], dist[N * 12];
vector<Edge> adj[N * 12];
bool imp[N];
int Dist(int a, int b){
int dx = abs(x[a] - x[b]);
int dy = abs(y[a] - y[b]);
assert(dx == dy);
return dx;
}
int Calc(int s){
for(int i = 1; i <= curInd; i++)
# | 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... |