제출 #57778

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57778		gnoor	Linear Garden (IOI08_linear_garden)	C++17	88 / 100	157 ms	35820 KiB

linear_garden

#include <cstdio>
#include <algorithm>

using namespace std;

int dp[1000100][3][3];

int main () {
	int n,m;
	scanf("%d%d",&n,&m);
	dp[0][0][0]=1;
	dp[0][1][1]=1;
	dp[0][2][2]=1;
	for (int i=1;i<n;i++) {
		for (int j=0;j<3;j++) {
			dp[i][j][0]=dp[i-1][j][1];
			dp[i][j][1]=dp[i-1][j][0]+dp[i-1][j][2];
			dp[i][j][1]%=m;
			dp[i][j][2]=dp[i-1][j][1];
		}
	}
	for (int i=0;i<n;i++) {
		for (int j=0;j<3;j++) {
			dp[i][j][0]+=dp[i][j][1]+dp[i][j][2];
			dp[i][j][0]%=m;	
		}
	}
	char x;
	int mn=0;
	int mx=0;
	int cur=0;
	int ans=0;
	int nmx,nmn;
	for (int i=0;i<n-1;i++) {
		scanf(" %c",&x);
		if (x=='P') {
			cur++;
			nmx=max(mx,cur);
			nmn=min(mn,cur);
			
			if (nmx-nmn==1) {
				if (nmx==0) {
					ans+=dp[n-i-1][2+cur][0]+dp[n-i-1][1+cur][0];
				} else {
					ans+=dp[n-i-1][1+cur][0]+dp[n-i-1][0+cur][0];
				}	
				ans--;
			} else if (nmx-nmn==2) {
				ans+=dp[n-i-1][cur-nmn][0];	
			}
			ans%=m;
			cur-=2;
			mx=max(mx,cur);
			mn=min(mn,cur);
		} else {
			cur++;
			mx=max(mx,cur);
			mn=min(mn,cur);
		}			
	}
	scanf(" %c",&x);
	if (x=='P') ans++;
	ans++;
	ans%=m;
	printf("%d\n",(ans+m)%m);
	return 0;
}

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

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
linear_garden.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %c",&x);
   ~~~~~^~~~~~~~~~
linear_garden.cpp:61:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf(" %c",&x);
  ~~~~~^~~~~~~~~~

• Subtask 1: 2 / 2
• Subtask 2: 2 / 2
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 0 / 4
• Subtask 7: 0 / 4
• Subtask 8: 4 / 4
• Subtask 9: 4 / 4
• Subtask 10: 0 / 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