oj.uz

Submission #53969

# Submission time Handle Problem Language Result Execution time Memory
53969 2018-07-02T06:22:23 Z khsoo01 Linear Garden (IOI08_linear_garden) C++11
100 / 100
 32 ms 5516 KB 
#include<bits/stdc++.h>
using namespace std;

const int N = 1000005;

int n, m, dt[N/2] = {1}, two[N/2] = {1};
char a[N];

int main()
{
	scanf("%d%d%s",&n,&m,a+1);
	for(int i=1;2*i<=n;i++) {
		two[i] = two[i-1] * 2 % m;
	}
	if(n%2) dt[0]++;
	for(int i=1;2*i<=n;i++) {
		dt[i] = (dt[i-1] + two[i-1] + two[i-1 + n%2]) % m;
	}
	int typ = 0, ans = 1;
	for(int i=1;2*i<=n;i++) {
		if(i == 1) {
			if(a[1] == 'P' && a[2] == 'P') {
				ans = (ans + two[(n-2*i)/2] + 2 * dt[n/2-i]) % m;
			}
			if(a[1] == 'P' && a[2] == 'L') {
				ans = (ans + two[(n-2*i)/2] + dt[n/2-i]) % m;
			}
			if(a[1] == 'L' && a[2] == 'P') {
				ans = (ans + two[(n-2*i)/2]) % m;
			}
			if(a[1] == a[2]) typ = 1;
		}
		else if(typ == 1) {
			if(a[2*i] == 'P') {
				ans = (ans + two[(n-2*i)/2]) % m;
			}
		}
		else if(typ == 2) {
			if(a[2*i] == 'L') {
				ans = (ans + two[(n-2*i+1)/2]) % m;
			}
		}
		else if(a[2*i-1] == a[1] && a[2*i] == a[2]) {
			if(a[1] == 'P') {
				ans = (ans + two[(n-2*i+1)/2]) % m;
			}
			else {
				ans = (ans + two[(n-2*i)/2]) % m;
			}
		}
		else {
			if(a[2*i-1] == 'P') {
				if(a[2*i] == 'P') {
					ans = (ans + two[(n-2*i+1)/2] + dt[n/2-i]) % m;
				}
				else {
					ans = (ans + two[(n-2*i)/2] + dt[n/2-i]) % m;
				}
			}
			if(a[2*i-1] == a[2*i]) typ = 1;
			else typ = 2;
		}
	}
	if(typ%2 == 0 && n%2 && a[n] == 'P') {
		ans = (ans + 1) % m;
	}
	printf("%d\n",ans);
}

Compilation message

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%s",&n,&m,a+1);
  ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
2.0 / 2.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

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

Subtask #5
4.0 / 4.0

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

Subtask #6
4.0 / 4.0

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

Subtask #7
4.0 / 4.0

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

Subtask #8
4.0 / 4.0

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

Subtask #9
4.0 / 4.0

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

Subtask #10
4.0 / 4.0

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

Subtask #11
4.0 / 4.0

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

Subtask #12
5.0 / 5.0

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

Subtask #13
5.0 / 5.0

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

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

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

Subtask #17
5.0 / 5.0

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

Subtask #18
5.0 / 5.0

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

Subtask #19
5.0 / 5.0

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

Subtask #20
5.0 / 5.0

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

Subtask #21
5.0 / 5.0

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

Subtask #22
5.0 / 5.0

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

Subtask #23
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5504 KB Output is correct
2 Correct 27 ms 5504 KB Output is correct
3 Correct 32 ms 5516 KB Output is correct