# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
584550 |
2022-06-27T14:29:35 Z |
Kanaifu |
Miners (IOI07_miners) |
C++14 |
|
1500 ms |
162772 KB |
#include <bits/stdc++.h>
using namespace std;
int arr[100001];
unordered_map<int,int> dp[4][4][4][4];
int n;
int rec(int pos, int last_l, int plast_l, int last_r, int plast_r)
{
if (pos == n)
{
return 0;
}
if (dp[last_l][plast_l][last_r][plast_r][pos] != 0)
{
return dp[last_l][plast_l][last_r][plast_r][pos];
}
int inc = 1;
if (last_l != arr[pos] and last_l != 0)
{
inc++;
}
if (plast_l != arr[pos] and plast_l != last_l and plast_l != 0)
{
inc++;
}
dp[last_l][plast_l][last_r][plast_r][pos] = rec(pos+1, arr[pos], last_l, last_r, plast_r) + inc;
inc = 1;
if (last_r != arr[pos] and last_r != 0)
{
inc++;
}
if (plast_r != arr[pos] and plast_r != last_r and plast_r != 0)
{
inc++;
}
dp[last_l][plast_l][last_r][plast_r][pos] = max (dp[last_l][plast_l][last_r][plast_r][pos], rec(pos+1, last_l, plast_l, arr[pos], last_r) + inc);
return dp[last_l][plast_l][last_r][plast_r][pos];
}
int main()
{
cin>>n;
for (int i=0; i<n; i++)
{
char c;
cin>>c;
if (c=='B')
{
arr[i] = 1;
}
else if (c=='F')
{
arr[i] = 2;
}
else
{
arr[i] = 3;
}
}
cout<<rec(0, 0, 0, 0, 0);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
1748 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
4504 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
129 ms |
17324 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
399 ms |
37376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
609 ms |
97236 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1573 ms |
162772 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |