# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260072 | arnold518 | Vim (BOI13_vim) | C++14 | 1008 ms | 99576 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 5000;
int N;
char A[MAXN+10];
int dp[MAXN+10][MAXN+10];
vector<int> V[10];
vector<int>::iterator low[MAXN+10][10], upp[MAXN+10][10];
int solve(int now, int pos)
{
int &ret=dp[now][pos];
if(ret!=-1) return ret;
ret=1e9;
for(int i=0; i<10; i++)
{
if(i==4) continue;
auto it=upp[now][i];
if(it==V[i].end()) continue;
ret=min(ret, solve(*it, pos)+2);
}
if(now>pos)
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... |