# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
651517 | lunchbox | Soccer (JOI17_soccer) | C++17 | 457 ms | 19044 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.
/*
author: lunchbox
problem link: https://oj.uz/problem/submit/JOI17_soccer
*/
#include <bits/stdc++.h>
using namespace std;
#define sz(v) static_cast<int>((v).size())
#define long long long
template<class T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;
#ifdef LOCAL
#define dbg(...) printf("\033[1;34m% 4d \033[32m|\033[0m ", __LINE__), printf(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
const int N = 501, K = 100000;
const long INF = 0x3f3f3f3f3f3f3f3f;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
static int xx[K], yy[K], cc[N][N];
static long dd[N][N][5];
min_pq<tuple<long, int, int, int>> pq;
queue<pair<int, int>> qu;
int n, m, k, a, b, c;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |