oj.uz

Submission #198898

# Submission time Handle Problem Language Result Execution time Memory
198898 2020-01-28T02:31:50 Z arnold518 Linear Garden (IOI08_linear_garden) C++14
59 / 100
 23 ms 10104 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e6;

int N, M, dp[MAXN+10][2], ans=1;
char S[MAXN+10];

int main()
{
	int i, j;

	scanf("%d%d%s", &N, &M, S+1);

	dp[0][0]=dp[0][1]=1;
	for(i=1; i<=N; i++)
	{
		dp[i][0]=dp[i-1][1];
		dp[i][1]=(dp[i-1][0]*2)%M;
	}

	int a=0, b=0, c=0;
	for(i=1; i<=N; i++)
	{
		if(S[i]=='P')
		{
			int cc=c+1;
			int aa=min(a, cc), bb=max(b, cc);
			if(bb-aa<=2)
			{
				int d=0;
				if(cc-1<=aa && bb<=cc+1) d++, ans+=dp[N-i][0];
				if(cc-2<=aa && bb<=cc) d++, ans+=dp[N-i][1];
				ans%=M;
				if(d==2) ans--, ans=(ans+M)%M;
			}
		}

		if(S[i]=='L') c++;
		else c--;
		a=min(a, c); b=max(b, c);
	}

	printf("%d", ans);
}

Compilation message

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:15:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
linear_garden.cpp:17:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%s", &N, &M, S+1);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
2.0 / 2.0

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

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 248 KB Output isn't correct

Subtask #4
4.0 / 4.0

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

Subtask #5
4.0 / 4.0

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

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 376 KB Output isn't correct

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 376 KB Output isn't correct

Subtask #8
4.0 / 4.0

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

Subtask #9
4.0 / 4.0

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

Subtask #10
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 376 KB Output isn't correct

Subtask #11
4.0 / 4.0

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

Subtask #12
5.0 / 5.0

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

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Incorrect 5 ms 376 KB Output isn't correct

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Incorrect 5 ms 380 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

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

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 888 KB Output isn't correct

Subtask #18
5.0 / 5.0

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

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 3320 KB Output isn't correct

Subtask #20
5.0 / 5.0

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

Subtask #21
5.0 / 5.0

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

Subtask #22
5.0 / 5.0

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

Subtask #23
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 10104 KB Output isn't correct
2 Halted 0 ms 0 KB -