제출 #405421

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
405421		cgiosy	Linear Garden (IOI08_linear_garden)	C++17	59 / 100	7 ms	1228 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;
 
int main() {
	ios::sync_with_stdio(0);
	int N, M;
	cin>>N>>M;
	char S[N+1];
	cin>>S;
	int X=0, Y=0, Z=1;
	for(int i=0, t=0, l=0, r=0; i<N; i++) {
		X<<=N-i-1&1;
		X=X>=M ? X-M : X;
		Y<<=N-i&1;
		Y=Y>=M ? Y-M : Y;
		if(S[i]=='P') {
			if(t==l && r-l<2) X+=2+(N-i-1&1), Z--;
			else if(t==l) X++;
			else if(t<l+2) Y++;
			l=min(l, --t);
		} else r=max(r, ++t);
	}
	cout<<(X+Y+Z%M+M)%M<<'\n';
}

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

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:12:10: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   12 |   X<<=N-i-1&1;
      |       ~~~^~
linear_garden.cpp:14:8: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   14 |   Y<<=N-i&1;
      |       ~^~
linear_garden.cpp:17:31: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   17 |    if(t==l && r-l<2) X+=2+(N-i-1&1), Z--;
      |                            ~~~^~

• Subtask 1: 2 / 2
• Subtask 2: 2 / 2
• Subtask 3: 0 / 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: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 0 / 5
• Subtask 18: 5 / 5
• Subtask 19: 0 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5
• Subtask 22: 5 / 5
• Subtask 23: 0 / 5