# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
625895 | goodluck2020 | Portals (BOI14_portals) | C++14 | 352 ms | 37692 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 task "SNAKE"
using namespace std;
const int N = 1e3 + 5;
int n, m, A[N][N];
struct Data
{
int x, y;
} S, C, D;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
struct Data2
{
int x, y, w;
} P;
struct cmp
{
bool operator() (Data2 A, Data2 B)
{
return A.w > B.w;
}
};
int Up[N][N], Down[N][N], Left[N][N], Right[N][N];
void init()
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
{
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |