| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 55257 | paulica | Sailing Race (CEOI12_race) | C++14 | 2289 ms | 9600 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 _ << " _ " <<
#define TRACE(x) cout << #x << " = " << x << endl
const int MaxN = 510;
int n, m;
int sol, start;
bool con[MaxN][MaxN];
int memoA[MaxN][MaxN][2], memoB[MaxN][MaxN][2];
int nxt(int i, int d) {
if (d == 1) return i == n - 1 ? 0 : i + 1;
else return i == 0 ? n - 1 : i - 1;
if (d == 1) return (i + 1) % n;
return (i - 1 + n) % n;
}
int dpA(int i, int j, int d) {
int& dp = memoA[i][j][d];
if (dp != -1) return dp;
if (i == j) dp = 1;
else if (con[i][j]) dp = 2;
else dp = 0;
for (int k = i; k != j; k = nxt(k, d))
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||