oj.uz

Submission #263041

# Submission time Handle Problem Language Result Execution time Memory
263041 2020-08-13T12:23:14 Z ElyesChaabouni Linear Garden (IOI08_linear_garden) C++14
100 / 100
 166 ms 1016 KB 
/*#pragma GCC optimize("O3")*/
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp> 
//#define ordered_set tree<int, null_type,less<int >, rb_tree_tag,tree_order_statistics_node_update> 
#define eps 1e-9
#define MOD1 998244353
#define MOD2 1000000007
#define INV_10 299473306
#define INF 1000000000
#define PI 3.14159265358979323846
using namespace std;
int dp[4][9][2];
bitset<1000001>a;
int n, m, pp, ll;
int solve()
{
	dp[0][0][0]=1;
	for(int idx = 0; idx <= n; idx++)
	{
      for(int d = 0; d < 9; d++)
			for(int b = 0; b < 2; b++)
              dp[(idx+1)%4][d][b]=0;
		for(int d = 0; d < 9; d++)
		{
			for(int b = 0; b < 2; b++)
			{
				if(a.test(idx))
				{
					if(d/3 < 2)
					{
						pp=d/3;
						ll=d%3;
						pp++;
						ll--;
						ll=max(ll, 0);
						dp[(idx+1)%4][pp*3+ll][b]+=dp[idx%4][d][b];
						dp[(idx+1)%4][pp*3+ll][b]%=m;
					}
					if(d%3 < 2)
					{
						pp=d/3;
						ll=d%3;
						pp--;
						ll++;
						pp=max(pp, 0);
						dp[(idx+1)%4][pp*3+ll][1]+=dp[idx%4][d][b];
						dp[(idx+1)%4][pp*3+ll][1]%=m;
					}
				}
				else
				{
					if(d%3 < 2)
					{
						pp=d/3;
						ll=d%3;
						pp--;
						ll++;
						pp=max(pp, 0);
						dp[(idx+1)%4][pp*3+ll][b]+=dp[idx%4][d][b];
						dp[(idx+1)%4][pp*3+ll][b]%=m;
					}
					if(d/3 < 2 && b)
					{
						pp=d/3;
						ll=d%3;
						pp++;
						ll--;
						ll=max(ll, 0);
						dp[(idx+1)%4][pp*3+ll][b]+=dp[idx%4][d][b];
						dp[(idx+1)%4][pp*3+ll][b]%=m;
					}
				}
			}
		}
	}
	int ans=0;
	for(int i = 0; i < 9; i++)
	{
		for(int j = 0; j < 2; j++)
		{
			ans+=dp[n%4][i][j];
			ans%=m;
		}
	}
	return ans;
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> m;
	char c;
	for(int i = 0; i < n; i++)
	{
		cin >> c;
		if(c=='P')
			a[i]=1;
	}
	cout << solve() << '\n';
}
//size

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #7
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #9
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct

Subtask #10
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct

Subtask #11
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 384 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 384 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 416 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 384 KB Output is correct

Subtask #21
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 416 KB Output is correct

Subtask #22
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 504 KB Output is correct

Subtask #23
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 512 KB Output is correct
2 Correct 164 ms 1016 KB Output is correct
3 Correct 162 ms 896 KB Output is correct