| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 79466 | tmwilliamlin168 | Sailing Race (CEOI12_race) | C++14 | 0 ms | 0 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 mxN=500;
int n, ai, dp1[mxN][mxN][2], dp2[mxN][mxN], dp3[mxN][mxN][2];
bool k, adj[mxN][mxN];
array<int, 2> ans;
void c(int l, int r, int a) {
int d=a?1:-1;
if(adj[l][r]) {
dp1[l][r][a]=1;
dp2[l][r][a]=1+dp3[r][(l+d+n)%n][a^1];
} else
dp1[l][r][a]=dp2[l][r][a]=-n;
for(int k=(l+d+n)%n; k!=r; k=(k+d+n)%n) {
dp1[l][r][a]=max(dp1[l][k][a]+dp1[k][r][a], dp1[l][r][a]);
dp2[l][r][a]=max(dp1[l][k][a]+dp2[k][r][a], dp1[l][r][a]);
}
dp3[l][r][a]=max(dp[l][r][a][1], dp3[l][(r-d+n)%n][a]);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for(int i=0; i<n; ++i) {
cin >> ai;
while(ai) {
adj[i][ai-1]=1;
cin >> ai;
}
}
for(int l=1; l<n; ++l) {
for(int i=0; i<n; ++i) {
c(i, (i+l)%n, 1);
c((i+l)%n, i, 0);
}
}
for(int i=0; i<n; ++i)
for(int j=0; j<n; ++j)
for(int k=0; k<2; ++k)
ans=max({{dp2[i][j][k], i}, ans});
if(k) {
for(int i=0; i<n; ++i) {
for(int j=0; j<n; ++j) {
for(int a=0, d=-1; a<2; ++a, d=-d) {
if(dp1[i][j][a]<=0)
continue;
int k=(j+d+n)%n;
for(; k!=i&&!adj[k][i]; k=(k+d+n)%n);
if(k!=i)
for(int l=(k+d+n)%n; l!=i; l=(l+d+n)%n)
if(adj[j][l])
ans=max({{2+dp1[i][j][a]+max(dp3[l][(k+d+n)%n][a^1], dp3[l][(i-d+n)%n][a]), k}, ans});
}
}
}
}
cout << ans[0] << "\n" << ans[1]+1;
}