제출 #131915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
131915		dragonslayerit	Linear Garden (IOI08_linear_garden)	C++14	95 / 100	194 ms	65540 KiB

linear_garden

#include <cstdio>
#include <cassert>

char str[1000005];
int MOD;

struct State{
  char max,curr;
  State(char max,char curr):max(max),curr(curr){
    assert(curr>=0&&curr<=max);
  }
  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;
  int code=prefix.max*3+prefix.curr;
  if(vis[len][code]) return memo[len][code];
  vis[len][code]=true;
  return memo[len][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++){
    for(int s=0;s<3;s++){
      for(int t=0;t<=s;t++){
	complete(State(s,t),i);
      }
    }
  }
  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;
}

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

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:34: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:35: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: 5 / 5
• Subtask 22: 5 / 5
• Subtask 23: 0 / 5