/// In The Name Of God
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = (int)500 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using namespace std;
int n, k;
vector <int> g[N];
bool ok[N][N];
int dp[N][N][2];
int nxt(int x) {
if (x == 1) return n;
return x - 1;
}
int prv(int x) {
if (x == n) return 1;
return x + 1;
}
int calc(int A, int B, int t) {
if (~dp[A][B][t]) return dp[A][B][t];
int res = 0;
if (t) {
for (int i = nxt(A); i != B; i = nxt(i)) {
if (ok[B][i]) {
res = max(res, calc(A, i, 1) + 1);
res = max(res, calc(i, B, 1) + 1);
}
}
}
else {
for (int i = prv(A); i != B; i = prv(i)) {
if (ok[B][i]) {
res = max(res, calc(A, i, 0) + 1);
res = max(res, calc(i, B, 0) + 1);
}
}
}
return dp[A][B][t] = res;
}
int main() {
#ifdef IOI2018
freopen ("in.txt", "r", stdin);
#endif
scanf ("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
int to;
while (scanf ("%d", &to) && to) {
ok[i][to] = 1;
}
}
memset(dp, -1, sizeof(dp));
int mx = 0, opt = -1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (ok[i][j]) {
int last = mx;
mx = max(mx, calc(i, j, 0) + 1);
mx = max(mx, calc(i, j, 1) + 1);
if (mx > last) opt = i;
}
}
}
printf ("%d\n%d", mx, opt);
ioi
}
Compilation message
race.cpp: In function 'int main()':
race.cpp:73:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf ("%d%d", &n, &k);
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
4284 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
4284 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
4284 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
4284 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
4284 KB |
Output isn't correct |
| 6 |
Incorrect |
3 ms |
4284 KB |
Output isn't correct |
| 7 |
Incorrect |
3 ms |
4284 KB |
Output isn't correct |
| 8 |
Incorrect |
3 ms |
4284 KB |
Output isn't correct |
| 9 |
Incorrect |
3 ms |
4284 KB |
Output isn't correct |
| 10 |
Correct |
6 ms |
4284 KB |
Output is correct |
| 11 |
Incorrect |
9 ms |
4284 KB |
Output isn't correct |
| 12 |
Incorrect |
36 ms |
4284 KB |
Output isn't correct |
| 13 |
Incorrect |
86 ms |
4284 KB |
Output isn't correct |
| 14 |
Incorrect |
173 ms |
4284 KB |
Output isn't correct |
| 15 |
Incorrect |
449 ms |
4284 KB |
Output isn't correct |
| 16 |
Incorrect |
503 ms |
4284 KB |
Output isn't correct |
| 17 |
Incorrect |
449 ms |
4284 KB |
Output isn't correct |
| 18 |
Incorrect |
249 ms |
4284 KB |
Output isn't correct |
| 19 |
Incorrect |
556 ms |
4284 KB |
Output isn't correct |
| 20 |
Incorrect |
559 ms |
4284 KB |
Output isn't correct |
