#include<bits/stdc++.h>
//#define int long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define MOD 1000000007
#define inf 1e18
#define fi first
#define se second
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define sz(a) ((int)(a).size())
#define endl '\n'
#define pi 3.14159265359
#define TASKNAME "sailrace"
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
using namespace std;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
const int MAXN = 3e5 + 9;
string str;
int n, k;
vector<int> g[MAXN];
void extract(int curId){
int num = 0;
// cout << str << endl;
str = str + ' ';
for(int i = 0; i < str.length(); i++){
if (str[i] != ' ') {
num = num * 10 + (str[i] - '0');
// cout << num << ' ' << str[i] - '0' << endl;
}
else {
if (num != 0) {
g[curId].pb(num);
// cout << curId << ' ' << num << endl;
}
else break;
num = 0;
}
}
}
namespace subtask1{
bool check(){
return k == 0;
}
int dp[2][501][501], memo[2][501][501], backward = 0;
int goBack(int id){
return (id - backward <= 0) ? id - backward + n : (id - backward);
}
int goUp(int id){
return (id + backward) - ((id + backward > n) ? (n) : 0);
}
int memorization(int state, int Larc, int Rarc){
if (dp[state][Larc][Rarc] != -1) return dp[state][Larc][Rarc];
if (memo[state][goUp(Larc)][goUp(Rarc)] != -1) return memo[state][goUp(Larc)][goUp(Rarc)];
if (Larc >= Rarc) return 0;
dp[state][Larc][Rarc] = 0;
int cur = goUp((state) ? Rarc : Larc);
if (state == 0){
for(auto v: g[cur]){
int curV = goBack(v);
// cout << cur << ' ' << curV << ' ' << v << endl;
if (curV > Larc and curV <= Rarc) {
maximize(dp[0][Larc][Rarc], 1 + max(memorization(0, curV, Rarc), memorization(1, Larc + 1, curV)));
}
}
}
else{
for(auto v: g[cur]){
int curV = goBack(v);
if (curV >= Larc and curV < Rarc) {
maximize(dp[1][Larc][Rarc], 1 + max(memorization(0, curV, Rarc - 1), memorization(1, Larc, curV)));
}
}
}
// cout << state << ' ' << Larc << ' ' << Rarc << ' ' << dp[state][Larc][Rarc] << endl;
memo[state][goUp(Larc)][goUp(Rarc)] = dp[state][Larc][Rarc];
return dp[state][Larc][Rarc];
}
void solve(){
memset(memo, -1, sizeof(memo));
int bestI = 0, res = 0;
for(int i = 1;i <= n; i++){
memset(dp, -1, sizeof(dp));
backward = i - 1;
// cerr << i << endl;
int mx = memorization(0, 1, n);
if (maximize(res, mx)){
bestI = i;
}
}
cout << res << endl;
cout << bestI << endl;
}
}
main()
{
fast;
if (fopen(TASKNAME".inp","r")){
freopen(TASKNAME".inp","r",stdin);
freopen(TASKNAME".out","w",stdout);
}
cin >> n >> k;
cin.ignore();
for(int i = 1; i <= n; i++){
getline(cin, str);
extract(i);
}
if (subtask1::check()) return subtask1::solve(), 0;
subtask1::solve(), 0;
}
/**
Warning:
- MLE / TLE?
- Gioi han mang?
- Gia tri max phai luon gan cho -INF
- long long co can thiet khong?
- tran mang.
- code can than hon
- Nho sinh test de tranh RTE / TLE
--> Coi lai truoc khi nop
**/
Compilation message
race.cpp: In function 'void extract(int)':
race.cpp:30:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
30 | for(int i = 0; i < str.length(); i++){
| ~~^~~~~~~~~~~~~~
race.cpp: At global scope:
race.cpp:112:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
112 | main()
| ^~~~
race.cpp: In function 'int main()':
race.cpp:127:25: warning: right operand of comma operator has no effect [-Wunused-value]
127 | subtask1::solve(), 0;
| ^
race.cpp:116:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
116 | freopen(TASKNAME".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
race.cpp:117:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
117 | freopen(TASKNAME".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
11356 KB |
Output is correct |
| 2 |
Incorrect |
6 ms |
11356 KB |
Output isn't correct |
| 3 |
Incorrect |
6 ms |
11356 KB |
Output isn't correct |
| 4 |
Incorrect |
7 ms |
11356 KB |
Output isn't correct |
| 5 |
Correct |
8 ms |
11444 KB |
Output is correct |
| 6 |
Incorrect |
8 ms |
11356 KB |
Output isn't correct |
| 7 |
Correct |
12 ms |
11352 KB |
Output is correct |
| 8 |
Incorrect |
10 ms |
11356 KB |
Output isn't correct |
| 9 |
Correct |
13 ms |
11352 KB |
Output is correct |
| 10 |
Correct |
17 ms |
11356 KB |
Output is correct |
| 11 |
Correct |
13 ms |
11356 KB |
Output is correct |
| 12 |
Incorrect |
27 ms |
11484 KB |
Output isn't correct |
| 13 |
Incorrect |
44 ms |
11356 KB |
Output isn't correct |
| 14 |
Correct |
67 ms |
11356 KB |
Output is correct |
| 15 |
Incorrect |
166 ms |
11612 KB |
Output isn't correct |
| 16 |
Incorrect |
191 ms |
11608 KB |
Output isn't correct |
| 17 |
Incorrect |
172 ms |
11612 KB |
Output isn't correct |
| 18 |
Correct |
81 ms |
11352 KB |
Output is correct |
| 19 |
Incorrect |
243 ms |
11868 KB |
Output isn't correct |
| 20 |
Incorrect |
228 ms |
11868 KB |
Output isn't correct |
