# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
651136 | lukameladze | Soccer (JOI17_soccer) | C++14 | 545 ms | 42680 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;
#define f first
#define s second
#define int long long
#define pii pair <int, int>
#define pb push_back
const int N = 1000, M = 1e5 + 5, inf = 1e18;
int t,n,a,b,c,h,w,x[M],y[M],dx[] = {0,0,1,-1}, dy[] = {1,-1,0,0};
int dp[N][N][10],dist[N][N];
int check(int x, int y) {
return (!(x <= 0 || y <= 0 || x > h || y > w));
}
void bfs() {
queue <pii> q;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
dist[i][j] = inf;
}
}
for (int i = 1; i <= n; i++) {
dist[x[i]][y[i]] = 0;
q.push({x[i],y[i]});
}
while (!q.empty()) {
int x = q.front().f;
int y = q.front().s;
q.pop();
for (int i = 0; i <= 3; i++) {
int nx = x + dx[i]; int ny = y + dy[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... |