oj.uz

Submission #970376

# Submission time Handle Problem Language Result Execution time Memory
970376 2024-04-26T12:51:11 Z starchan Linear Garden (IOI08_linear_garden) C++17
65 / 100
 15 ms 65536 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][MX];

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

	return dp[m][M][cur][K] = (opt1+opt2)%mod;
}

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

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++)
			{
				for(int ell = 0; ell < n; ell++)
					dp[i][j][k][ell] = -1;
			}
		}
	}
	vector<int> a(n+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')
			ans+=whatifL(m, M-m, cur-m, K);
		K--; cur = a[i];
		m = min(m, a[i]); M = max(M, a[i]);
		ans%=mod;
	}
	ans++; ans%=mod;
	cout << ans << "\n";
	return 0;
}

Compilation message

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

Subtask #1
2.0 / 2.0

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

Subtask #2
2.0 / 2.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

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

Subtask #5
4.0 / 4.0

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

Subtask #6
4.0 / 4.0

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

Subtask #7
4.0 / 4.0

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

Subtask #8
4.0 / 4.0

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

Subtask #9
4.0 / 4.0

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

Subtask #10
4.0 / 4.0

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

Subtask #11
4.0 / 4.0

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

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 53592 KB Output is correct
2 Correct 6 ms 53596 KB Output is correct

Subtask #13
5.0 / 5.0

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

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 53852 KB Output is correct
2 Correct 13 ms 54124 KB Output is correct
3 Correct 6 ms 53852 KB Output is correct

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

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

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 15 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 14 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 11 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 15 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #22
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #23
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -