Submission #418165

#	Time	Username	Problem	Language	Result	Execution time	Memory
418165		manolismi	Linear Garden (IOI08_linear_garden)	C++17	100 / 100	83 ms	56004 KiB

linear_garden

#include <cstdio>
#include <algorithm>
using namespace std;

int N, M, dp[1000001][7][2];

int main()
{
  scanf("%d%d ",&N,&M);
  for (int k=1; k<6; k++) dp[N][k][0] = dp[N][k][1] = 1;
  for (int i=N-1; i>=0; i--)
    for (int k=1; k<6; k++)
    {
      dp[i][k][0] = (dp[i+1][min(k-1,1)][0] + dp[i+1][k+1][1])%M;
      dp[i][k][1] = (dp[i+1][k-1][0] + dp[i+1][max(k+1,5)][1])%M;
    }
    
  int ans=1, k=3, plant=-1;
  for (int i=1; i<=N; i++)
    if (getchar_unlocked()=='P')
    {
      ans = (ans+dp[i][plant==0?min(k-1,1):k-1][0])%M;
      k = plant==1 ? max(k+1,5) : k+1;
      plant = 1;
    }
    else
    {
      k = plant==0 ? min(k-1,1) : k-1;
      plant = 0;
    }
  printf("%d\n",ans);
}

Compilation message (stderr)

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:9:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |   scanf("%d%d ",&N,&M);
      |   ~~~~~^~~~~~~~~~~~~~~

• 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