# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
248963 | pit4h | Soccer (JOI17_soccer) | C++14 | 1567 ms | 10504 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<iostream>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
using ll = long long;
using namespace std;
const int H=503, N=1e5+2;
const ll INF = 5e12+1;
int h, w, n, s[N], t[N];
ll a, b, c;
bool player[H][H];
ll closest[H][H];
ll minX[H][H], maxX[H][H];
bool vis[H][H];
ll dist[H][H];
ll minimal[H];
struct Obj {
ll d;
int x, y;
bool operator<(Obj o) const{
return d > o.d;
}
};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |