제출 #53969

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
53969		khsoo01	Linear Garden (IOI08_linear_garden)	C++11	100 / 100	32 ms	5516 KiB

linear_garden

#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);
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 2
• Subtask 2: 2 / 2
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 4 / 4
• Subtask 7: 4 / 4
• Subtask 8: 4 / 4
• Subtask 9: 4 / 4
• Subtask 10: 4 / 4
• Subtask 11: 4 / 4
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5
• Subtask 22: 5 / 5
• Subtask 23: 5 / 5