#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <ll,ll> pll;
typedef pair <int,int> pii;
typedef pair <int,pii> piii;
#define forr(_a,_b,_c) for(int _a = (_b); _a <= int (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> int (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < int (_c); ++_a)
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"
template<class X, class Y>
bool minz(X &x, const Y &y) {
if (x > y) {
x = y;
return true;
} return false;
}
template<class X, class Y>
bool maxz(X &x, const Y &y) {
if (x < y) {
x = y;
return true;
} return false;
}
const int N = 5e2 + 5;
const ll oo = (ll) 1e16;
const ll mod = 1e9 + 7; // 998244353;
int dp[N][N], n, t, u;
vector <int> a[N];
map <int, int> f;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef hqm
freopen(file".inp", "r", stdin); freopen(file".out", "w", stdout);
#endif
cin >> n >> t;
forr (i, 1, n){
while (cin >> u && u != 0){
a[u].pb(i);
a[u + n].pb(i);
a[u].pb(i + n);
a[u + n].pb(i + n);
}
}
memset (dp, -1, sizeof dp);
forr (i, 1, 2 * n){
for (int u : a[i]){
dp[u][i] = 1;
}
}
int mx = 0;
forr (len, 1, n){
forr (i, 1, 2 * n - len + 1){
int u = i, v = i + len - 1;
if (dp[u][v] > mx){
mx = dp[u][v];
f.clear();
f[u] = 1;
} else if (dp[u][v] == mx){
f[u] = 1;
}
if (dp[u][v] != -1){
//cout << u << " " << v << " " << dp[u][v] << "\n";
for (int w : a[u]){
if (w < min(u, v) || w > max(u, v))
maxz(dp[w][u], dp[u][v] + 1);
}
}
swap(u, v);
if (dp[u][v] != -1){
//cout << u << " " << v << " " << dp[u][v] << "\n";
for (int w : a[u]){
if (w < min(u, v) || w > max(u, v))
maxz(dp[w][u], dp[u][v] + 1);
}
}
}
}
cout << mx << "\n" << f.size() << "\n";
return 0;
}
/*
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
1244 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
1372 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
1372 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
1368 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
1372 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
1500 KB |
Output isn't correct |
| 7 |
Incorrect |
2 ms |
1372 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
1372 KB |
Output isn't correct |
| 9 |
Incorrect |
3 ms |
1508 KB |
Output isn't correct |
| 10 |
Incorrect |
14 ms |
1624 KB |
Output isn't correct |
| 11 |
Incorrect |
3 ms |
1372 KB |
Output isn't correct |
| 12 |
Incorrect |
4 ms |
1672 KB |
Output isn't correct |
| 13 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
| 14 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
| 15 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
| 16 |
Runtime error |
1 ms |
488 KB |
Execution killed with signal 11 |
| 17 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
| 18 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
| 19 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
| 20 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
