oj.uz

Submission #970401

# Submission time Handle Problem Language Result Execution time Memory
970401 2024-04-26T13:32:35 Z starchan Linear Garden (IOI08_linear_garden) C++17
100 / 100
 143 ms 17084 KB 
#include<bits/stdc++.h>
using namespace std;
#define in array<int, 2>
#define pb push_back
#define pob pop_back
#define INF (int)1e17
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)

const int MX = 1e6+3;

int mod;

int dp[3][3][3];
int tmp[3][3][3];

int dd(int m, int M, int cur)
{
	if((M > 2) || (cur > M) || (cur < 0) || (m < 0))
		return 0;
	else
		return dp[m][M][cur];
}

int solve(int m, int M, int cur)
{
	if((M > 2) || (cur > M) || (cur < 0) || (m < 0))
		return 0;
	
	int m1 = m+min(0, cur-1); int opt1 = dd(m1, M+m-m1, cur+m-m1-1);
	int M2 = max(M, cur+1); int opt2 = dd(m, M2, cur+1);

	return (opt1+opt2)%mod;
}

array<int, 3> whatifL(int m, int M, int cur, int K)
{
	if((M > 2) || (cur > M) || (cur < 0) || (m < 0))
		return {-1, -1, -1};
	int m1 = m+min(0, cur-1); 
	return {m1, M+m-m1, cur+m-m1-1};
}

signed main()
{
	fast();
	int n;
	cin >> n >> mod;
	for(int i = 0; i < 3; i++)
	{
		for(int j = 0; j < 3; j++)
		{
			for(int k = 0; k < 3; k++)
				dp[i][j][k] = 1;
		}
	}

	vector<int> a(n+1);
	vector<array<int, 3>> Q(n+1, {-1});
	a[0] = 2;
	int m, M, cur, K;
	int ans = 0;
	m = M = cur = 2; K = n;
	for(int i = 1; i <= n; i++)
	{
		char c; cin >> c;
		a[i] = a[i-1] + ((c == 'P') ?: -1);
		if(c == 'P')
			Q[K] = whatifL(m, M-m, cur-m, K);
		K--; cur = a[i];
		m = min(m, a[i]); M = max(M, a[i]);
	}
	for(int i = 1; i <= n; i++)
	{
		auto [mv, Mv, curv] = Q[i];
		if(m == -1)
			continue;
		if((Mv <= 2) && (curv <= Mv) && (curv >= 0) && (mv >= 0))
			ans+=dp[mv][Mv][curv];
		for(int m = 0; m < 3; m++)
		{
			for(int M = 0; M < 3; M++)
			{
				for(int cur = 0; cur <= M; cur++)
					tmp[m][M][cur] = solve(m, M, cur);
			}
		}
		ans%=mod;
		swap(dp, tmp);
	}
	ans++; ans%=mod;
	cout << ans << "\n";
	return 0;
}

Compilation message

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:66:32: warning: the omitted middle operand in '?:' will always be 'true', suggest explicit middle operand [-Wparentheses]
   66 |   a[i] = a[i-1] + ((c == 'P') ?: -1);
      |                                ^

Subtask #1
2.0 / 2.0

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

Subtask #2
2.0 / 2.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

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

Subtask #5
4.0 / 4.0

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

Subtask #6
4.0 / 4.0

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

Subtask #7
4.0 / 4.0

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

Subtask #8
4.0 / 4.0

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

Subtask #9
4.0 / 4.0

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

Subtask #10
4.0 / 4.0

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

Subtask #11
4.0 / 4.0

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

Subtask #12
5.0 / 5.0

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

Subtask #13
5.0 / 5.0

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

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

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

Subtask #17
5.0 / 5.0

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

Subtask #18
5.0 / 5.0

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

Subtask #19
5.0 / 5.0

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

Subtask #20
5.0 / 5.0

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

Subtask #21
5.0 / 5.0

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

Subtask #22
5.0 / 5.0

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

Subtask #23
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 17084 KB Output is correct
2 Correct 131 ms 17080 KB Output is correct
3 Correct 128 ms 16988 KB Output is correct