# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132226 | youngyojun | Wild Boar (JOI18_wild_boar) | C++11 | 15858 ms | 826664 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 eb emplace_back
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;
typedef pair<ll, int> pli;
const int MAXK = 100005;
ll dp[MAXK*3][7][7];
vector<int> G[2005];
ll F[2005][2005][7];
int FVA[2005][2005][7], FVB[2005][2005][7];
int FA[2005][2005][5], FB[2005][2005][5];
ll E[4005][4005];
int A[2005], B[2005], C[2005];
int D[MAXK];
int N, M, K, Q;
ll get() { return *min_element(dp[1][0], dp[1][6]+7); }
void cal(int i, int s, int e) {
if(s == e) {
for(int a = 0; a < 7; a++) for(int b = 0; b < 7; b++)
dp[i][a][b] = a == b ? F[D[s]][D[s+1]][a] : INFLL;
# | 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... |