# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
654297 | lunchbox1 | Soccer (JOI17_soccer) | C++17 | 437 ms | 19068 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.
/*
Soccer
https://oj.uz/problem/view/JOI17_soccer
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
template<class T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;
const int N = 501, K = 100000;
const LL INF = 0x3f3f3f3f3f3f3f3f;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
static int xx[K], yy[K], cc[N][N];
static LL dd[N][N][5];
min_pq<tuple<LL, int, int, int>> pq;
queue<pair<int, int>> qu;
int n, m, k, a, b, c;
LL ans;
auto ad_qu = [&](int x, int y, int d) {
if (x >= 0 && x < n && y >= 0 && y < m && cc[x][y] == -1) {
cc[x][y] = d;
qu.push({x, y});
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |