Submission #131912

#	Time	Username	Problem	Language	Result	Execution time	Memory
131912		dragonslayerit	Linear Garden (IOI08_linear_garden)	C++14	85 / 100	98 ms	65540 KiB

linear_garden

#include <cstdio>
#include <cassert>

char str[1000005];
int MOD;

struct State{
  int max,curr;
  State(int max,int curr):max(max),curr(curr){
    assert(curr>=0&&curr<=max);
  }
  int code(){
    return max*3+curr;
  }
  State up()const{
    return (curr==max)?State(max+1,max+1):State(max,curr+1);
  }
  State down()const{
    return (curr==0)?State(max+1,0):State(max,curr-1);
  }
};

int memo[1000005][9];
int vis[1000005][9];

int complete(State prefix,int len){
  if(prefix.max>2) return 0;
  if(len==0) return 1;
  if(vis[len][prefix.code()]) return memo[len][prefix.code()];
  vis[len][prefix.code()]=true;
  return memo[len][prefix.code()]=(complete(prefix.up(),len-1)+complete(prefix.down(),len-1))%MOD;
}

int main(){
  int N;
  scanf("%d %d",&N,&MOD);
  scanf("%s",str);
  int ans=1;
  State prefix(0,0);
  for(int i=0;i<N;i++){
    if(str[i]=='P'){
      ans=(ans+complete(prefix.down(),N-i-1))%MOD;
      prefix=prefix.up();
    }else{
      prefix=prefix.down();
    }
  }
  printf("%d\n",ans);
  return 0;
}

Compilation message (stderr)

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

• 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: 0 / 5
• Subtask 22: 0 / 5
• Subtask 23: 0 / 5