# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
55222 | linkret | Sailing Race (CEOI12_race) | C++14 | 3059 ms | 6224 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 = 505, inf = 1e9;
int n, id;
vector<int> adj[maxn];
vector<int> radj[maxn];
bool between(int l, int r, int i) {
if(l > r) {
return i >= l || i <= r;
} else {
return i >= l && i <= r;
}
}
int dist(int i, int j) {
if(i <= j)
return j - i;
return n - i + j;
}
int dp[2][2][maxn][maxn];
int f[maxn][maxn];
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> id;
for(int i = 0, j; i < n; i++) {
while(true) {
cin >> j;
if(!j) break;
j--;
adj[i].push_back(j);
radj[j].push_back(i);
}
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
f[i][j] = -1;
for(int k : radj[i]) {
if(between(j, i, k))
continue;
if(f[i][j] == -1)
f[i][j] = k;
if(dist(i, f[i][j]) < dist(i, k))
f[i][j] = k;
}
}
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
dp[1][0][i][j] = -inf;
dp[1][1][i][j] = -inf;
}
}
for(int i = 0; i < n; i++) {
dp[1][0][i][i] = 0;
dp[1][1][i][i] = 0;
}
for(int len = 1; len < n; len++) {
for(int i = 0; i < n; i++) {
int j = (i + len) % n;
for(int k : radj[j]) {
if(between(i, j, k)) {
dp[1][0][i][j] = max(dp[1][0][i][j], 1 + dp[1][0][i][k]);
}
}
for(int k : radj[i]) {
if(between(i, j, k)) {
dp[1][1][i][j] = max(dp[1][1][i][j], 1 + dp[1][1][k][j]);
}
}
for(int k : adj[i]) {
if(between(i, j, k)) {
dp[0][0][i][j] = max(dp[0][0][i][j], 1 + max(dp[0][1][(i + 1) % n][k], dp[0][0][k][j]));
}
}
for(int k : adj[j]) {
if(between(i, j, k)) {
dp[0][1][i][j] = max(dp[0][1][i][j], 1 + max(dp[0][1][i][k], dp[0][0][k][(j - 1 + n) % n]));
}
}
}
}
int mxm = 0, t = 0;
for(int i = 0; i < n; i++) {
int tmp = dp[0][0][i][(i - 1 + n) % n];
if(tmp > mxm) {
mxm = tmp;
t = i;
}
}
if(id) {
for(int i = 0; i < n; i++) {
for(int j = 0, l; j < n; j++) {
for(int k : adj[j]) {
if(between(j, k, i))
l = f[i][j];
else
l = f[i][k];
set<int> st;
st.insert(i);
st.insert(j);
st.insert(k);
st.insert(l);
if(st.size() != 4 || l == -1)
continue;
if(between(j, k, i)) {
int tmp = 0;
if(between(k, j, l)) {
tmp = dp[1][1][j][i] + 2 + max(dp[0][1][(i + 1) % n][k], dp[0][0][k][l]);
} else {
// tmp = dp[1][1][j][i] + 2 + max(dp[0][1][(i + 1) % n][k], dp[0][0][k][(j - 1 + n) % n]);
}
// if(tmp == 6) {
// cout << i << " " << j << " " << k << ", l je " << l << endl;
// }
if(tmp > mxm) {
mxm = tmp;
t = l;
}
} else {
// int tmp = 0;
// if(between(k, j, l)) {
// tmp = dp[1][1][j][i] + 2 + max(dp[0][1][(i + 1) % n][k], dp[0][0][k][l]);
// } else {
// // tmp = dp[1][1][j][i] + 2 + max(dp[0][1][(i + 1) % n][k], dp[0][0][k][(j - 1 + n) % n]);
// }
// // if(tmp == 6) {
// // cout << i << " " << j << " " << k << ", l je " << l << endl;
// // }
// if(tmp > mxm) {
// mxm = tmp;
// t = l;
// }
}
}
}
}
}
cout << mxm << endl << t + 1 << endl;
// for(int i = 0; i < n; i++) {
// for(int j = 0; j < n; j++) {
// int k = dp[0][1][i][j];
// if(k < 0)
// cout << 'x' << " ";
// else
// cout << k << " ";
// }
// cout << endl;
// }
// for(int i = 0; i < n; i++) {
// for(int j = 0; j < n; j++) {
// cout << f[i][j] << " ";
// }
// cout << endl;
// }
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |