# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
654843 | keta_tsimakuridze | Soccer (JOI17_soccer) | C++14 | 514 ms | 25748 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 f first
#define s second
#define int long long
#define pii pair<int,int>
#define PII pair<pii,pii>
using namespace std;
const int N = 505 + 5, inf = 1e18; // !
int d[N][N][2], D[N][N][6];int n, m;
int dx[] = {0, 0, 0, 1, -1}, dy[] = {0, 1, -1, 0, 0};
bool ok(int i,int j) {
return (min(i, j) >= 0 && i <= n && j <= m);
}
main(){
cin >> n >> m;
int a, b, c;
cin >> a >> b >> c;
for(int i = 0; i <= n; i++) {
for(int j = 0; j <= m; j++) {
d[i][j][0] = d[i][j][1] = inf;
for(int t = 0; t <= 5; ++t) D[i][j][t] = inf;
}
}
int Q;
cin >> Q;
priority_queue<PII, vector<PII>, greater<PII> > pq;
queue<pair<int,int>> q[2];
for(int i = 1; i <= Q; i++) {
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... |