제출 #957291

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
957291		DeltaStruct	Linear Garden (IOI08_linear_garden)	C++17	0 / 100	416 ms	2320 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;
#define int long long
 
signed main(){
  int n,m,r=0; cin >> n >> m; string s; cin >> s;
  vector dp(5,vector(5,vector<int>(5))); auto res = dp; for (int i(0);i < 5;++i) dp[i][i][i] = 1;
  int t = 2; for (char a:s) t += (a=='L'?1:-1);
  for (int i(n-1);i > -1;--i){
    t -= (s[i]=='L'?1:-1);
    if (s[i]=='P'&&t+1<5) for (int k(0);k < 5;++k) for (int j(0);j < 5;++j) (r += dp[t+1][k][j])%=m;
    for (int u(0);u < 5;++u){
      for (int k(0);k < 5;++k) for (int j(0);j < 5;++j) res[u][k][j] = 0;
      if (u!=4) for (int k(0);k < 5;++k) for (int j(k);j < 4;++j) (res[u][min(k+1,u+1)][max(j+1,u+1)] += dp[u][k][j])%=m;
      if (u!=0) for (int k(1);k < 5;++k) for (int j(k);j < 5;++j) (res[u][min(k-1,u-1)][max(j-1,u-1)] += dp[u][k][j])%=m;
    }
    swap(dp,res);
  }
  cout << r << endl;
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 2
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 4
• Subtask 7: 0 / 4
• Subtask 8: 0 / 4
• Subtask 9: 0 / 4
• Subtask 10: 0 / 4
• Subtask 11: 0 / 4
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5
• Subtask 22: 0 / 5
• Subtask 23: 0 / 5