# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59333 | wilwxk | Sailing Race (CEOI12_race) | C++11 | 638 ms | 4964 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;
const int MAXN=103;
vector<int> g[MAXN];
int dp[MAXN][MAXN][MAXN];
int n, k;
bool dentro(int ini, int fim, int val) {
if(ini<=fim) return (ini<=val&&val<=fim);
else {
if(val==ini||val==fim) return 1;
return !(fim<=val&&val<=ini);
}
}
int fazdp(int cur, int ini, int fim) {
if(dp[cur][ini][fim]!=-1) return dp[cur][ini][fim];
// printf("chama %d %d %d\n", cur, ini, fim);
int resp=0;
for(auto viz : g[cur]) {
if(!dentro(ini, fim, viz)) continue;
int vini, vfim;
if(dentro(ini, cur, viz)) {
vini=ini; vfim=cur;
if(fim==cur) vfim--;
}
else {
vini=cur; vfim=fim;
if(ini==cur) vini++;
}
if(vini==0) vini=n; if(vfim==0) vfim=n;
if(vini>n) vini%=n; if(vfim>n) vfim%=n;
resp=max(resp, fazdp(viz, vini, vfim)+1);
}
// printf("%d %d %d = %d\n", cur, ini, fim, resp);
return dp[cur][ini][fim]=resp;
}
int main() {
scanf("%d %d", &n, &k);
for(int i=1; i<=n; i++) {
while(1) {
int a; scanf("%d", &a);
if(a==0) break;
g[i].push_back(a);
}
}
memset(dp, -1, sizeof(dp)); int resp=0; int respp=1;
// resp=fazdp(6, 7, 6);
for(int i=1; i<=n; i++) {
if(fazdp(i, i==n ? 1 : i+1, i)>resp) {
resp=fazdp(i, i==n ? 1 : i+1, i);
respp=i;
}
//printf("asd %d: %d\n", i, fazdp(i, i+1, i));
}
printf("%d\n%d\n", resp, respp);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |